/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:31:52,246 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:31:52,248 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:31:52,259 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:31:52,259 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:31:52,260 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:31:52,261 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:31:52,263 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:31:52,264 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:31:52,265 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:31:52,266 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:31:52,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:31:52,267 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:31:52,268 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:31:52,269 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:31:52,270 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:31:52,271 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:31:52,272 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:31:52,273 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:31:52,275 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:31:52,276 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:31:52,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:31:52,278 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:31:52,279 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:31:52,281 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:31:52,281 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:31:52,282 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:31:52,282 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:31:52,283 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:31:52,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:31:52,284 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:31:52,284 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:31:52,285 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:31:52,286 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:31:52,287 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:31:52,287 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:31:52,288 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:31:52,288 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:31:52,288 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:31:52,289 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:31:52,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:31:52,290 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 12:31:52,304 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:31:52,304 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:31:52,305 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:31:52,306 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:31:52,306 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:31:52,306 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:31:52,306 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:31:52,306 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:31:52,306 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:31:52,307 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:31:52,307 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:31:52,307 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:31:52,307 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:31:52,307 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:31:52,307 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:31:52,308 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:31:52,308 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:31:52,308 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:31:52,308 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:31:52,308 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:31:52,308 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:31:52,309 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:31:52,309 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:31:52,309 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:31:52,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:31:52,309 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:31:52,309 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:31:52,310 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:31:52,310 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:31:52,474 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:31:52,487 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:31:52,491 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:31:52,493 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:31:52,493 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:31:52,494 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:31:52,585 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_HPueqc/tmp/8ef2fb5505374897925aefa384bc9b60/FLAG3bce0706c [2020-07-01 12:31:52,925 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:31:52,926 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:31:52,926 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:31:52,933 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_HPueqc/tmp/8ef2fb5505374897925aefa384bc9b60/FLAG3bce0706c [2020-07-01 12:31:53,323 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_HPueqc/tmp/8ef2fb5505374897925aefa384bc9b60 [2020-07-01 12:31:53,334 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:31:53,335 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:31:53,336 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:31:53,337 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:31:53,340 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:31:53,341 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:31:53" (1/1) ... [2020-07-01 12:31:53,344 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f1c41e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:53, skipping insertion in model container [2020-07-01 12:31:53,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:31:53" (1/1) ... [2020-07-01 12:31:53,352 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:31:53,371 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:31:53,610 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:31:53,622 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:31:53,644 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:31:53,660 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:31:53,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:53 WrapperNode [2020-07-01 12:31:53,661 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:31:53,662 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:31:53,662 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:31:53,662 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:31:53,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:53" (1/1) ... [2020-07-01 12:31:53,681 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:53" (1/1) ... [2020-07-01 12:31:53,707 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:31:53,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:31:53,707 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:31:53,707 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:31:53,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:53" (1/1) ... [2020-07-01 12:31:53,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:53" (1/1) ... [2020-07-01 12:31:53,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:53" (1/1) ... [2020-07-01 12:31:53,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:53" (1/1) ... [2020-07-01 12:31:53,729 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:53" (1/1) ... [2020-07-01 12:31:53,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:53" (1/1) ... [2020-07-01 12:31:53,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:53" (1/1) ... [2020-07-01 12:31:53,738 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:31:53,739 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:31:53,739 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:31:53,739 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:31:53,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:53" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:31:53,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:31:53,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:31:53,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:31:53,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:31:53,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:31:53,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:31:54,121 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:31:54,122 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-01 12:31:54,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:31:54 BoogieIcfgContainer [2020-07-01 12:31:54,126 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:31:54,127 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:31:54,127 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:31:54,129 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:31:54,130 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:31:54" (1/1) ... [2020-07-01 12:31:54,147 INFO L313 BlockEncoder]: Initial Icfg 43 locations, 50 edges [2020-07-01 12:31:54,148 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:31:54,149 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:31:54,149 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:31:54,150 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:31:54,151 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:31:54,152 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:31:54,152 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:31:54,184 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:31:54,226 INFO L200 BlockEncoder]: SBE split 23 edges [2020-07-01 12:31:54,230 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-07-01 12:31:54,232 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:31:54,256 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding [2020-07-01 12:31:54,259 INFO L70 RemoveSinkStates]: Removed 25 edges and 2 locations by removing sink states [2020-07-01 12:31:54,261 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:31:54,261 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:31:54,261 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:31:54,262 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:31:54,263 INFO L313 BlockEncoder]: Encoded RCFG 36 locations, 73 edges [2020-07-01 12:31:54,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:31:54 BasicIcfg [2020-07-01 12:31:54,263 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:31:54,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:31:54,265 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:31:54,268 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:31:54,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:31:53" (1/4) ... [2020-07-01 12:31:54,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b4e126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:31:54, skipping insertion in model container [2020-07-01 12:31:54,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:53" (2/4) ... [2020-07-01 12:31:54,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b4e126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:31:54, skipping insertion in model container [2020-07-01 12:31:54,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:31:54" (3/4) ... [2020-07-01 12:31:54,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b4e126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:31:54, skipping insertion in model container [2020-07-01 12:31:54,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:31:54" (4/4) ... [2020-07-01 12:31:54,272 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:31:54,282 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:31:54,290 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2020-07-01 12:31:54,304 INFO L251 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2020-07-01 12:31:54,327 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:31:54,327 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:31:54,327 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:31:54,327 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:31:54,328 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:31:54,328 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:31:54,328 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:31:54,328 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:31:54,344 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2020-07-01 12:31:54,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:31:54,349 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:54,350 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:31:54,351 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:31:54,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:54,356 INFO L82 PathProgramCache]: Analyzing trace with hash 253520800, now seen corresponding path program 1 times [2020-07-01 12:31:54,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:54,367 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590821573] [2020-07-01 12:31:54,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:54,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:54,520 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590821573] [2020-07-01 12:31:54,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:31:54,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:31:54,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128893536] [2020-07-01 12:31:54,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:31:54,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:54,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:31:54,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:31:54,544 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2020-07-01 12:31:54,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:54,688 INFO L93 Difference]: Finished difference Result 68 states and 137 transitions. [2020-07-01 12:31:54,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:31:54,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:31:54,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:54,704 INFO L225 Difference]: With dead ends: 68 [2020-07-01 12:31:54,704 INFO L226 Difference]: Without dead ends: 36 [2020-07-01 12:31:54,708 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:31:54,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-01 12:31:54,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-01 12:31:54,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-01 12:31:54,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 68 transitions. [2020-07-01 12:31:54,748 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 68 transitions. Word has length 5 [2020-07-01 12:31:54,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:54,749 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 68 transitions. [2020-07-01 12:31:54,749 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:31:54,749 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 68 transitions. [2020-07-01 12:31:54,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:31:54,749 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:54,750 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:31:54,750 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:31:54,750 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:31:54,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:54,751 INFO L82 PathProgramCache]: Analyzing trace with hash 253520831, now seen corresponding path program 1 times [2020-07-01 12:31:54,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:54,751 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20780663] [2020-07-01 12:31:54,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:54,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:54,803 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20780663] [2020-07-01 12:31:54,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:31:54,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:31:54,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551189883] [2020-07-01 12:31:54,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:31:54,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:54,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:31:54,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:31:54,806 INFO L87 Difference]: Start difference. First operand 36 states and 68 transitions. Second operand 3 states. [2020-07-01 12:31:54,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:54,904 INFO L93 Difference]: Finished difference Result 36 states and 68 transitions. [2020-07-01 12:31:54,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:31:54,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:31:54,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:54,905 INFO L225 Difference]: With dead ends: 36 [2020-07-01 12:31:54,906 INFO L226 Difference]: Without dead ends: 35 [2020-07-01 12:31:54,907 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:31:54,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-01 12:31:54,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-01 12:31:54,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-01 12:31:54,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 66 transitions. [2020-07-01 12:31:54,912 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 66 transitions. Word has length 5 [2020-07-01 12:31:54,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:54,913 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 66 transitions. [2020-07-01 12:31:54,913 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:31:54,913 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 66 transitions. [2020-07-01 12:31:54,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:31:54,913 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:54,914 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:31:54,914 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:31:54,914 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:31:54,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:54,914 INFO L82 PathProgramCache]: Analyzing trace with hash 253520833, now seen corresponding path program 1 times [2020-07-01 12:31:54,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:54,915 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328876789] [2020-07-01 12:31:54,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:54,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:54,948 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328876789] [2020-07-01 12:31:54,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:31:54,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:31:54,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765987059] [2020-07-01 12:31:54,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:31:54,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:54,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:31:54,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:31:54,950 INFO L87 Difference]: Start difference. First operand 35 states and 66 transitions. Second operand 3 states. [2020-07-01 12:31:55,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:55,057 INFO L93 Difference]: Finished difference Result 36 states and 66 transitions. [2020-07-01 12:31:55,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:31:55,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:31:55,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:55,059 INFO L225 Difference]: With dead ends: 36 [2020-07-01 12:31:55,059 INFO L226 Difference]: Without dead ends: 35 [2020-07-01 12:31:55,059 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:31:55,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-01 12:31:55,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-01 12:31:55,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-01 12:31:55,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 65 transitions. [2020-07-01 12:31:55,064 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 65 transitions. Word has length 5 [2020-07-01 12:31:55,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:55,065 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 65 transitions. [2020-07-01 12:31:55,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:31:55,065 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 65 transitions. [2020-07-01 12:31:55,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:31:55,065 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:55,066 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:31:55,066 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:31:55,066 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:31:55,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:55,066 INFO L82 PathProgramCache]: Analyzing trace with hash 253520834, now seen corresponding path program 1 times [2020-07-01 12:31:55,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:55,067 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383335415] [2020-07-01 12:31:55,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:55,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:55,100 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383335415] [2020-07-01 12:31:55,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:31:55,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:31:55,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547550224] [2020-07-01 12:31:55,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:31:55,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:55,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:31:55,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:31:55,102 INFO L87 Difference]: Start difference. First operand 35 states and 65 transitions. Second operand 4 states. [2020-07-01 12:31:55,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:55,222 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2020-07-01 12:31:55,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:31:55,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-01 12:31:55,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:55,223 INFO L225 Difference]: With dead ends: 35 [2020-07-01 12:31:55,224 INFO L226 Difference]: Without dead ends: 34 [2020-07-01 12:31:55,224 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:31:55,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-01 12:31:55,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-07-01 12:31:55,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-01 12:31:55,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 64 transitions. [2020-07-01 12:31:55,229 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 64 transitions. Word has length 5 [2020-07-01 12:31:55,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:55,230 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 64 transitions. [2020-07-01 12:31:55,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:31:55,230 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 64 transitions. [2020-07-01 12:31:55,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:31:55,230 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:55,230 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:31:55,231 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:31:55,231 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:31:55,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:55,231 INFO L82 PathProgramCache]: Analyzing trace with hash -730790274, now seen corresponding path program 1 times [2020-07-01 12:31:55,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:55,232 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292465957] [2020-07-01 12:31:55,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:55,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:55,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:55,263 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292465957] [2020-07-01 12:31:55,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:31:55,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:31:55,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754475459] [2020-07-01 12:31:55,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:31:55,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:55,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:31:55,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:31:55,264 INFO L87 Difference]: Start difference. First operand 34 states and 64 transitions. Second operand 3 states. [2020-07-01 12:31:55,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:55,363 INFO L93 Difference]: Finished difference Result 34 states and 64 transitions. [2020-07-01 12:31:55,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:31:55,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:31:55,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:55,365 INFO L225 Difference]: With dead ends: 34 [2020-07-01 12:31:55,365 INFO L226 Difference]: Without dead ends: 33 [2020-07-01 12:31:55,365 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:31:55,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-01 12:31:55,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-01 12:31:55,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-01 12:31:55,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 62 transitions. [2020-07-01 12:31:55,370 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 62 transitions. Word has length 6 [2020-07-01 12:31:55,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:55,370 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 62 transitions. [2020-07-01 12:31:55,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:31:55,370 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 62 transitions. [2020-07-01 12:31:55,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:31:55,371 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:55,371 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:31:55,371 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:31:55,371 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:31:55,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:55,372 INFO L82 PathProgramCache]: Analyzing trace with hash -730790272, now seen corresponding path program 1 times [2020-07-01 12:31:55,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:55,372 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530605150] [2020-07-01 12:31:55,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:55,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:55,406 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530605150] [2020-07-01 12:31:55,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:31:55,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:31:55,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516852998] [2020-07-01 12:31:55,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:31:55,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:55,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:31:55,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:31:55,408 INFO L87 Difference]: Start difference. First operand 33 states and 62 transitions. Second operand 4 states. [2020-07-01 12:31:55,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:55,486 INFO L93 Difference]: Finished difference Result 34 states and 62 transitions. [2020-07-01 12:31:55,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:31:55,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-07-01 12:31:55,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:55,488 INFO L225 Difference]: With dead ends: 34 [2020-07-01 12:31:55,488 INFO L226 Difference]: Without dead ends: 33 [2020-07-01 12:31:55,489 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:31:55,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-01 12:31:55,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-01 12:31:55,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-01 12:31:55,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 61 transitions. [2020-07-01 12:31:55,494 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 61 transitions. Word has length 6 [2020-07-01 12:31:55,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:55,494 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 61 transitions. [2020-07-01 12:31:55,494 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:31:55,494 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2020-07-01 12:31:55,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:31:55,495 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:55,495 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:31:55,495 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:31:55,495 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:31:55,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:55,496 INFO L82 PathProgramCache]: Analyzing trace with hash -730790271, now seen corresponding path program 1 times [2020-07-01 12:31:55,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:55,496 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804923977] [2020-07-01 12:31:55,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:55,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:55,527 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804923977] [2020-07-01 12:31:55,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:31:55,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:31:55,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999868568] [2020-07-01 12:31:55,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:31:55,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:55,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:31:55,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:31:55,529 INFO L87 Difference]: Start difference. First operand 33 states and 61 transitions. Second operand 3 states. [2020-07-01 12:31:55,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:55,615 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2020-07-01 12:31:55,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:31:55,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:31:55,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:55,617 INFO L225 Difference]: With dead ends: 33 [2020-07-01 12:31:55,617 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 12:31:55,617 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:31:55,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 12:31:55,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-01 12:31:55,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 12:31:55,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 60 transitions. [2020-07-01 12:31:55,622 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 60 transitions. Word has length 6 [2020-07-01 12:31:55,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:55,622 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 60 transitions. [2020-07-01 12:31:55,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:31:55,622 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 60 transitions. [2020-07-01 12:31:55,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:31:55,623 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:55,623 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:31:55,623 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:31:55,623 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:31:55,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:55,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1179659637, now seen corresponding path program 1 times [2020-07-01 12:31:55,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:55,624 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964824550] [2020-07-01 12:31:55,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:55,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:55,665 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964824550] [2020-07-01 12:31:55,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:31:55,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:31:55,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509575560] [2020-07-01 12:31:55,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:31:55,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:55,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:31:55,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:31:55,667 INFO L87 Difference]: Start difference. First operand 32 states and 60 transitions. Second operand 4 states. [2020-07-01 12:31:55,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:55,816 INFO L93 Difference]: Finished difference Result 60 states and 112 transitions. [2020-07-01 12:31:55,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:31:55,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-01 12:31:55,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:55,817 INFO L225 Difference]: With dead ends: 60 [2020-07-01 12:31:55,817 INFO L226 Difference]: Without dead ends: 58 [2020-07-01 12:31:55,818 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:31:55,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-01 12:31:55,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 35. [2020-07-01 12:31:55,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-01 12:31:55,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 71 transitions. [2020-07-01 12:31:55,825 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 71 transitions. Word has length 7 [2020-07-01 12:31:55,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:55,826 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 71 transitions. [2020-07-01 12:31:55,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:31:55,826 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 71 transitions. [2020-07-01 12:31:55,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:31:55,826 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:55,827 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:31:55,827 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:31:55,827 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:31:55,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:55,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1179659640, now seen corresponding path program 1 times [2020-07-01 12:31:55,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:55,828 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341102125] [2020-07-01 12:31:55,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:55,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:55,860 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341102125] [2020-07-01 12:31:55,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:31:55,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:31:55,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158922547] [2020-07-01 12:31:55,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:31:55,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:55,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:31:55,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:31:55,862 INFO L87 Difference]: Start difference. First operand 35 states and 71 transitions. Second operand 4 states. [2020-07-01 12:31:55,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:55,953 INFO L93 Difference]: Finished difference Result 35 states and 71 transitions. [2020-07-01 12:31:55,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:31:55,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-01 12:31:55,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:55,955 INFO L225 Difference]: With dead ends: 35 [2020-07-01 12:31:55,955 INFO L226 Difference]: Without dead ends: 33 [2020-07-01 12:31:55,955 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:31:55,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-01 12:31:55,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-01 12:31:55,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-01 12:31:55,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 63 transitions. [2020-07-01 12:31:55,960 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 63 transitions. Word has length 7 [2020-07-01 12:31:55,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:55,961 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 63 transitions. [2020-07-01 12:31:55,961 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:31:55,961 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 63 transitions. [2020-07-01 12:31:55,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:31:55,961 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:55,961 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:31:55,962 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 12:31:55,962 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:31:55,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:55,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1179659638, now seen corresponding path program 1 times [2020-07-01 12:31:55,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:55,963 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717498041] [2020-07-01 12:31:55,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:56,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:56,020 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717498041] [2020-07-01 12:31:56,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:31:56,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:31:56,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821471964] [2020-07-01 12:31:56,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 12:31:56,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:56,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 12:31:56,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:31:56,022 INFO L87 Difference]: Start difference. First operand 33 states and 63 transitions. Second operand 6 states. [2020-07-01 12:31:56,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:56,198 INFO L93 Difference]: Finished difference Result 54 states and 102 transitions. [2020-07-01 12:31:56,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:31:56,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-07-01 12:31:56,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:56,199 INFO L225 Difference]: With dead ends: 54 [2020-07-01 12:31:56,200 INFO L226 Difference]: Without dead ends: 52 [2020-07-01 12:31:56,200 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:31:56,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-01 12:31:56,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 33. [2020-07-01 12:31:56,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-01 12:31:56,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 61 transitions. [2020-07-01 12:31:56,205 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 61 transitions. Word has length 7 [2020-07-01 12:31:56,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:56,206 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 61 transitions. [2020-07-01 12:31:56,206 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 12:31:56,206 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2020-07-01 12:31:56,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-01 12:31:56,206 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:56,207 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:31:56,207 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 12:31:56,207 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:31:56,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:56,207 INFO L82 PathProgramCache]: Analyzing trace with hash 218387369, now seen corresponding path program 1 times [2020-07-01 12:31:56,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:56,208 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430743555] [2020-07-01 12:31:56,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:56,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:56,236 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430743555] [2020-07-01 12:31:56,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:31:56,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:31:56,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038830127] [2020-07-01 12:31:56,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:31:56,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:56,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:31:56,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:31:56,237 INFO L87 Difference]: Start difference. First operand 33 states and 61 transitions. Second operand 3 states. [2020-07-01 12:31:56,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:56,295 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2020-07-01 12:31:56,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:31:56,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-07-01 12:31:56,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:56,296 INFO L225 Difference]: With dead ends: 33 [2020-07-01 12:31:56,296 INFO L226 Difference]: Without dead ends: 29 [2020-07-01 12:31:56,296 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:31:56,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-01 12:31:56,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-01 12:31:56,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-01 12:31:56,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 54 transitions. [2020-07-01 12:31:56,300 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 54 transitions. Word has length 9 [2020-07-01 12:31:56,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:56,301 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 54 transitions. [2020-07-01 12:31:56,301 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:31:56,301 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 54 transitions. [2020-07-01 12:31:56,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 12:31:56,301 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:56,302 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:31:56,302 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-01 12:31:56,302 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:31:56,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:56,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1819856768, now seen corresponding path program 1 times [2020-07-01 12:31:56,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:56,303 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847881821] [2020-07-01 12:31:56,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:56,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:56,341 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847881821] [2020-07-01 12:31:56,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:31:56,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:31:56,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705123277] [2020-07-01 12:31:56,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:31:56,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:56,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:31:56,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:31:56,343 INFO L87 Difference]: Start difference. First operand 29 states and 54 transitions. Second operand 4 states. [2020-07-01 12:31:56,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:56,431 INFO L93 Difference]: Finished difference Result 29 states and 54 transitions. [2020-07-01 12:31:56,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:31:56,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-01 12:31:56,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:56,432 INFO L225 Difference]: With dead ends: 29 [2020-07-01 12:31:56,433 INFO L226 Difference]: Without dead ends: 26 [2020-07-01 12:31:56,433 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:31:56,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-01 12:31:56,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-01 12:31:56,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-01 12:31:56,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 48 transitions. [2020-07-01 12:31:56,437 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 48 transitions. Word has length 10 [2020-07-01 12:31:56,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:56,437 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 48 transitions. [2020-07-01 12:31:56,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:31:56,437 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 48 transitions. [2020-07-01 12:31:56,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 12:31:56,438 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:56,438 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:31:56,438 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-01 12:31:56,438 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:31:56,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:56,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1819856766, now seen corresponding path program 1 times [2020-07-01 12:31:56,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:56,439 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641737393] [2020-07-01 12:31:56,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:56,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:56,502 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641737393] [2020-07-01 12:31:56,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:31:56,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:31:56,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967973212] [2020-07-01 12:31:56,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 12:31:56,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:56,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 12:31:56,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:31:56,504 INFO L87 Difference]: Start difference. First operand 26 states and 48 transitions. Second operand 6 states. [2020-07-01 12:31:56,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:56,640 INFO L93 Difference]: Finished difference Result 41 states and 81 transitions. [2020-07-01 12:31:56,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 12:31:56,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-07-01 12:31:56,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:56,641 INFO L225 Difference]: With dead ends: 41 [2020-07-01 12:31:56,641 INFO L226 Difference]: Without dead ends: 38 [2020-07-01 12:31:56,642 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:31:56,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-01 12:31:56,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2020-07-01 12:31:56,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-01 12:31:56,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 67 transitions. [2020-07-01 12:31:56,646 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 67 transitions. Word has length 10 [2020-07-01 12:31:56,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:56,647 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 67 transitions. [2020-07-01 12:31:56,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 12:31:56,647 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 67 transitions. [2020-07-01 12:31:56,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-01 12:31:56,647 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:56,648 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:31:56,648 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-01 12:31:56,648 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:31:56,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:56,648 INFO L82 PathProgramCache]: Analyzing trace with hash 511782636, now seen corresponding path program 1 times [2020-07-01 12:31:56,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:56,649 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128824332] [2020-07-01 12:31:56,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:56,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:56,673 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128824332] [2020-07-01 12:31:56,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:31:56,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:31:56,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996099336] [2020-07-01 12:31:56,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:31:56,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:56,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:31:56,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:31:56,675 INFO L87 Difference]: Start difference. First operand 33 states and 67 transitions. Second operand 3 states. [2020-07-01 12:31:56,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:56,737 INFO L93 Difference]: Finished difference Result 61 states and 130 transitions. [2020-07-01 12:31:56,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:31:56,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-07-01 12:31:56,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:56,738 INFO L225 Difference]: With dead ends: 61 [2020-07-01 12:31:56,738 INFO L226 Difference]: Without dead ends: 37 [2020-07-01 12:31:56,739 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:31:56,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-01 12:31:56,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-01 12:31:56,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-01 12:31:56,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 71 transitions. [2020-07-01 12:31:56,743 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 71 transitions. Word has length 14 [2020-07-01 12:31:56,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:56,744 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 71 transitions. [2020-07-01 12:31:56,744 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:31:56,744 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 71 transitions. [2020-07-01 12:31:56,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-01 12:31:56,744 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:56,744 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:31:56,745 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-01 12:31:56,745 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:31:56,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:56,745 INFO L82 PathProgramCache]: Analyzing trace with hash -2070294903, now seen corresponding path program 1 times [2020-07-01 12:31:56,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:56,746 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455860997] [2020-07-01 12:31:56,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:56,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:56,860 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455860997] [2020-07-01 12:31:56,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:31:56,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-01 12:31:56,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36885696] [2020-07-01 12:31:56,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 12:31:56,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:56,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 12:31:56,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:31:56,862 INFO L87 Difference]: Start difference. First operand 37 states and 71 transitions. Second operand 7 states. [2020-07-01 12:31:57,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:57,060 INFO L93 Difference]: Finished difference Result 85 states and 157 transitions. [2020-07-01 12:31:57,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 12:31:57,061 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-07-01 12:31:57,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:57,061 INFO L225 Difference]: With dead ends: 85 [2020-07-01 12:31:57,061 INFO L226 Difference]: Without dead ends: 57 [2020-07-01 12:31:57,062 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-07-01 12:31:57,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-07-01 12:31:57,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2020-07-01 12:31:57,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-01 12:31:57,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 94 transitions. [2020-07-01 12:31:57,069 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 94 transitions. Word has length 16 [2020-07-01 12:31:57,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:57,070 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 94 transitions. [2020-07-01 12:31:57,070 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 12:31:57,070 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 94 transitions. [2020-07-01 12:31:57,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-01 12:31:57,070 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:57,071 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:31:57,071 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-01 12:31:57,071 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:31:57,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:57,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1208993110, now seen corresponding path program 1 times [2020-07-01 12:31:57,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:57,072 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640350512] [2020-07-01 12:31:57,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:57,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:57,205 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640350512] [2020-07-01 12:31:57,206 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55681574] [2020-07-01 12:31:57,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:31:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:57,254 INFO L264 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-01 12:31:57,260 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:31:57,325 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-07-01 12:31:57,326 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:31:57,349 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:31:57,352 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-01 12:31:57,352 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2020-07-01 12:31:57,452 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:31:57,453 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2020-07-01 12:31:57,454 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:31:57,457 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:31:57,468 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:31:57,470 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:31:57,473 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 12:31:57,475 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:31:57,475 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2020-07-01 12:31:57,511 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:31:57,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:57,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:31:57,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2020-07-01 12:31:57,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226574164] [2020-07-01 12:31:57,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-01 12:31:57,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:57,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-01 12:31:57,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-07-01 12:31:57,540 INFO L87 Difference]: Start difference. First operand 53 states and 94 transitions. Second operand 13 states. [2020-07-01 12:31:58,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:58,453 INFO L93 Difference]: Finished difference Result 77 states and 133 transitions. [2020-07-01 12:31:58,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-01 12:31:58,453 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2020-07-01 12:31:58,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:58,454 INFO L225 Difference]: With dead ends: 77 [2020-07-01 12:31:58,454 INFO L226 Difference]: Without dead ends: 74 [2020-07-01 12:31:58,455 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2020-07-01 12:31:58,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-01 12:31:58,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 54. [2020-07-01 12:31:58,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-01 12:31:58,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 94 transitions. [2020-07-01 12:31:58,464 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 94 transitions. Word has length 16 [2020-07-01 12:31:58,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:58,464 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 94 transitions. [2020-07-01 12:31:58,464 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-01 12:31:58,464 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 94 transitions. [2020-07-01 12:31:58,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-01 12:31:58,465 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:58,465 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:31:58,666 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-07-01 12:31:58,667 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:31:58,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:58,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1208993111, now seen corresponding path program 1 times [2020-07-01 12:31:58,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:58,668 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000722894] [2020-07-01 12:31:58,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:58,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:58,715 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000722894] [2020-07-01 12:31:58,716 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031905396] [2020-07-01 12:31:58,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:31:58,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:58,757 INFO L264 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 12:31:58,759 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:31:58,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:58,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 12:31:58,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-07-01 12:31:58,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727943372] [2020-07-01 12:31:58,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:31:58,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:58,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:31:58,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:31:58,777 INFO L87 Difference]: Start difference. First operand 54 states and 94 transitions. Second operand 4 states. [2020-07-01 12:31:58,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:58,869 INFO L93 Difference]: Finished difference Result 60 states and 102 transitions. [2020-07-01 12:31:58,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:31:58,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-07-01 12:31:58,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:58,870 INFO L225 Difference]: With dead ends: 60 [2020-07-01 12:31:58,871 INFO L226 Difference]: Without dead ends: 57 [2020-07-01 12:31:58,871 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:31:58,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-07-01 12:31:58,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2020-07-01 12:31:58,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-01 12:31:58,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 87 transitions. [2020-07-01 12:31:58,879 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 87 transitions. Word has length 16 [2020-07-01 12:31:58,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:58,880 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 87 transitions. [2020-07-01 12:31:58,880 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:31:58,880 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 87 transitions. [2020-07-01 12:31:58,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-01 12:31:58,881 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:58,881 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:31:59,081 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-07-01 12:31:59,082 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:31:59,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:59,082 INFO L82 PathProgramCache]: Analyzing trace with hash -621214003, now seen corresponding path program 1 times [2020-07-01 12:31:59,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:59,083 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337810377] [2020-07-01 12:31:59,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:59,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:59,120 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337810377] [2020-07-01 12:31:59,120 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758804975] [2020-07-01 12:31:59,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:31:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:59,174 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 12:31:59,175 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:31:59,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:59,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 12:31:59,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-07-01 12:31:59,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582103184] [2020-07-01 12:31:59,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:31:59,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:59,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:31:59,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:31:59,186 INFO L87 Difference]: Start difference. First operand 49 states and 87 transitions. Second operand 4 states. [2020-07-01 12:31:59,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:59,273 INFO L93 Difference]: Finished difference Result 77 states and 139 transitions. [2020-07-01 12:31:59,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:31:59,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-07-01 12:31:59,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:59,275 INFO L225 Difference]: With dead ends: 77 [2020-07-01 12:31:59,275 INFO L226 Difference]: Without dead ends: 75 [2020-07-01 12:31:59,275 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:31:59,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-01 12:31:59,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 49. [2020-07-01 12:31:59,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-01 12:31:59,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 83 transitions. [2020-07-01 12:31:59,284 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 83 transitions. Word has length 17 [2020-07-01 12:31:59,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:59,284 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 83 transitions. [2020-07-01 12:31:59,284 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:31:59,284 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 83 transitions. [2020-07-01 12:31:59,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-01 12:31:59,285 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:59,285 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:31:59,485 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-07-01 12:31:59,486 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:31:59,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:59,487 INFO L82 PathProgramCache]: Analyzing trace with hash -621214004, now seen corresponding path program 1 times [2020-07-01 12:31:59,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:59,487 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384237008] [2020-07-01 12:31:59,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:59,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:59,705 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384237008] [2020-07-01 12:31:59,705 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875854684] [2020-07-01 12:31:59,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:31:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:59,743 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 28 conjunts are in the unsatisfiable core [2020-07-01 12:31:59,745 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:31:59,750 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_20|], 1=[|v_#valid_31|]} [2020-07-01 12:31:59,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:31:59,755 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:31:59,756 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:31:59,766 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:31:59,773 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:31:59,773 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:31:59,785 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:31:59,786 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:31:59,786 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2020-07-01 12:31:59,815 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 12:31:59,815 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:31:59,826 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:31:59,826 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:31:59,826 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2020-07-01 12:31:59,865 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2020-07-01 12:31:59,866 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:31:59,878 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:31:59,880 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-01 12:31:59,880 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:40 [2020-07-01 12:31:59,932 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:31:59,933 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2020-07-01 12:31:59,934 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:31:59,935 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:31:59,949 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:31:59,950 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:31:59,951 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:31:59,952 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:34 [2020-07-01 12:32:00,002 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:00,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:00,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:32:00,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2020-07-01 12:32:00,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847764174] [2020-07-01 12:32:00,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-01 12:32:00,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:00,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-01 12:32:00,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-07-01 12:32:00,052 INFO L87 Difference]: Start difference. First operand 49 states and 83 transitions. Second operand 15 states. [2020-07-01 12:32:00,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:00,800 INFO L93 Difference]: Finished difference Result 109 states and 199 transitions. [2020-07-01 12:32:00,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-01 12:32:00,801 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2020-07-01 12:32:00,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:00,802 INFO L225 Difference]: With dead ends: 109 [2020-07-01 12:32:00,802 INFO L226 Difference]: Without dead ends: 107 [2020-07-01 12:32:00,802 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2020-07-01 12:32:00,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-07-01 12:32:00,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 80. [2020-07-01 12:32:00,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-07-01 12:32:00,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 143 transitions. [2020-07-01 12:32:00,815 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 143 transitions. Word has length 17 [2020-07-01 12:32:00,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:00,815 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 143 transitions. [2020-07-01 12:32:00,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-01 12:32:00,815 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 143 transitions. [2020-07-01 12:32:00,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-01 12:32:00,816 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:00,816 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:01,017 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:01,017 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:01,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:01,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1676905379, now seen corresponding path program 2 times [2020-07-01 12:32:01,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:01,018 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149721763] [2020-07-01 12:32:01,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:01,225 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:01,225 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149721763] [2020-07-01 12:32:01,226 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618750554] [2020-07-01 12:32:01,226 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:01,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 12:32:01,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:32:01,284 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 23 conjunts are in the unsatisfiable core [2020-07-01 12:32:01,286 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:32:01,304 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:01,305 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-07-01 12:32:01,305 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:01,325 INFO L619 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-07-01 12:32:01,326 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:32:01,326 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2020-07-01 12:32:01,346 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 12:32:01,346 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:01,348 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:01,349 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:32:01,349 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-07-01 12:32:01,388 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:01,389 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-07-01 12:32:01,390 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:01,390 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:32:01,399 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:01,399 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:32:01,399 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2020-07-01 12:32:01,417 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:01,446 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:32:01,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:32:01,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-07-01 12:32:01,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695418248] [2020-07-01 12:32:01,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-01 12:32:01,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:01,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-01 12:32:01,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-07-01 12:32:01,448 INFO L87 Difference]: Start difference. First operand 80 states and 143 transitions. Second operand 14 states. [2020-07-01 12:32:02,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:02,042 INFO L93 Difference]: Finished difference Result 138 states and 221 transitions. [2020-07-01 12:32:02,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-01 12:32:02,043 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-07-01 12:32:02,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:02,044 INFO L225 Difference]: With dead ends: 138 [2020-07-01 12:32:02,044 INFO L226 Difference]: Without dead ends: 137 [2020-07-01 12:32:02,044 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2020-07-01 12:32:02,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-07-01 12:32:02,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 65. [2020-07-01 12:32:02,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-07-01 12:32:02,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 103 transitions. [2020-07-01 12:32:02,063 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 103 transitions. Word has length 22 [2020-07-01 12:32:02,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:02,063 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 103 transitions. [2020-07-01 12:32:02,063 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-01 12:32:02,063 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 103 transitions. [2020-07-01 12:32:02,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-01 12:32:02,064 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:02,064 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:02,265 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:02,265 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:02,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:02,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1941483378, now seen corresponding path program 2 times [2020-07-01 12:32:02,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:02,266 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264161195] [2020-07-01 12:32:02,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:02,515 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:02,515 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264161195] [2020-07-01 12:32:02,516 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627773283] [2020-07-01 12:32:02,516 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:02,573 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 12:32:02,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:32:02,575 INFO L264 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 45 conjunts are in the unsatisfiable core [2020-07-01 12:32:02,577 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:32:02,598 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_22|], 1=[|v_#valid_32|]} [2020-07-01 12:32:02,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:32:02,611 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:32:02,611 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:02,622 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:02,627 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:32:02,628 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:02,637 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:02,638 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:32:02,638 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2020-07-01 12:32:02,670 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 12:32:02,670 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:02,679 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:02,679 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:32:02,680 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2020-07-01 12:32:02,723 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-07-01 12:32:02,724 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:02,732 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:02,732 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:32:02,733 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2020-07-01 12:32:02,817 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:02,817 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2020-07-01 12:32:02,818 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:02,819 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:32:02,831 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:02,832 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:32:02,832 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:29 [2020-07-01 12:32:02,865 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:02,951 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:02,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:32:02,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2020-07-01 12:32:02,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511557174] [2020-07-01 12:32:02,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-01 12:32:02,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:02,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-01 12:32:02,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2020-07-01 12:32:02,953 INFO L87 Difference]: Start difference. First operand 65 states and 103 transitions. Second operand 17 states. [2020-07-01 12:32:04,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:04,627 INFO L93 Difference]: Finished difference Result 104 states and 159 transitions. [2020-07-01 12:32:04,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-07-01 12:32:04,627 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-07-01 12:32:04,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:04,629 INFO L225 Difference]: With dead ends: 104 [2020-07-01 12:32:04,629 INFO L226 Difference]: Without dead ends: 102 [2020-07-01 12:32:04,629 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=336, Invalid=996, Unknown=0, NotChecked=0, Total=1332 [2020-07-01 12:32:04,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-07-01 12:32:04,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 84. [2020-07-01 12:32:04,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-07-01 12:32:04,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 135 transitions. [2020-07-01 12:32:04,642 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 135 transitions. Word has length 27 [2020-07-01 12:32:04,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:04,642 INFO L479 AbstractCegarLoop]: Abstraction has 84 states and 135 transitions. [2020-07-01 12:32:04,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-01 12:32:04,643 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 135 transitions. [2020-07-01 12:32:04,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-01 12:32:04,643 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:04,644 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:04,844 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:04,845 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:04,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:04,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1957118191, now seen corresponding path program 1 times [2020-07-01 12:32:04,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:04,845 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548160514] [2020-07-01 12:32:04,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:04,947 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-01 12:32:04,948 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548160514] [2020-07-01 12:32:04,948 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127451742] [2020-07-01 12:32:04,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:05,000 INFO L264 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 12:32:05,002 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:32:05,108 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:05,109 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2020-07-01 12:32:05,110 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 12:32:05,111 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 12:32:05,112 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:32:05,127 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:05,128 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:32:05,128 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:7 [2020-07-01 12:32:05,154 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-01 12:32:05,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 12:32:05,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2020-07-01 12:32:05,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901227910] [2020-07-01 12:32:05,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 12:32:05,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:05,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 12:32:05,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2020-07-01 12:32:05,156 INFO L87 Difference]: Start difference. First operand 84 states and 135 transitions. Second operand 8 states. [2020-07-01 12:32:05,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:05,556 INFO L93 Difference]: Finished difference Result 236 states and 400 transitions. [2020-07-01 12:32:05,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-01 12:32:05,557 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2020-07-01 12:32:05,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:05,558 INFO L225 Difference]: With dead ends: 236 [2020-07-01 12:32:05,558 INFO L226 Difference]: Without dead ends: 183 [2020-07-01 12:32:05,559 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2020-07-01 12:32:05,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2020-07-01 12:32:05,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 143. [2020-07-01 12:32:05,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-07-01 12:32:05,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 259 transitions. [2020-07-01 12:32:05,577 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 259 transitions. Word has length 37 [2020-07-01 12:32:05,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:05,577 INFO L479 AbstractCegarLoop]: Abstraction has 143 states and 259 transitions. [2020-07-01 12:32:05,577 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 12:32:05,577 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 259 transitions. [2020-07-01 12:32:05,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-01 12:32:05,578 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:05,579 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:05,779 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:05,779 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:05,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:05,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1957119152, now seen corresponding path program 1 times [2020-07-01 12:32:05,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:05,780 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717536488] [2020-07-01 12:32:05,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:05,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:05,911 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-01 12:32:05,912 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717536488] [2020-07-01 12:32:05,912 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444985284] [2020-07-01 12:32:05,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:05,963 INFO L264 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 46 conjunts are in the unsatisfiable core [2020-07-01 12:32:05,966 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:32:05,986 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_23|], 1=[|v_#valid_33|]} [2020-07-01 12:32:05,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:32:05,991 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:32:05,992 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:06,002 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:06,007 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:32:06,007 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:06,016 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:06,016 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:32:06,016 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2020-07-01 12:32:06,040 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 12:32:06,041 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:06,048 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:06,048 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:32:06,048 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2020-07-01 12:32:06,073 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-07-01 12:32:06,074 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:06,082 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:06,082 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:32:06,082 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2020-07-01 12:32:06,160 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:06,161 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2020-07-01 12:32:06,162 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:06,162 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:32:06,173 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:06,174 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:32:06,174 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:29 [2020-07-01 12:32:06,203 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:06,278 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-01 12:32:06,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:32:06,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2020-07-01 12:32:06,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398159925] [2020-07-01 12:32:06,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-01 12:32:06,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:06,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-01 12:32:06,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2020-07-01 12:32:06,280 INFO L87 Difference]: Start difference. First operand 143 states and 259 transitions. Second operand 17 states. [2020-07-01 12:32:06,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:06,874 INFO L93 Difference]: Finished difference Result 143 states and 259 transitions. [2020-07-01 12:32:06,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-01 12:32:06,875 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37 [2020-07-01 12:32:06,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:06,875 INFO L225 Difference]: With dead ends: 143 [2020-07-01 12:32:06,875 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:32:06,876 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2020-07-01 12:32:06,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:32:06,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:32:06,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:32:06,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:32:06,877 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2020-07-01 12:32:06,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:06,877 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:32:06,878 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-01 12:32:06,878 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:32:06,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:32:07,078 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2020-07-01 12:32:07,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:32:07,304 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 203 [2020-07-01 12:32:07,513 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 207 [2020-07-01 12:32:08,875 WARN L192 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 200 DAG size of output: 106 [2020-07-01 12:32:12,845 WARN L192 SmtUtils]: Spent 3.97 s on a formula simplification. DAG size of input: 205 DAG size of output: 92 [2020-07-01 12:32:12,849 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC(line 20) no Hoare annotation was computed. [2020-07-01 12:32:12,849 INFO L268 CegarLoopResult]: For program point L31-1(lines 31 33) no Hoare annotation was computed. [2020-07-01 12:32:12,849 INFO L268 CegarLoopResult]: For program point L19(lines 19 20) no Hoare annotation was computed. [2020-07-01 12:32:12,850 INFO L268 CegarLoopResult]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-07-01 12:32:12,850 INFO L268 CegarLoopResult]: For program point L17-2(line 17) no Hoare annotation was computed. [2020-07-01 12:32:12,850 INFO L268 CegarLoopResult]: For program point L17-3(line 17) no Hoare annotation was computed. [2020-07-01 12:32:12,850 INFO L268 CegarLoopResult]: For program point L17-4(line 17) no Hoare annotation was computed. [2020-07-01 12:32:12,850 INFO L268 CegarLoopResult]: For program point L17-6(lines 17 18) no Hoare annotation was computed. [2020-07-01 12:32:12,850 INFO L264 CegarLoopResult]: At program point L17-8(lines 17 18) the Hoare annotation is: (let ((.cse0 (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base))) (and (<= (+ ULTIMATE.start_cstrcspn_~sc1~0.offset 2) .cse0) (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~sc1~0.base) (+ .cse0 (- 1))) 0) (let ((.cse21 (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)) (.cse22 (select |#length| ULTIMATE.start_main_~nondetString1~0.base))) (let ((.cse1 (= 1 (select |#valid| ULTIMATE.start_cstrcspn_~s~0.base))) (.cse2 (= .cse22 ULTIMATE.start_main_~length1~0)) (.cse3 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse4 (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s~0.base) (+ .cse21 (- 1))))) (.cse5 (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset .cse22 (- 1))))) (.cse6 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse7 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base))) (.cse8 (= 1 (select |#valid| ULTIMATE.start_cstrcspn_~s2.base))) (.cse9 (<= 1 |#StackHeapBarrier|)) (.cse10 (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= 1 ULTIMATE.start_main_~length2~0) (<= (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset) (select |#length| ULTIMATE.start_cstrcspn_~s2.base)) (<= ULTIMATE.start_cstrcspn_~s2.offset ULTIMATE.start_main_~nondetString2~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1))) 0)))) (.cse11 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)) (.cse12 (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) (+ (select |#length| ULTIMATE.start_cstrcspn_~s2.base) (- 1))))) (.cse13 (<= 0 ULTIMATE.start_cstrcspn_~sc1~0.offset)) (.cse14 (= ULTIMATE.start_cstrcspn_~sc1~0.base ULTIMATE.start_cstrcspn_~s1.base)) (.cse15 (= 0 ULTIMATE.start_main_~nondetString2~0.offset)) (.cse16 (= 0 ULTIMATE.start_main_~nondetString1~0.offset)) (.cse17 (= 1 (select |#valid| ULTIMATE.start_cstrcspn_~sc1~0.base))) (.cse18 (<= 1 ULTIMATE.start_main_~length1~0)) (.cse19 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse20 (= 0 ULTIMATE.start_cstrcspn_~s2.offset))) (or (and .cse1 (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= 1 ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_cstrcspn_~s~0.offset ULTIMATE.start_main_~nondetString2~0.offset) (<= (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= 0 ULTIMATE.start_cstrcspn_~s~0.offset)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= 1 ULTIMATE.start_cstrcspn_~s~0.offset) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) .cse21))))))) [2020-07-01 12:32:12,851 INFO L268 CegarLoopResult]: For program point L17-9(lines 17 18) no Hoare annotation was computed. [2020-07-01 12:32:12,851 INFO L268 CegarLoopResult]: For program point L36(line 36) no Hoare annotation was computed. [2020-07-01 12:32:12,851 INFO L268 CegarLoopResult]: For program point L36-1(line 36) no Hoare annotation was computed. [2020-07-01 12:32:12,851 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:32:12,851 INFO L268 CegarLoopResult]: For program point L28(lines 28 30) no Hoare annotation was computed. [2020-07-01 12:32:12,851 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC(line 22) no Hoare annotation was computed. [2020-07-01 12:32:12,851 INFO L268 CegarLoopResult]: For program point L28-2(lines 25 39) no Hoare annotation was computed. [2020-07-01 12:32:12,851 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:32:12,852 INFO L268 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2020-07-01 12:32:12,852 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:32:12,852 INFO L268 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-07-01 12:32:12,852 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:32:12,852 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:32:12,852 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:32:12,852 INFO L268 CegarLoopResult]: For program point L14-1(lines 14 21) no Hoare annotation was computed. [2020-07-01 12:32:12,852 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:32:12,852 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:32:12,852 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:32:12,853 INFO L268 CegarLoopResult]: For program point L14-3(lines 14 21) no Hoare annotation was computed. [2020-07-01 12:32:12,853 INFO L264 CegarLoopResult]: At program point L14-4(lines 14 21) the Hoare annotation is: (let ((.cse18 (select |#length| ULTIMATE.start_cstrcspn_~s2.base)) (.cse15 (select |#length| ULTIMATE.start_main_~nondetString1~0.base))) (let ((.cse0 (= .cse15 ULTIMATE.start_main_~length1~0)) (.cse1 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse10 (+ ULTIMATE.start_main_~nondetString1~0.offset .cse15 (- 1))) (.cse2 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse3 (= 1 (select |#valid| ULTIMATE.start_cstrcspn_~s2.base))) (.cse4 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base))) (.cse5 (<= 1 |#StackHeapBarrier|)) (.cse6 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)) (.cse7 (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) (+ .cse18 (- 1))))) (.cse8 (= ULTIMATE.start_cstrcspn_~sc1~0.base ULTIMATE.start_cstrcspn_~s1.base)) (.cse9 (= 0 ULTIMATE.start_main_~nondetString2~0.offset)) (.cse11 (= 0 ULTIMATE.start_main_~nondetString1~0.offset)) (.cse12 (= 1 (select |#valid| ULTIMATE.start_cstrcspn_~sc1~0.base))) (.cse16 (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base)) (.cse13 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse14 (= 0 ULTIMATE.start_cstrcspn_~s2.offset))) (or (and .cse0 .cse1 (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (not (= ULTIMATE.start_cstrcspn_~sc1~0.base ULTIMATE.start_main_~nondetString2~0.base)))) .cse2 .cse3 .cse4 .cse5 (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= 1 ULTIMATE.start_main_~length2~0) (<= (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset) (select |#length| ULTIMATE.start_cstrcspn_~s2.base)) (<= ULTIMATE.start_cstrcspn_~s2.offset ULTIMATE.start_main_~nondetString2~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1))) 0))) .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_cstrcspn_~sc1~0.offset) .cse9 (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~nondetString2~0.base (store (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)) 0)) ULTIMATE.start_main_~nondetString1~0.base) .cse10)) .cse11 .cse12 .cse13 .cse14 (<= 1 .cse15) (<= 1 .cse16) (exists ((ULTIMATE.start_main_~nondetString1~0.offset Int)) (and (<= ULTIMATE.start_cstrcspn_~sc1~0.offset ULTIMATE.start_main_~nondetString1~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~sc1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base) (- 1)))) (<= ULTIMATE.start_main_~nondetString1~0.offset 0)))) (let ((.cse17 (select |#length| ULTIMATE.start_cstrcspn_~s~0.base))) (and (= 1 (select |#valid| ULTIMATE.start_cstrcspn_~s~0.base)) .cse0 .cse1 (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s~0.base) (+ .cse17 (- 1)))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) .cse10)) .cse2 .cse3 .cse4 .cse5 (<= 1 .cse18) .cse6 .cse7 .cse8 .cse9 (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~sc1~0.base) (+ .cse16 (- 1))) 0) .cse11 (<= 1 ULTIMATE.start_cstrcspn_~sc1~0.offset) .cse12 (<= 1 ULTIMATE.start_main_~length1~0) (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (<= (+ ULTIMATE.start_cstrcspn_~sc1~0.offset 1) .cse16) .cse13 .cse14 (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) .cse17)))))) [2020-07-01 12:32:12,853 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:32:12,853 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 37) no Hoare annotation was computed. [2020-07-01 12:32:12,853 INFO L268 CegarLoopResult]: For program point L14-5(lines 14 21) no Hoare annotation was computed. [2020-07-01 12:32:12,853 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 36) no Hoare annotation was computed. [2020-07-01 12:32:12,854 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:32:12,854 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 37) no Hoare annotation was computed. [2020-07-01 12:32:12,854 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 36) no Hoare annotation was computed. [2020-07-01 12:32:12,856 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:32:12,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:32:12,867 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:32:12,867 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:12,868 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:32:12,868 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:12,868 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:12,869 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:12,869 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:12,869 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:12,870 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:12,870 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:32:12,870 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:32:12,871 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:32:12,875 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,875 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,876 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,876 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:12,876 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,877 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,877 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,877 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,877 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,878 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,878 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,878 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,878 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,878 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,879 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,879 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,879 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,879 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,880 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,880 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,880 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,881 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:12,881 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,881 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,881 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,882 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,882 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,882 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,882 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,883 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,891 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:32:12,892 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:32:12,892 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:12,892 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:32:12,893 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:12,893 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:12,893 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:12,893 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:12,894 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:12,894 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:12,894 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:32:12,895 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:32:12,895 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:32:12,897 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,897 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,897 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,898 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:12,898 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,898 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,898 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,899 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,899 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,899 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,899 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,900 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,900 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,900 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,900 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,900 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,901 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,901 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,901 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,902 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,902 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,902 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:12,902 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,903 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,903 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,903 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,903 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,904 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,904 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,904 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:12,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:12,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:12,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:12,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:12,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:12,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:12,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:12,910 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:12,910 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:12,910 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:12,910 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:12,911 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:12,911 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:12,911 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:12,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:12,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:12,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:12,914 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,914 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,915 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,915 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,915 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,915 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,916 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,916 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,916 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,917 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,917 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:12,917 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,917 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,918 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,918 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,918 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,918 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,919 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,919 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,919 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,920 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,920 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:12,920 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,920 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,921 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,921 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,921 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,921 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:12,923 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:12,923 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:12,923 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:12,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:12,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:12,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:12,925 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:12,925 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:12,925 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:12,925 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:12,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:12,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:12,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:12,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:12,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:12,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:12,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:12,929 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,929 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,929 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,930 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,930 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,930 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,930 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,931 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,931 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,931 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,931 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:12,932 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,932 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,932 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,932 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,933 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,933 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,933 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,933 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,934 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,934 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,934 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:12,934 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,935 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,935 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,935 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:12,935 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,936 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:12,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:32:12 BasicIcfg [2020-07-01 12:32:12,938 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:32:12,939 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:32:12,939 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:32:12,942 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:32:12,943 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:32:12,943 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:31:53" (1/5) ... [2020-07-01 12:32:12,944 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9ea3348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:32:12, skipping insertion in model container [2020-07-01 12:32:12,944 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:32:12,944 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:53" (2/5) ... [2020-07-01 12:32:12,944 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9ea3348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:32:12, skipping insertion in model container [2020-07-01 12:32:12,944 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:32:12,945 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:31:54" (3/5) ... [2020-07-01 12:32:12,945 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9ea3348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:32:12, skipping insertion in model container [2020-07-01 12:32:12,945 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:32:12,945 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:31:54" (4/5) ... [2020-07-01 12:32:12,945 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9ea3348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:32:12, skipping insertion in model container [2020-07-01 12:32:12,945 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:32:12,946 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:32:12" (5/5) ... [2020-07-01 12:32:12,947 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:32:12,969 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:32:12,969 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:32:12,969 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:32:12,969 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:32:12,969 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:32:12,969 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:32:12,969 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:32:12,969 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:32:12,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states. [2020-07-01 12:32:12,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-01 12:32:12,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:32:12,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:32:12,983 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:32:12,983 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:12,983 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:32:12,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states. [2020-07-01 12:32:12,984 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-01 12:32:12,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:32:12,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:32:12,985 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:32:12,985 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:12,990 INFO L794 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRYtrue [239] ULTIMATE.startENTRY-->L28: Formula: (and (= 0 |v_#NULL.base_2|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc10.offset] 30#L28true [122] L28-->L28-2: Formula: (and (= v_ULTIMATE.start_main_~length1~0_4 1) (< v_ULTIMATE.start_main_~length1~0_5 1)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_5} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length1~0] 26#L28-2true [137] L28-2-->L31-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 10#L31-1true [164] L31-1-->L36: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc10.base_2| 1))) (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc10.base_2|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc11.base_2|) (< 0 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_2|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2|)) (= 0 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc10.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~length2~0_7)) (= 0 |v_ULTIMATE.start_main_#t~malloc10.offset_2|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2| 1) |v_#valid_3|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc10.base_2|) 0) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| 0))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc10.offset] 24#L36true [113] L36-->L36-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= 1 .cse0) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 22#L36-1true [240] L36-1-->L14-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_cstrcspn_~s1.offset_5 |v_ULTIMATE.start_cstrcspn_#in~s1.offset_2|) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrcspn_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= |v_ULTIMATE.start_cstrcspn_#in~s2.offset_2| v_ULTIMATE.start_cstrcspn_~s2.offset_4) (= |v_ULTIMATE.start_cstrcspn_#in~s2.base_2| v_ULTIMATE.start_cstrcspn_~s2.base_4) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrcspn_#in~s1.offset_2|) (= v_ULTIMATE.start_cstrcspn_~sc1~0.base_16 v_ULTIMATE.start_cstrcspn_~s1.base_7) (= 1 (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_cstrcspn_~s1.offset_5 v_ULTIMATE.start_cstrcspn_~sc1~0.offset_12) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrcspn_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrcspn_#in~s2.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= |v_ULTIMATE.start_cstrcspn_#in~s1.base_2| v_ULTIMATE.start_cstrcspn_~s1.base_7) (= |v_#memory_int_10| (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0))))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrcspn_~sc1~0.base=v_ULTIMATE.start_cstrcspn_~sc1~0.base_16, ULTIMATE.start_cstrcspn_#t~post6.base=|v_ULTIMATE.start_cstrcspn_#t~post6.base_4|, ULTIMATE.start_cstrcspn_#t~post0.base=|v_ULTIMATE.start_cstrcspn_#t~post0.base_4|, ULTIMATE.start_cstrcspn_~s1.offset=v_ULTIMATE.start_cstrcspn_~s1.offset_5, ULTIMATE.start_cstrcspn_#t~post6.offset=|v_ULTIMATE.start_cstrcspn_#t~post6.offset_4|, ULTIMATE.start_cstrcspn_~s2.offset=v_ULTIMATE.start_cstrcspn_~s2.offset_4, ULTIMATE.start_cstrcspn_#t~short5=|v_ULTIMATE.start_cstrcspn_#t~short5_10|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrcspn_#t~post0.offset=|v_ULTIMATE.start_cstrcspn_#t~post0.offset_4|, ULTIMATE.start_cstrcspn_#in~s2.base=|v_ULTIMATE.start_cstrcspn_#in~s2.base_2|, ULTIMATE.start_cstrcspn_#in~s1.base=|v_ULTIMATE.start_cstrcspn_#in~s1.base_2|, #length=|v_#length_18|, ULTIMATE.start_cstrcspn_#in~s1.offset=|v_ULTIMATE.start_cstrcspn_#in~s1.offset_2|, ULTIMATE.start_cstrcspn_~sc1~0.offset=v_ULTIMATE.start_cstrcspn_~sc1~0.offset_12, ULTIMATE.start_cstrcspn_~s~0.offset=v_ULTIMATE.start_cstrcspn_~s~0.offset_12, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrcspn_#t~mem7=|v_ULTIMATE.start_cstrcspn_#t~mem7_7|, ULTIMATE.start_cstrcspn_#t~mem4=|v_ULTIMATE.start_cstrcspn_#t~mem4_6|, ULTIMATE.start_cstrcspn_~s1.base=v_ULTIMATE.start_cstrcspn_~s1.base_7, ULTIMATE.start_cstrcspn_~s2.base=v_ULTIMATE.start_cstrcspn_~s2.base_4, ULTIMATE.start_cstrcspn_#t~mem2=|v_ULTIMATE.start_cstrcspn_#t~mem2_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrcspn_#t~mem3=|v_ULTIMATE.start_cstrcspn_#t~mem3_6|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrcspn_#t~mem1=|v_ULTIMATE.start_cstrcspn_#t~mem1_7|, ULTIMATE.start_cstrcspn_#in~s2.offset=|v_ULTIMATE.start_cstrcspn_#in~s2.offset_2|, ULTIMATE.start_cstrcspn_~s~0.base=v_ULTIMATE.start_cstrcspn_~s~0.base_15, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrcspn_#res=|v_ULTIMATE.start_cstrcspn_#res_5|, ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_~sc1~0.base, ULTIMATE.start_cstrcspn_#t~post6.base, ULTIMATE.start_cstrcspn_#t~post0.base, ULTIMATE.start_cstrcspn_~s1.offset, ULTIMATE.start_cstrcspn_#t~post6.offset, ULTIMATE.start_cstrcspn_~s2.offset, ULTIMATE.start_cstrcspn_#t~short5, ULTIMATE.start_cstrcspn_#t~post0.offset, ULTIMATE.start_cstrcspn_#in~s2.base, ULTIMATE.start_cstrcspn_#in~s1.base, ULTIMATE.start_cstrcspn_#in~s1.offset, ULTIMATE.start_cstrcspn_~sc1~0.offset, ULTIMATE.start_cstrcspn_~s~0.offset, ULTIMATE.start_cstrcspn_#t~mem7, ULTIMATE.start_cstrcspn_#t~mem4, ULTIMATE.start_cstrcspn_~s1.base, ULTIMATE.start_cstrcspn_~s2.base, ULTIMATE.start_cstrcspn_#t~mem2, ULTIMATE.start_cstrcspn_#t~mem3, ULTIMATE.start_cstrcspn_#t~mem1, ULTIMATE.start_cstrcspn_#in~s2.offset, ULTIMATE.start_cstrcspn_~s~0.base, #memory_int, ULTIMATE.start_cstrcspn_#res, ULTIMATE.start_cstrcspn_~c~0] 15#L14-4true [2020-07-01 12:32:12,991 INFO L796 eck$LassoCheckResult]: Loop: 15#L14-4true [102] L14-4-->L14-1: Formula: (and (= (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrcspn_~sc1~0.base_4) v_ULTIMATE.start_cstrcspn_~sc1~0.offset_4) |v_ULTIMATE.start_cstrcspn_#t~mem1_2|) (<= (+ v_ULTIMATE.start_cstrcspn_~sc1~0.offset_4 1) (select |v_#length_8| v_ULTIMATE.start_cstrcspn_~sc1~0.base_4)) (<= 0 v_ULTIMATE.start_cstrcspn_~sc1~0.offset_4) (= 1 (select |v_#valid_10| v_ULTIMATE.start_cstrcspn_~sc1~0.base_4))) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrcspn_~sc1~0.base=v_ULTIMATE.start_cstrcspn_~sc1~0.base_4, #length=|v_#length_8|, ULTIMATE.start_cstrcspn_~sc1~0.offset=v_ULTIMATE.start_cstrcspn_~sc1~0.offset_4, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_cstrcspn_~sc1~0.base=v_ULTIMATE.start_cstrcspn_~sc1~0.base_4, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_cstrcspn_~sc1~0.offset=v_ULTIMATE.start_cstrcspn_~sc1~0.offset_4, ULTIMATE.start_cstrcspn_#t~mem1=|v_ULTIMATE.start_cstrcspn_#t~mem1_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~mem1] 20#L14-1true [177] L14-1-->L16: Formula: (and (= v_ULTIMATE.start_cstrcspn_~s~0.offset_3 v_ULTIMATE.start_cstrcspn_~s2.offset_3) (> 0 |v_ULTIMATE.start_cstrcspn_#t~mem1_6|) (= v_ULTIMATE.start_cstrcspn_~s~0.base_3 v_ULTIMATE.start_cstrcspn_~s2.base_3)) InVars {ULTIMATE.start_cstrcspn_~s2.base=v_ULTIMATE.start_cstrcspn_~s2.base_3, ULTIMATE.start_cstrcspn_~s2.offset=v_ULTIMATE.start_cstrcspn_~s2.offset_3, ULTIMATE.start_cstrcspn_#t~mem1=|v_ULTIMATE.start_cstrcspn_#t~mem1_6|} OutVars{ULTIMATE.start_cstrcspn_~s2.base=v_ULTIMATE.start_cstrcspn_~s2.base_3, ULTIMATE.start_cstrcspn_~s2.offset=v_ULTIMATE.start_cstrcspn_~s2.offset_3, ULTIMATE.start_cstrcspn_~s~0.offset=v_ULTIMATE.start_cstrcspn_~s~0.offset_3, ULTIMATE.start_cstrcspn_~s~0.base=v_ULTIMATE.start_cstrcspn_~s~0.base_3, ULTIMATE.start_cstrcspn_#t~mem1=|v_ULTIMATE.start_cstrcspn_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_~s~0.base, ULTIMATE.start_cstrcspn_~s~0.offset, ULTIMATE.start_cstrcspn_#t~mem1] 4#L16true [241] L16-->L17-8: Formula: (and (<= (+ v_ULTIMATE.start_cstrcspn_~sc1~0.offset_13 1) (select |v_#length_19| v_ULTIMATE.start_cstrcspn_~sc1~0.base_17)) (= v_ULTIMATE.start_cstrcspn_~c~0_8 (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrcspn_~sc1~0.base_17) v_ULTIMATE.start_cstrcspn_~sc1~0.offset_13)) (= 1 (select |v_#valid_26| v_ULTIMATE.start_cstrcspn_~sc1~0.base_17)) (<= 0 v_ULTIMATE.start_cstrcspn_~sc1~0.offset_13)) InVars {ULTIMATE.start_cstrcspn_~sc1~0.base=v_ULTIMATE.start_cstrcspn_~sc1~0.base_17, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrcspn_~sc1~0.offset=v_ULTIMATE.start_cstrcspn_~sc1~0.offset_13} OutVars{ULTIMATE.start_cstrcspn_~sc1~0.base=v_ULTIMATE.start_cstrcspn_~sc1~0.base_17, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrcspn_#t~mem2=|v_ULTIMATE.start_cstrcspn_#t~mem2_6|, ULTIMATE.start_cstrcspn_~sc1~0.offset=v_ULTIMATE.start_cstrcspn_~sc1~0.offset_13, ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~mem2, ULTIMATE.start_cstrcspn_~c~0] 11#L17-8true [96] L17-8-->L17-1: Formula: (and (= |v_ULTIMATE.start_cstrcspn_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_cstrcspn_~s~0.base_4) v_ULTIMATE.start_cstrcspn_~s~0.offset_4)) (<= (+ v_ULTIMATE.start_cstrcspn_~s~0.offset_4 1) (select |v_#length_12| v_ULTIMATE.start_cstrcspn_~s~0.base_4)) (= (select |v_#valid_14| v_ULTIMATE.start_cstrcspn_~s~0.base_4) 1) (<= 0 v_ULTIMATE.start_cstrcspn_~s~0.offset_4)) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_cstrcspn_~s~0.offset=v_ULTIMATE.start_cstrcspn_~s~0.offset_4, ULTIMATE.start_cstrcspn_~s~0.base=v_ULTIMATE.start_cstrcspn_~s~0.base_4, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_cstrcspn_~s~0.base=v_ULTIMATE.start_cstrcspn_~s~0.base_4, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_cstrcspn_#t~mem3=|v_ULTIMATE.start_cstrcspn_#t~mem3_2|, ULTIMATE.start_cstrcspn_~s~0.offset=v_ULTIMATE.start_cstrcspn_~s~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~mem3] 28#L17-1true [201] L17-1-->L17-2: Formula: (and (not |v_ULTIMATE.start_cstrcspn_#t~short5_2|) (= 0 |v_ULTIMATE.start_cstrcspn_#t~mem3_3|)) InVars {ULTIMATE.start_cstrcspn_#t~mem3=|v_ULTIMATE.start_cstrcspn_#t~mem3_3|} OutVars{ULTIMATE.start_cstrcspn_#t~short5=|v_ULTIMATE.start_cstrcspn_#t~short5_2|, ULTIMATE.start_cstrcspn_#t~mem3=|v_ULTIMATE.start_cstrcspn_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~short5] 25#L17-2true [117] L17-2-->L17-6: Formula: (not |v_ULTIMATE.start_cstrcspn_#t~short5_5|) InVars {ULTIMATE.start_cstrcspn_#t~short5=|v_ULTIMATE.start_cstrcspn_#t~short5_5|} OutVars{ULTIMATE.start_cstrcspn_#t~short5=|v_ULTIMATE.start_cstrcspn_#t~short5_5|} AuxVars[] AssignedVars[] 36#L17-6true [129] L17-6-->L17-9: Formula: (not |v_ULTIMATE.start_cstrcspn_#t~short5_7|) InVars {ULTIMATE.start_cstrcspn_#t~short5=|v_ULTIMATE.start_cstrcspn_#t~short5_7|} OutVars{ULTIMATE.start_cstrcspn_#t~mem4=|v_ULTIMATE.start_cstrcspn_#t~mem4_4|, ULTIMATE.start_cstrcspn_#t~short5=|v_ULTIMATE.start_cstrcspn_#t~short5_6|, ULTIMATE.start_cstrcspn_#t~mem3=|v_ULTIMATE.start_cstrcspn_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~mem4, ULTIMATE.start_cstrcspn_#t~short5, ULTIMATE.start_cstrcspn_#t~mem3] 8#L17-9true [91] L17-9-->L19: Formula: (and (<= 0 v_ULTIMATE.start_cstrcspn_~s~0.offset_10) (<= (+ v_ULTIMATE.start_cstrcspn_~s~0.offset_10 1) (select |v_#length_16| v_ULTIMATE.start_cstrcspn_~s~0.base_12)) (= 1 (select |v_#valid_18| v_ULTIMATE.start_cstrcspn_~s~0.base_12)) (= |v_ULTIMATE.start_cstrcspn_#t~mem7_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_cstrcspn_~s~0.base_12) v_ULTIMATE.start_cstrcspn_~s~0.offset_10))) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_cstrcspn_~s~0.offset=v_ULTIMATE.start_cstrcspn_~s~0.offset_10, ULTIMATE.start_cstrcspn_~s~0.base=v_ULTIMATE.start_cstrcspn_~s~0.base_12, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_cstrcspn_#t~mem7=|v_ULTIMATE.start_cstrcspn_#t~mem7_2|, ULTIMATE.start_cstrcspn_~s~0.base=v_ULTIMATE.start_cstrcspn_~s~0.base_12, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_cstrcspn_~s~0.offset=v_ULTIMATE.start_cstrcspn_~s~0.offset_10} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~mem7] 32#L19true [204] L19-->L14-3: Formula: (< v_ULTIMATE.start_cstrcspn_~c~0_6 |v_ULTIMATE.start_cstrcspn_#t~mem7_6|) InVars {ULTIMATE.start_cstrcspn_#t~mem7=|v_ULTIMATE.start_cstrcspn_#t~mem7_6|, ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_6} OutVars{ULTIMATE.start_cstrcspn_#t~mem7=|v_ULTIMATE.start_cstrcspn_#t~mem7_5|, ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_6} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~mem7] 17#L14-3true [106] L14-3-->L14-4: Formula: (and (= v_ULTIMATE.start_cstrcspn_~sc1~0.base_13 v_ULTIMATE.start_cstrcspn_~sc1~0.base_12) (= (+ v_ULTIMATE.start_cstrcspn_~sc1~0.offset_10 1) v_ULTIMATE.start_cstrcspn_~sc1~0.offset_9)) InVars {ULTIMATE.start_cstrcspn_~sc1~0.offset=v_ULTIMATE.start_cstrcspn_~sc1~0.offset_10, ULTIMATE.start_cstrcspn_~sc1~0.base=v_ULTIMATE.start_cstrcspn_~sc1~0.base_13} OutVars{ULTIMATE.start_cstrcspn_#t~post0.offset=|v_ULTIMATE.start_cstrcspn_#t~post0.offset_2|, ULTIMATE.start_cstrcspn_~sc1~0.base=v_ULTIMATE.start_cstrcspn_~sc1~0.base_12, ULTIMATE.start_cstrcspn_#t~post0.base=|v_ULTIMATE.start_cstrcspn_#t~post0.base_2|, ULTIMATE.start_cstrcspn_~sc1~0.offset=v_ULTIMATE.start_cstrcspn_~sc1~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_~sc1~0.base, ULTIMATE.start_cstrcspn_#t~post0.offset, ULTIMATE.start_cstrcspn_#t~post0.base, ULTIMATE.start_cstrcspn_~sc1~0.offset] 15#L14-4true [2020-07-01 12:32:12,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:12,992 INFO L82 PathProgramCache]: Analyzing trace with hash -743151546, now seen corresponding path program 1 times [2020-07-01 12:32:12,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:12,992 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068606001] [2020-07-01 12:32:12,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:13,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:13,005 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068606001] [2020-07-01 12:32:13,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:13,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:32:13,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562733871] [2020-07-01 12:32:13,007 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:32:13,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:13,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1819598975, now seen corresponding path program 1 times [2020-07-01 12:32:13,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:13,007 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206626979] [2020-07-01 12:32:13,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:32:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:32:13,033 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:32:13,136 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2020-07-01 12:32:13,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:13,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:32:13,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:32:13,169 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2020-07-01 12:32:13,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:13,240 INFO L93 Difference]: Finished difference Result 36 states and 68 transitions. [2020-07-01 12:32:13,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:32:13,243 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:32:13,247 INFO L168 Benchmark]: Toolchain (without parser) took 19911.71 ms. Allocated memory was 514.9 MB in the beginning and 762.8 MB in the end (delta: 248.0 MB). Free memory was 438.6 MB in the beginning and 697.1 MB in the end (delta: -258.4 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:32:13,247 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 514.9 MB. Free memory is still 458.6 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:32:13,247 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.91 ms. Allocated memory was 514.9 MB in the beginning and 561.0 MB in the end (delta: 46.1 MB). Free memory was 438.0 MB in the beginning and 527.1 MB in the end (delta: -89.1 MB). Peak memory consumption was 28.5 MB. Max. memory is 50.3 GB. [2020-07-01 12:32:13,248 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.88 ms. Allocated memory is still 561.0 MB. Free memory was 527.1 MB in the beginning and 525.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:32:13,248 INFO L168 Benchmark]: Boogie Preprocessor took 31.65 ms. Allocated memory is still 561.0 MB. Free memory was 524.3 MB in the beginning and 522.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:32:13,248 INFO L168 Benchmark]: RCFGBuilder took 387.30 ms. Allocated memory is still 561.0 MB. Free memory was 522.3 MB in the beginning and 497.3 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:32:13,249 INFO L168 Benchmark]: BlockEncodingV2 took 136.68 ms. Allocated memory is still 561.0 MB. Free memory was 497.3 MB in the beginning and 485.8 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 50.3 GB. [2020-07-01 12:32:13,249 INFO L168 Benchmark]: TraceAbstraction took 18673.94 ms. Allocated memory was 561.0 MB in the beginning and 738.2 MB in the end (delta: 177.2 MB). Free memory was 485.2 MB in the beginning and 410.1 MB in the end (delta: 75.1 MB). Peak memory consumption was 270.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:32:13,250 INFO L168 Benchmark]: BuchiAutomizer took 306.47 ms. Allocated memory was 738.2 MB in the beginning and 762.8 MB in the end (delta: 24.6 MB). Free memory was 404.0 MB in the beginning and 697.1 MB in the end (delta: -293.1 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:32:13,252 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 43 locations, 50 edges - StatisticsResult: Encoded RCFG 36 locations, 73 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 514.9 MB. Free memory is still 458.6 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 324.91 ms. Allocated memory was 514.9 MB in the beginning and 561.0 MB in the end (delta: 46.1 MB). Free memory was 438.0 MB in the beginning and 527.1 MB in the end (delta: -89.1 MB). Peak memory consumption was 28.5 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 44.88 ms. Allocated memory is still 561.0 MB. Free memory was 527.1 MB in the beginning and 525.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 31.65 ms. Allocated memory is still 561.0 MB. Free memory was 524.3 MB in the beginning and 522.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. * RCFGBuilder took 387.30 ms. Allocated memory is still 561.0 MB. Free memory was 522.3 MB in the beginning and 497.3 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 136.68 ms. Allocated memory is still 561.0 MB. Free memory was 497.3 MB in the beginning and 485.8 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 18673.94 ms. Allocated memory was 561.0 MB in the beginning and 738.2 MB in the end (delta: 177.2 MB). Free memory was 485.2 MB in the beginning and 410.1 MB in the end (delta: 75.1 MB). Peak memory consumption was 270.6 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 306.47 ms. Allocated memory was 738.2 MB in the beginning and 762.8 MB in the end (delta: 24.6 MB). Free memory was 404.0 MB in the beginning and 697.1 MB in the end (delta: -293.1 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 36]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer arithmetic is always legal For all program executions holds that pointer arithmetic is always legal at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 36]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 37]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 37]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer arithmetic is always legal For all program executions holds that pointer arithmetic is always legal at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant [2020-07-01 12:32:13,264 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:32:13,265 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:32:13,265 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:13,265 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:32:13,265 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:13,266 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:13,266 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:13,266 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:13,266 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:13,266 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:13,267 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:32:13,267 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:32:13,267 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:32:13,268 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,269 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,269 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,269 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:13,269 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,270 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,270 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,270 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,270 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,270 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,271 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,271 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,271 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,271 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,271 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,271 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,272 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,272 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,272 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,272 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,273 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,273 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:13,273 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,273 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,274 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,274 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,274 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,274 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,274 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,275 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,275 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:32:13,276 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:32:13,276 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:13,276 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:32:13,276 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:13,277 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:13,277 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:13,277 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:13,277 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:13,278 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:13,278 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:32:13,278 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:32:13,278 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:32:13,280 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,280 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,280 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,280 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:13,281 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,281 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,281 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,281 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,281 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,282 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,282 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,282 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,282 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,282 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,283 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,283 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,283 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,283 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,283 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,284 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,284 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,284 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:13,284 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,285 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,285 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,285 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,285 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,285 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,286 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,286 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((((((((((unknown-#length-unknown[nondetString1] == length1 && 1 <= length2) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start_main_~nondetString2~0.base][unknown-#length-unknown[ULTIMATE.start_main_~nondetString2~0.base] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && !(sc1 == ULTIMATE.start_main_~nondetString2~0.base))) && !(nondetString1 == nondetString2)) && 1 == \valid[s2]) && 1 == \valid[nondetString2]) && 1 <= unknown-#StackHeapBarrier-unknown) && (\exists ULTIMATE.start_main_~length2~0 : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: ((1 <= ULTIMATE.start_main_~length2~0 && ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset <= unknown-#length-unknown[s2]) && s2 <= ULTIMATE.start_main_~nondetString2~0.offset) && unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset + -1] == 0)) && unknown-#length-unknown[nondetString2] == length2) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) && sc1 == s1) && 0 == sc1) && 0 == nondetString2) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && 0 == nondetString1) && 1 == \valid[sc1]) && 1 == \valid[nondetString1]) && 0 == s2) && 1 <= unknown-#length-unknown[nondetString1]) && 1 <= unknown-#length-unknown[sc1]) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (sc1 <= ULTIMATE.start_main_~nondetString1~0.offset && 0 == unknown-#memory_int-unknown[sc1][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[sc1] + -1]) && ULTIMATE.start_main_~nondetString1~0.offset <= 0)) || (((((((((((((((((((((((1 == \valid[s] && unknown-#length-unknown[nondetString1] == length1) && 1 <= length2) && 0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1]) && 0 == unknown-#memory_int-unknown[nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && !(nondetString1 == nondetString2)) && 1 == \valid[s2]) && 1 == \valid[nondetString2]) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 <= unknown-#length-unknown[s2]) && unknown-#length-unknown[nondetString2] == length2) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) && sc1 == s1) && 0 == nondetString2) && unknown-#memory_int-unknown[sc1][unknown-#length-unknown[sc1] + -1] == 0) && 0 == nondetString1) && 1 <= sc1) && 1 == \valid[sc1]) && 1 <= length1) && 0 <= s) && sc1 + 1 <= unknown-#length-unknown[sc1]) && 1 == \valid[nondetString1]) && 0 == s2) && s + 1 <= unknown-#length-unknown[s]) - InvariantResult [Line: 17]: Loop Invariant [2020-07-01 12:32:13,287 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:13,287 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:13,287 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:13,287 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:13,288 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:13,288 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:13,288 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:13,288 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:13,289 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:13,289 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:13,289 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:13,289 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:13,290 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:13,290 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:13,290 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:13,290 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:13,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:13,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:13,292 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,292 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,292 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,292 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,293 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,293 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,293 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,293 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,294 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,294 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,294 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:13,294 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,294 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,295 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,295 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,295 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,295 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,296 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,296 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,296 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,296 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,297 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:13,297 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,297 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,297 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,298 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,298 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,298 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,299 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:13,299 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:13,299 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:13,300 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:13,300 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:13,300 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:13,301 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:13,301 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:13,301 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:13,301 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:13,301 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:13,302 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:13,302 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:13,302 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:13,302 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:13,303 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:13,303 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 12:32:13,303 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:13,304 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,304 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,304 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,304 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,305 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,305 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,305 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,305 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,306 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,306 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,306 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:13,306 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,307 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,307 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,307 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,307 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,307 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,308 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,308 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,308 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,308 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,309 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:13,309 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,309 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,309 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,309 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:13,310 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:13,310 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (sc1 + 2 <= unknown-#length-unknown[sc1] && unknown-#memory_int-unknown[sc1][unknown-#length-unknown[sc1] + -1] == 0) && ((((((((((((((((((((((1 == \valid[s] && (\exists ULTIMATE.start_main_~length2~0 : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: ((1 <= ULTIMATE.start_main_~length2~0 && s <= ULTIMATE.start_main_~nondetString2~0.offset) && ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset <= unknown-#length-unknown[s]) && 0 == unknown-#memory_int-unknown[s][ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset + -1])) && unknown-#length-unknown[nondetString1] == length1) && 1 <= length2) && 0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1]) && 0 == unknown-#memory_int-unknown[nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && !(nondetString1 == nondetString2)) && 1 == \valid[nondetString2]) && 1 == \valid[s2]) && 1 <= unknown-#StackHeapBarrier-unknown) && (\exists ULTIMATE.start_main_~length2~0 : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: ((1 <= ULTIMATE.start_main_~length2~0 && ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset <= unknown-#length-unknown[s2]) && s2 <= ULTIMATE.start_main_~nondetString2~0.offset) && unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset + -1] == 0)) && unknown-#length-unknown[nondetString2] == length2) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) && 0 <= sc1) && sc1 == s1) && 0 == nondetString2) && 0 == nondetString1) && 1 == \valid[sc1]) && 1 <= length1) && 1 == \valid[nondetString1]) && 0 == s2) && 0 == s) || (((((((((((((((((((((1 == \valid[s] && unknown-#length-unknown[nondetString1] == length1) && 1 <= length2) && 0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1]) && 0 == unknown-#memory_int-unknown[nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && !(nondetString1 == nondetString2)) && 1 == \valid[nondetString2]) && 1 == \valid[s2]) && 1 <= unknown-#StackHeapBarrier-unknown) && (\exists ULTIMATE.start_main_~length2~0 : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: ((1 <= ULTIMATE.start_main_~length2~0 && ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset <= unknown-#length-unknown[s2]) && s2 <= ULTIMATE.start_main_~nondetString2~0.offset) && unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset + -1] == 0)) && unknown-#length-unknown[nondetString2] == length2) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) && 0 <= sc1) && sc1 == s1) && 0 == nondetString2) && 0 == nondetString1) && 1 == \valid[sc1]) && 1 <= length1) && 1 == \valid[nondetString1]) && 0 == s2) && 1 <= s) && s + 1 <= unknown-#length-unknown[s])) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 36 locations, 16 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 12.7s, OverallIterations: 23, TraceHistogramMax: 3, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 273 SDtfs, 3736 SDslu, 1313 SDs, 0 SdLazy, 2809 SolverSat, 282 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 362 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 262 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 21 NumberOfFragments, 599 HoareAnnotationTreeSize, 2 FomulaSimplifications, 70452 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 2 FomulaSimplificationsInter, 32585 FormulaSimplificationTreeSizeReductionInter, 5.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 496 NumberOfCodeBlocks, 496 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 465 ConstructedInterpolants, 58 QuantifiedInterpolants, 117196 SizeOfPredicates, 81 NumberOfNonLiveVariables, 1047 ConjunctsInSsa, 175 ConjunctsInUnsatCore, 31 InterpolantComputations, 18 PerfectInterpolantSequences, 70/182 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 12:31:49.611 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_HPueqc/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:32:13.539 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check