./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-lopstr16/flag_loopdep.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-lopstr16/flag_loopdep.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ede152d5cd6ec701bb90258310974118410592fd ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 15:32:32,401 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:32:32,404 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:32:32,416 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:32:32,417 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:32:32,418 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:32:32,419 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:32:32,421 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:32:32,423 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:32:32,424 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:32:32,425 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:32:32,427 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:32:32,427 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:32:32,428 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:32:32,431 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:32:32,432 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:32:32,434 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:32:32,436 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:32:32,439 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:32:32,442 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:32:32,446 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:32:32,450 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:32:32,454 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:32:32,455 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:32:32,459 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:32:32,460 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:32:32,460 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:32:32,461 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:32:32,462 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:32:32,463 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:32:32,465 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:32:32,466 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:32:32,467 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:32:32,468 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:32:32,470 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:32:32,470 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:32:32,471 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:32:32,472 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:32:32,472 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:32:32,474 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:32:32,475 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:32:32,476 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 15:32:32,496 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:32:32,496 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:32:32,498 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:32:32,498 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:32:32,499 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:32:32,499 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:32:32,499 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:32:32,500 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:32:32,500 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:32:32,500 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:32:32,501 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:32:32,502 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:32:32,502 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:32:32,502 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:32:32,503 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:32:32,503 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:32:32,503 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:32:32,503 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:32:32,504 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:32:32,504 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:32:32,504 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:32:32,504 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:32:32,505 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:32:32,505 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:32:32,505 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:32:32,506 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:32:32,506 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:32:32,506 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:32:32,506 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:32:32,507 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ede152d5cd6ec701bb90258310974118410592fd [2019-11-28 15:32:32,811 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:32:32,828 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:32:32,832 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:32:32,834 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:32:32,835 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:32:32,836 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-lopstr16/flag_loopdep.i [2019-11-28 15:32:32,912 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3096017a/0ba93ab16fdb4a629288e0df33c6f1f5/FLAG997b86f50 [2019-11-28 15:32:33,399 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:32:33,400 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-lopstr16/flag_loopdep.i [2019-11-28 15:32:33,408 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3096017a/0ba93ab16fdb4a629288e0df33c6f1f5/FLAG997b86f50 [2019-11-28 15:32:33,757 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3096017a/0ba93ab16fdb4a629288e0df33c6f1f5 [2019-11-28 15:32:33,760 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:32:33,763 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:32:33,764 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:32:33,764 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:32:33,768 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:32:33,769 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:32:33" (1/1) ... [2019-11-28 15:32:33,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f061439 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:32:33, skipping insertion in model container [2019-11-28 15:32:33,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:32:33" (1/1) ... [2019-11-28 15:32:33,782 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:32:33,808 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:32:34,033 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:32:34,038 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:32:34,056 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:32:34,132 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:32:34,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:32:34 WrapperNode [2019-11-28 15:32:34,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:32:34,134 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:32:34,134 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:32:34,134 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:32:34,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:32:34" (1/1) ... [2019-11-28 15:32:34,152 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:32:34" (1/1) ... [2019-11-28 15:32:34,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:32:34,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:32:34,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:32:34,174 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:32:34,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:32:34" (1/1) ... [2019-11-28 15:32:34,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:32:34" (1/1) ... [2019-11-28 15:32:34,184 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:32:34" (1/1) ... [2019-11-28 15:32:34,184 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:32:34" (1/1) ... [2019-11-28 15:32:34,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:32:34" (1/1) ... [2019-11-28 15:32:34,196 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:32:34" (1/1) ... [2019-11-28 15:32:34,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:32:34" (1/1) ... [2019-11-28 15:32:34,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:32:34,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:32:34,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:32:34,202 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:32:34,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:32:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:32:34,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 15:32:34,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 15:32:34,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 15:32:34,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 15:32:34,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:32:34,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:32:34,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 15:32:34,530 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:32:34,530 INFO L287 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-28 15:32:34,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:32:34 BoogieIcfgContainer [2019-11-28 15:32:34,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:32:34,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:32:34,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:32:34,537 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:32:34,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:32:33" (1/3) ... [2019-11-28 15:32:34,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bb2cb06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:32:34, skipping insertion in model container [2019-11-28 15:32:34,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:32:34" (2/3) ... [2019-11-28 15:32:34,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bb2cb06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:32:34, skipping insertion in model container [2019-11-28 15:32:34,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:32:34" (3/3) ... [2019-11-28 15:32:34,541 INFO L109 eAbstractionObserver]: Analyzing ICFG flag_loopdep.i [2019-11-28 15:32:34,560 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:32:34,570 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:32:34,584 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:32:34,617 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:32:34,617 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:32:34,618 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:32:34,618 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:32:34,618 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:32:34,619 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:32:34,619 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:32:34,619 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:32:34,645 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-11-28 15:32:34,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 15:32:34,654 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:32:34,655 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:32:34,656 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:32:34,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:32:34,663 INFO L82 PathProgramCache]: Analyzing trace with hash -2060710478, now seen corresponding path program 1 times [2019-11-28 15:32:34,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:32:34,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572603340] [2019-11-28 15:32:34,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:32:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:32:34,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:32:34,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572603340] [2019-11-28 15:32:34,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:32:34,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:32:34,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642128626] [2019-11-28 15:32:34,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 15:32:34,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:32:34,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 15:32:34,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 15:32:34,816 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-11-28 15:32:34,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:32:34,832 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2019-11-28 15:32:34,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 15:32:34,833 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-28 15:32:34,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:32:34,841 INFO L225 Difference]: With dead ends: 36 [2019-11-28 15:32:34,842 INFO L226 Difference]: Without dead ends: 16 [2019-11-28 15:32:34,845 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 15:32:34,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-11-28 15:32:34,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-28 15:32:34,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-28 15:32:34,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-11-28 15:32:34,875 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 10 [2019-11-28 15:32:34,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:32:34,875 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-11-28 15:32:34,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 15:32:34,876 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2019-11-28 15:32:34,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 15:32:34,876 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:32:34,877 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:32:34,877 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:32:34,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:32:34,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1919336157, now seen corresponding path program 1 times [2019-11-28 15:32:34,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:32:34,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629561999] [2019-11-28 15:32:34,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:32:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:32:34,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:32:34,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629561999] [2019-11-28 15:32:34,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:32:34,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:32:34,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811990963] [2019-11-28 15:32:34,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:32:34,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:32:34,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:32:34,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:32:34,934 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand 3 states. [2019-11-28 15:32:34,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:32:34,998 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2019-11-28 15:32:34,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:32:34,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-28 15:32:34,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:32:35,002 INFO L225 Difference]: With dead ends: 34 [2019-11-28 15:32:35,002 INFO L226 Difference]: Without dead ends: 26 [2019-11-28 15:32:35,003 INFO L630 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 [2019-11-28 15:32:35,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-28 15:32:35,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 17. [2019-11-28 15:32:35,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 15:32:35,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-28 15:32:35,010 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2019-11-28 15:32:35,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:32:35,010 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-28 15:32:35,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:32:35,010 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-11-28 15:32:35,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 15:32:35,011 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:32:35,011 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:32:35,011 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:32:35,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:32:35,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1200955363, now seen corresponding path program 1 times [2019-11-28 15:32:35,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:32:35,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737787397] [2019-11-28 15:32:35,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:32:35,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:32:35,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:32:35,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737787397] [2019-11-28 15:32:35,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:32:35,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:32:35,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779395675] [2019-11-28 15:32:35,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:32:35,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:32:35,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:32:35,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:32:35,075 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 3 states. [2019-11-28 15:32:35,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:32:35,099 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2019-11-28 15:32:35,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:32:35,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-28 15:32:35,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:32:35,101 INFO L225 Difference]: With dead ends: 31 [2019-11-28 15:32:35,101 INFO L226 Difference]: Without dead ends: 17 [2019-11-28 15:32:35,103 INFO L630 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 [2019-11-28 15:32:35,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-28 15:32:35,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 15:32:35,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 15:32:35,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-28 15:32:35,112 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 13 [2019-11-28 15:32:35,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:32:35,113 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-28 15:32:35,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:32:35,114 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-11-28 15:32:35,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 15:32:35,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:32:35,115 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:32:35,115 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:32:35,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:32:35,116 INFO L82 PathProgramCache]: Analyzing trace with hash 391608737, now seen corresponding path program 1 times [2019-11-28 15:32:35,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:32:35,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567193791] [2019-11-28 15:32:35,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:32:35,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:32:35,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 15:32:35,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567193791] [2019-11-28 15:32:35,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:32:35,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:32:35,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430275713] [2019-11-28 15:32:35,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:32:35,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:32:35,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:32:35,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:32:35,186 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 3 states. [2019-11-28 15:32:35,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:32:35,202 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2019-11-28 15:32:35,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:32:35,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-28 15:32:35,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:32:35,203 INFO L225 Difference]: With dead ends: 32 [2019-11-28 15:32:35,204 INFO L226 Difference]: Without dead ends: 19 [2019-11-28 15:32:35,205 INFO L630 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 [2019-11-28 15:32:35,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-28 15:32:35,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-11-28 15:32:35,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 15:32:35,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-11-28 15:32:35,213 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2019-11-28 15:32:35,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:32:35,213 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-28 15:32:35,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:32:35,213 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2019-11-28 15:32:35,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 15:32:35,214 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:32:35,215 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:32:35,215 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:32:35,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:32:35,216 INFO L82 PathProgramCache]: Analyzing trace with hash 2027280351, now seen corresponding path program 1 times [2019-11-28 15:32:35,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:32:35,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507630048] [2019-11-28 15:32:35,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:32:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:32:35,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 15:32:35,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507630048] [2019-11-28 15:32:35,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158695036] [2019-11-28 15:32:35,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 15:32:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:32:35,362 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 15:32:35,367 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:32:35,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 15:32:35,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:32:35,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-28 15:32:35,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187356280] [2019-11-28 15:32:35,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 15:32:35,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:32:35,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 15:32:35,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-28 15:32:35,427 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 6 states. [2019-11-28 15:32:35,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:32:35,457 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2019-11-28 15:32:35,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:32:35,459 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-28 15:32:35,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:32:35,459 INFO L225 Difference]: With dead ends: 34 [2019-11-28 15:32:35,460 INFO L226 Difference]: Without dead ends: 21 [2019-11-28 15:32:35,460 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-28 15:32:35,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-28 15:32:35,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-11-28 15:32:35,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 15:32:35,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-11-28 15:32:35,468 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2019-11-28 15:32:35,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:32:35,468 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-28 15:32:35,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 15:32:35,469 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-11-28 15:32:35,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 15:32:35,471 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:32:35,471 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:32:35,676 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:32:35,677 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:32:35,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:32:35,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1949671069, now seen corresponding path program 2 times [2019-11-28 15:32:35,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:32:35,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886099111] [2019-11-28 15:32:35,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:32:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:32:35,778 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 15:32:35,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886099111] [2019-11-28 15:32:35,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028948066] [2019-11-28 15:32:35,779 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 15:32:35,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 15:32:35,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:32:35,850 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 15:32:35,852 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:32:35,920 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 15:32:35,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:32:35,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-28 15:32:35,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812111661] [2019-11-28 15:32:35,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 15:32:35,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:32:35,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 15:32:35,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-28 15:32:35,927 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 8 states. [2019-11-28 15:32:35,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:32:35,968 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2019-11-28 15:32:35,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:32:35,969 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-11-28 15:32:35,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:32:35,970 INFO L225 Difference]: With dead ends: 36 [2019-11-28 15:32:35,970 INFO L226 Difference]: Without dead ends: 23 [2019-11-28 15:32:35,971 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-28 15:32:35,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-28 15:32:35,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-28 15:32:35,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-28 15:32:35,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-11-28 15:32:35,980 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2019-11-28 15:32:35,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:32:35,983 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-28 15:32:35,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 15:32:35,983 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-11-28 15:32:35,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 15:32:35,984 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:32:35,984 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:32:36,185 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:32:36,186 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:32:36,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:32:36,187 INFO L82 PathProgramCache]: Analyzing trace with hash 381595099, now seen corresponding path program 3 times [2019-11-28 15:32:36,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:32:36,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298251346] [2019-11-28 15:32:36,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:32:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:32:36,291 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 15:32:36,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298251346] [2019-11-28 15:32:36,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569686544] [2019-11-28 15:32:36,292 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 15:32:36,344 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-28 15:32:36,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:32:36,345 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:32:36,347 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:32:36,381 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-28 15:32:36,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:32:36,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-11-28 15:32:36,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174941299] [2019-11-28 15:32:36,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 15:32:36,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:32:36,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 15:32:36,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-28 15:32:36,386 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 8 states. [2019-11-28 15:32:36,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:32:36,504 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2019-11-28 15:32:36,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 15:32:36,507 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-28 15:32:36,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:32:36,508 INFO L225 Difference]: With dead ends: 57 [2019-11-28 15:32:36,508 INFO L226 Difference]: Without dead ends: 44 [2019-11-28 15:32:36,508 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-28 15:32:36,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-28 15:32:36,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 27. [2019-11-28 15:32:36,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 15:32:36,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-11-28 15:32:36,517 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 19 [2019-11-28 15:32:36,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:32:36,517 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-11-28 15:32:36,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 15:32:36,518 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-11-28 15:32:36,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 15:32:36,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:32:36,519 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:32:36,722 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:32:36,723 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:32:36,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:32:36,724 INFO L82 PathProgramCache]: Analyzing trace with hash 2044266853, now seen corresponding path program 4 times [2019-11-28 15:32:36,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:32:36,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319612556] [2019-11-28 15:32:36,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:32:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:32:36,899 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 15:32:36,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319612556] [2019-11-28 15:32:36,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402229642] [2019-11-28 15:32:36,901 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 15:32:36,961 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 15:32:36,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:32:36,963 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 15:32:36,966 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:32:37,009 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-28 15:32:37,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:32:37,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-11-28 15:32:37,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323200456] [2019-11-28 15:32:37,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 15:32:37,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:32:37,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 15:32:37,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 15:32:37,014 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 10 states. [2019-11-28 15:32:37,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:32:37,167 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2019-11-28 15:32:37,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 15:32:37,168 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-11-28 15:32:37,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:32:37,169 INFO L225 Difference]: With dead ends: 72 [2019-11-28 15:32:37,169 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 15:32:37,169 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 15:32:37,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 15:32:37,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 32. [2019-11-28 15:32:37,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 15:32:37,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-11-28 15:32:37,182 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 24 [2019-11-28 15:32:37,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:32:37,182 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-11-28 15:32:37,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 15:32:37,182 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-11-28 15:32:37,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 15:32:37,184 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:32:37,184 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:32:37,384 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:32:37,385 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:32:37,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:32:37,385 INFO L82 PathProgramCache]: Analyzing trace with hash -441689129, now seen corresponding path program 5 times [2019-11-28 15:32:37,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:32:37,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548844392] [2019-11-28 15:32:37,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:32:37,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:32:37,498 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-28 15:32:37,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548844392] [2019-11-28 15:32:37,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915096148] [2019-11-28 15:32:37,499 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 15:32:37,579 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-28 15:32:37,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:32:37,581 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 15:32:37,583 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:32:37,635 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-28 15:32:37,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:32:37,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-11-28 15:32:37,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403461699] [2019-11-28 15:32:37,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 15:32:37,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:32:37,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 15:32:37,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-28 15:32:37,641 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 12 states. [2019-11-28 15:32:37,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:32:37,769 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2019-11-28 15:32:37,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 15:32:37,770 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2019-11-28 15:32:37,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:32:37,771 INFO L225 Difference]: With dead ends: 87 [2019-11-28 15:32:37,771 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 15:32:37,775 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-28 15:32:37,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 15:32:37,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 37. [2019-11-28 15:32:37,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 15:32:37,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-11-28 15:32:37,791 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 29 [2019-11-28 15:32:37,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:32:37,792 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-11-28 15:32:37,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 15:32:37,793 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-11-28 15:32:37,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 15:32:37,795 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:32:37,795 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:32:37,998 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:32:37,999 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:32:37,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:32:38,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1895354217, now seen corresponding path program 6 times [2019-11-28 15:32:38,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:32:38,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281544805] [2019-11-28 15:32:38,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:32:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:32:38,196 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-28 15:32:38,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281544805] [2019-11-28 15:32:38,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312049165] [2019-11-28 15:32:38,197 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 15:32:38,273 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-28 15:32:38,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:32:38,275 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 15:32:38,279 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:32:38,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 15:32:38,477 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-28 15:32:38,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:32:38,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-11-28 15:32:38,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362277718] [2019-11-28 15:32:38,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 15:32:38,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:32:38,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 15:32:38,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-11-28 15:32:38,480 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 15 states. [2019-11-28 15:32:38,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:32:38,847 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2019-11-28 15:32:38,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 15:32:38,848 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2019-11-28 15:32:38,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:32:38,849 INFO L225 Difference]: With dead ends: 71 [2019-11-28 15:32:38,849 INFO L226 Difference]: Without dead ends: 49 [2019-11-28 15:32:38,852 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2019-11-28 15:32:38,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-28 15:32:38,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2019-11-28 15:32:38,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 15:32:38,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-11-28 15:32:38,863 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 34 [2019-11-28 15:32:38,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:32:38,866 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-11-28 15:32:38,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 15:32:38,867 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-11-28 15:32:38,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 15:32:38,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:32:38,869 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:32:39,075 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:32:39,076 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:32:39,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:32:39,076 INFO L82 PathProgramCache]: Analyzing trace with hash -958805492, now seen corresponding path program 1 times [2019-11-28 15:32:39,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:32:39,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755612171] [2019-11-28 15:32:39,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:32:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:32:39,154 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-11-28 15:32:39,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755612171] [2019-11-28 15:32:39,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:32:39,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:32:39,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689304273] [2019-11-28 15:32:39,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:32:39,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:32:39,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:32:39,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:32:39,157 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 3 states. [2019-11-28 15:32:39,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:32:39,163 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-11-28 15:32:39,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:32:39,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-28 15:32:39,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:32:39,165 INFO L225 Difference]: With dead ends: 49 [2019-11-28 15:32:39,165 INFO L226 Difference]: Without dead ends: 42 [2019-11-28 15:32:39,166 INFO L630 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 [2019-11-28 15:32:39,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-28 15:32:39,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-28 15:32:39,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 15:32:39,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-11-28 15:32:39,172 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 39 [2019-11-28 15:32:39,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:32:39,172 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-11-28 15:32:39,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:32:39,173 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-11-28 15:32:39,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 15:32:39,174 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:32:39,174 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:32:39,174 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:32:39,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:32:39,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1921874774, now seen corresponding path program 1 times [2019-11-28 15:32:39,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:32:39,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830405550] [2019-11-28 15:32:39,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:32:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:32:39,292 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-28 15:32:39,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830405550] [2019-11-28 15:32:39,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65054098] [2019-11-28 15:32:39,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 15:32:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:32:39,355 INFO L264 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 15:32:39,358 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:32:39,512 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-28 15:32:39,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:32:39,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-28 15:32:39,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139997659] [2019-11-28 15:32:39,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 15:32:39,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:32:39,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 15:32:39,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2019-11-28 15:32:39,515 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 18 states. [2019-11-28 15:32:39,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:32:39,556 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2019-11-28 15:32:39,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 15:32:39,557 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2019-11-28 15:32:39,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:32:39,558 INFO L225 Difference]: With dead ends: 70 [2019-11-28 15:32:39,558 INFO L226 Difference]: Without dead ends: 45 [2019-11-28 15:32:39,559 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2019-11-28 15:32:39,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-28 15:32:39,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-11-28 15:32:39,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-28 15:32:39,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-11-28 15:32:39,564 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 41 [2019-11-28 15:32:39,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:32:39,565 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-11-28 15:32:39,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 15:32:39,565 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-11-28 15:32:39,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-28 15:32:39,566 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:32:39,566 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:32:39,770 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:32:39,771 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:32:39,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:32:39,772 INFO L82 PathProgramCache]: Analyzing trace with hash 575418516, now seen corresponding path program 2 times [2019-11-28 15:32:39,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:32:39,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237114499] [2019-11-28 15:32:39,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:32:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:32:39,903 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-28 15:32:39,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237114499] [2019-11-28 15:32:39,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693749028] [2019-11-28 15:32:39,903 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 15:32:39,969 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 15:32:39,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:32:39,970 INFO L264 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 15:32:39,973 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:32:40,158 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-28 15:32:40,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:32:40,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2019-11-28 15:32:40,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557430039] [2019-11-28 15:32:40,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-28 15:32:40,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:32:40,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-28 15:32:40,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2019-11-28 15:32:40,161 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 20 states. [2019-11-28 15:32:40,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:32:40,211 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2019-11-28 15:32:40,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 15:32:40,212 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2019-11-28 15:32:40,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:32:40,213 INFO L225 Difference]: With dead ends: 72 [2019-11-28 15:32:40,213 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 15:32:40,214 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2019-11-28 15:32:40,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 15:32:40,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-11-28 15:32:40,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-28 15:32:40,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-11-28 15:32:40,221 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 43 [2019-11-28 15:32:40,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:32:40,222 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-11-28 15:32:40,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-28 15:32:40,222 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-11-28 15:32:40,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 15:32:40,223 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:32:40,223 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:32:40,429 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:32:40,429 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:32:40,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:32:40,430 INFO L82 PathProgramCache]: Analyzing trace with hash -583889326, now seen corresponding path program 3 times [2019-11-28 15:32:40,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:32:40,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260799973] [2019-11-28 15:32:40,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:32:40,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:32:40,573 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-28 15:32:40,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260799973] [2019-11-28 15:32:40,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264583176] [2019-11-28 15:32:40,574 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:32:40,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-28 15:32:40,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:32:40,622 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 15:32:40,625 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:32:40,703 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 [2019-11-28 15:32:40,703 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 15:32:40,713 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 15:32:40,714 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 15:32:40,714 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-28 15:32:40,838 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 15:32:40,839 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 24 treesize of output 24 [2019-11-28 15:32:40,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 15:32:40,840 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-28 15:32:40,850 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 15:32:40,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 15:32:40,855 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 15:32:40,855 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:15 [2019-11-28 15:32:40,935 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-28 15:32:40,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:32:40,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-11-28 15:32:40,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632416383] [2019-11-28 15:32:40,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 15:32:40,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:32:40,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 15:32:40,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-11-28 15:32:40,938 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 19 states. [2019-11-28 15:32:42,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:32:42,490 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2019-11-28 15:32:42,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-28 15:32:42,491 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2019-11-28 15:32:42,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:32:42,492 INFO L225 Difference]: With dead ends: 63 [2019-11-28 15:32:42,492 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 15:32:42,493 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=494, Invalid=1486, Unknown=0, NotChecked=0, Total=1980 [2019-11-28 15:32:42,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 15:32:42,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 15:32:42,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 15:32:42,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 15:32:42,494 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2019-11-28 15:32:42,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:32:42,494 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 15:32:42,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 15:32:42,494 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 15:32:42,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 15:32:42,695 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:32:42,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 15:32:42,864 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-11-28 15:32:42,905 INFO L246 CegarLoopResult]: For program point L2-1(line 2) no Hoare annotation was computed. [2019-11-28 15:32:42,905 INFO L246 CegarLoopResult]: For program point L2-3(line 2) no Hoare annotation was computed. [2019-11-28 15:32:42,905 INFO L246 CegarLoopResult]: For program point L31-2(lines 31 35) no Hoare annotation was computed. [2019-11-28 15:32:42,906 INFO L242 CegarLoopResult]: At program point L31-3(lines 31 35) the Hoare annotation is: (= ULTIMATE.start_main_~flag~0 1) [2019-11-28 15:32:42,906 INFO L246 CegarLoopResult]: For program point L31-4(lines 31 35) no Hoare annotation was computed. [2019-11-28 15:32:42,906 INFO L249 CegarLoopResult]: At program point L36(lines 17 37) the Hoare annotation is: true [2019-11-28 15:32:42,906 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 15:32:42,906 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 15:32:42,906 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 15:32:42,906 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2) no Hoare annotation was computed. [2019-11-28 15:32:42,907 INFO L246 CegarLoopResult]: For program point L24-2(lines 24 30) no Hoare annotation was computed. [2019-11-28 15:32:42,907 INFO L242 CegarLoopResult]: At program point L24-3(lines 24 30) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~#a~0.offset| 0)) (.cse1 (= |ULTIMATE.start_main_~#a~0.offset| ULTIMATE.start_init_~a.offset)) (.cse2 (exists ((v_ULTIMATE.start_init_~i~0_26 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0.base|) (+ |ULTIMATE.start_main_~#a~0.offset| (* v_ULTIMATE.start_init_~i~0_26 4))) 0)) (<= 999999 v_ULTIMATE.start_init_~i~0_26) (< v_ULTIMATE.start_init_~i~0_26 1000000)))) (.cse3 (= ULTIMATE.start_main_~flag~0 0)) (.cse4 (= |ULTIMATE.start_main_~#a~0.base| ULTIMATE.start_init_~a.base)) (.cse5 (exists ((v_ULTIMATE.start_init_~i~0_26 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0.base|) (+ |ULTIMATE.start_main_~#a~0.offset| (* v_ULTIMATE.start_init_~i~0_26 4))) 0)) (< v_ULTIMATE.start_init_~i~0_26 ULTIMATE.start_init_~size) (<= ULTIMATE.start_init_~i~0 (+ v_ULTIMATE.start_init_~i~0_26 1))))) (.cse6 (= ULTIMATE.start_init_~size 1000000))) (or (and .cse0 .cse1 (= ULTIMATE.start_main_~i~1 0) .cse2 .cse3 .cse4 .cse5 .cse6) (and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0.base|) |ULTIMATE.start_main_~#a~0.offset|)) .cse0 .cse1 .cse2 .cse3 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0.base|) |ULTIMATE.start_main_~#a~0.offset|) 0) .cse4 .cse5 (<= ULTIMATE.start_main_~i~1 999999) .cse6) (= ULTIMATE.start_main_~flag~0 1))) [2019-11-28 15:32:42,907 INFO L246 CegarLoopResult]: For program point L24-4(lines 24 30) no Hoare annotation was computed. [2019-11-28 15:32:42,907 INFO L246 CegarLoopResult]: For program point L12-2(lines 12 15) no Hoare annotation was computed. [2019-11-28 15:32:42,907 INFO L242 CegarLoopResult]: At program point L12-3(lines 12 15) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~#a~0.offset| 0)) (.cse1 (= |ULTIMATE.start_main_~#a~0.offset| ULTIMATE.start_init_~a.offset)) (.cse2 (= ULTIMATE.start_main_~flag~0 0)) (.cse3 (= |ULTIMATE.start_main_~#a~0.base| ULTIMATE.start_init_~a.base)) (.cse4 (= ULTIMATE.start_init_~size 1000000))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_init_~i~0 0) .cse4) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_ULTIMATE.start_init_~i~0_26 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0.base|) (+ |ULTIMATE.start_main_~#a~0.offset| (* v_ULTIMATE.start_init_~i~0_26 4))) 0)) (< v_ULTIMATE.start_init_~i~0_26 ULTIMATE.start_init_~size) (<= ULTIMATE.start_init_~i~0 (+ v_ULTIMATE.start_init_~i~0_26 1)))) .cse4))) [2019-11-28 15:32:42,907 INFO L246 CegarLoopResult]: For program point L33(lines 33 34) no Hoare annotation was computed. [2019-11-28 15:32:42,908 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 15:32:42,908 INFO L246 CegarLoopResult]: For program point L9(lines 9 16) no Hoare annotation was computed. [2019-11-28 15:32:42,908 INFO L246 CegarLoopResult]: For program point L26(lines 26 29) no Hoare annotation was computed. [2019-11-28 15:32:42,908 INFO L246 CegarLoopResult]: For program point L2(line 2) no Hoare annotation was computed. [2019-11-28 15:32:42,922 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:32:42,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:42,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:42,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:42,924 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:32:42,925 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:42,925 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:42,925 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:42,925 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-28 15:32:42,926 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:32:42,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:42,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:42,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:42,927 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:32:42,927 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:32:42,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:42,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:42,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:42,931 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:32:42,931 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:32:42,931 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:32:42,932 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:32:42,932 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:32:42,932 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:32:42,936 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:32:42,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:42,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:42,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:42,937 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:32:42,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:42,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:42,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:42,938 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-28 15:32:42,938 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:32:42,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:42,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:42,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:42,939 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:32:42,940 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:32:42,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:42,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:42,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:42,941 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:32:42,942 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:32:42,942 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:32:42,942 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:32:42,942 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:32:42,943 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:32:42,945 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:32:42,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:42,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:42,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:42,946 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:32:42,947 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:32:42,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:42,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:42,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:42,948 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:32:42,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:32:42 BoogieIcfgContainer [2019-11-28 15:32:42,951 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:32:42,951 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:32:42,952 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:32:42,952 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:32:42,952 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:32:34" (3/4) ... [2019-11-28 15:32:42,957 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 15:32:42,978 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-28 15:32:42,979 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-28 15:32:42,979 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 15:32:43,015 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((a == 0 && a == a) && flag == 0) && a == a) && i == 0) && size == 1000000) || (((((a == 0 && a == a) && flag == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) && size == 1000000) [2019-11-28 15:32:43,016 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((a == 0 && a == a) && i == 0) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && 999999 <= v_ULTIMATE.start_init_~i~0_26) && v_ULTIMATE.start_init_~i~0_26 < 1000000)) && flag == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) && size == 1000000) || (((((((((0 == #memory_$Pointer$[a][a] && a == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && 999999 <= v_ULTIMATE.start_init_~i~0_26) && v_ULTIMATE.start_init_~i~0_26 < 1000000)) && flag == 0) && #memory_$Pointer$[a][a] == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) && i <= 999999) && size == 1000000)) || flag == 1 [2019-11-28 15:32:43,060 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:32:43,064 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:32:43,066 INFO L168 Benchmark]: Toolchain (without parser) took 9303.30 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 277.3 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -248.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. [2019-11-28 15:32:43,066 INFO L168 Benchmark]: CDTParser took 0.88 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:32:43,067 INFO L168 Benchmark]: CACSL2BoogieTranslator took 369.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -172.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 15:32:43,067 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:32:43,067 INFO L168 Benchmark]: Boogie Preprocessor took 27.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:32:43,068 INFO L168 Benchmark]: RCFGBuilder took 330.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-11-28 15:32:43,068 INFO L168 Benchmark]: TraceAbstraction took 8417.86 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 141.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -111.1 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2019-11-28 15:32:43,069 INFO L168 Benchmark]: Witness Printer took 112.58 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:32:43,071 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.88 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 369.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -172.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 330.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8417.86 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 141.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -111.1 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * Witness Printer took 112.58 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant [2019-11-28 15:32:43,089 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:32:43,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:43,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:43,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:43,093 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:32:43,093 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:43,093 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:43,093 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:43,094 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-28 15:32:43,094 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:32:43,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:43,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:43,095 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:43,095 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:32:43,095 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:32:43,095 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:43,095 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:43,095 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:43,096 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:32:43,096 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:32:43,097 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:32:43,097 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:32:43,097 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:32:43,097 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:32:43,098 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:32:43,099 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:43,099 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:43,099 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:43,099 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:32:43,099 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:43,100 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:43,100 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:43,100 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-28 15:32:43,100 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:32:43,100 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:43,101 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:43,101 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:43,101 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:32:43,101 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:32:43,101 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:43,102 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:43,102 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:43,102 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:32:43,103 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:32:43,103 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:32:43,103 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:32:43,103 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:32:43,104 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((((a == 0 && a == a) && i == 0) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && 999999 <= v_ULTIMATE.start_init_~i~0_26) && v_ULTIMATE.start_init_~i~0_26 < 1000000)) && flag == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) && size == 1000000) || (((((((((0 == #memory_$Pointer$[a][a] && a == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && 999999 <= v_ULTIMATE.start_init_~i~0_26) && v_ULTIMATE.start_init_~i~0_26 < 1000000)) && flag == 0) && #memory_$Pointer$[a][a] == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) && i <= 999999) && size == 1000000)) || flag == 1 - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: flag == 1 - InvariantResult [Line: 12]: Loop Invariant [2019-11-28 15:32:43,105 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:32:43,105 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:43,105 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:43,106 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:43,106 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:32:43,106 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:32:43,107 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:43,107 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:43,107 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:32:43,107 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((a == 0 && a == a) && flag == 0) && a == a) && i == 0) && size == 1000000) || (((((a == 0 && a == a) && flag == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) && size == 1000000) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. Result: SAFE, OverallTime: 8.0s, OverallIterations: 14, TraceHistogramMax: 9, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 214 SDtfs, 241 SDslu, 499 SDs, 0 SdLazy, 507 SolverSat, 69 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 380 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=13, 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, 14 MinimizatonAttempts, 93 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 22 NumberOfFragments, 202 HoareAnnotationTreeSize, 4 FomulaSimplifications, 630 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 6 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 619 NumberOfCodeBlocks, 585 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 596 ConstructedInterpolants, 12 QuantifiedInterpolants, 79467 SizeOfPredicates, 37 NumberOfNonLiveVariables, 1175 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 23 InterpolantComputations, 5 PerfectInterpolantSequences, 424/879 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...