./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/genady.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 30f4e4ab 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/termination-crafted-lit/genady.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6938b5c805400363799492c040263d9022406929 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:52:23,576 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:52:23,579 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:52:23,591 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:52:23,592 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:52:23,593 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:52:23,594 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:52:23,596 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:52:23,598 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:52:23,599 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:52:23,600 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:52:23,601 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:52:23,602 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:52:23,603 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:52:23,604 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:52:23,605 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:52:23,606 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:52:23,607 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:52:23,609 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:52:23,611 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:52:23,612 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:52:23,614 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:52:23,615 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:52:23,616 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:52:23,618 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:52:23,618 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:52:23,619 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:52:23,620 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:52:23,621 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:52:23,622 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:52:23,622 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:52:23,623 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:52:23,625 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:52:23,626 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:52:23,627 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:52:23,627 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:52:23,628 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:52:23,628 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:52:23,628 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:52:23,632 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:52:23,634 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:52:23,634 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-28 02:52:23,657 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:52:23,657 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:52:23,659 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:52:23,659 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:52:23,659 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:52:23,659 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:52:23,660 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:52:23,660 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:52:23,660 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:52:23,660 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 02:52:23,661 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:52:23,661 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 02:52:23,662 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-28 02:52:23,662 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 02:52:23,662 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:52:23,662 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 02:52:23,663 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:52:23,663 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:52:23,663 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:52:23,663 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:52:23,664 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:52:23,664 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:52:23,664 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:52:23,664 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 02:52:23,665 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:52:23,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:52:23,665 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 02:52:23,665 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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6938b5c805400363799492c040263d9022406929 [2019-11-28 02:52:24,006 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:52:24,019 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:52:24,022 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:52:24,024 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:52:24,024 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:52:24,025 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/genady.c [2019-11-28 02:52:24,084 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/337c0a4c1/195310b0ea9c42b68c59f6b6265c163f/FLAG82a9952f0 [2019-11-28 02:52:24,486 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:52:24,487 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/genady.c [2019-11-28 02:52:24,494 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/337c0a4c1/195310b0ea9c42b68c59f6b6265c163f/FLAG82a9952f0 [2019-11-28 02:52:24,909 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/337c0a4c1/195310b0ea9c42b68c59f6b6265c163f [2019-11-28 02:52:24,912 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:52:24,914 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 02:52:24,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:52:24,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:52:24,918 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:52:24,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:52:24" (1/1) ... [2019-11-28 02:52:24,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@203a729c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:52:24, skipping insertion in model container [2019-11-28 02:52:24,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:52:24" (1/1) ... [2019-11-28 02:52:24,930 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:52:24,944 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:52:25,100 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:52:25,105 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:52:25,120 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:52:25,134 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:52:25,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:52:25 WrapperNode [2019-11-28 02:52:25,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:52:25,135 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 02:52:25,135 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 02:52:25,135 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 02:52:25,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:52:25" (1/1) ... [2019-11-28 02:52:25,150 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:52:25" (1/1) ... [2019-11-28 02:52:25,168 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 02:52:25,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:52:25,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:52:25,169 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:52:25,230 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:52:25" (1/1) ... [2019-11-28 02:52:25,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:52:25" (1/1) ... [2019-11-28 02:52:25,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:52:25" (1/1) ... [2019-11-28 02:52:25,231 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:52:25" (1/1) ... [2019-11-28 02:52:25,233 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:52:25" (1/1) ... [2019-11-28 02:52:25,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:52:25" (1/1) ... [2019-11-28 02:52:25,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:52:25" (1/1) ... [2019-11-28 02:52:25,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:52:25,238 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:52:25,238 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:52:25,239 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:52:25,239 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:52:25" (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 02:52:25,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:52:25,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:52:25,446 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:52:25,446 INFO L297 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 02:52:25,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:52:25 BoogieIcfgContainer [2019-11-28 02:52:25,448 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:52:25,449 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:52:25,449 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:52:25,453 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:52:25,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:52:24" (1/3) ... [2019-11-28 02:52:25,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5faea8c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:52:25, skipping insertion in model container [2019-11-28 02:52:25,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:52:25" (2/3) ... [2019-11-28 02:52:25,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5faea8c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:52:25, skipping insertion in model container [2019-11-28 02:52:25,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:52:25" (3/3) ... [2019-11-28 02:52:25,456 INFO L109 eAbstractionObserver]: Analyzing ICFG genady.c [2019-11-28 02:52:25,466 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:52:25,474 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-28 02:52:25,488 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-28 02:52:25,517 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:52:25,517 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 02:52:25,518 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:52:25,518 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:52:25,518 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:52:25,518 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:52:25,519 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:52:25,519 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:52:25,538 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-11-28 02:52:25,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-11-28 02:52:25,545 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:52:25,546 INFO L410 BasicCegarLoop]: trace histogram [1, 1] [2019-11-28 02:52:25,547 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:52:25,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:52:25,555 INFO L82 PathProgramCache]: Analyzing trace with hash 998, now seen corresponding path program 1 times [2019-11-28 02:52:25,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:52:25,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066981051] [2019-11-28 02:52:25,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:52:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:52:25,710 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 02:52:25,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066981051] [2019-11-28 02:52:25,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:52:25,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 02:52:25,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853316806] [2019-11-28 02:52:25,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:52:25,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:52:25,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:52:25,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:52:25,740 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2019-11-28 02:52:25,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:52:25,816 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-11-28 02:52:25,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:52:25,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-11-28 02:52:25,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:52:25,826 INFO L225 Difference]: With dead ends: 22 [2019-11-28 02:52:25,826 INFO L226 Difference]: Without dead ends: 13 [2019-11-28 02:52:25,829 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 02:52:25,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-11-28 02:52:25,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-28 02:52:25,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 02:52:25,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-11-28 02:52:25,857 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 2 [2019-11-28 02:52:25,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:52:25,858 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-11-28 02:52:25,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:52:25,858 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-11-28 02:52:25,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 02:52:25,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:52:25,859 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 02:52:25,860 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:52:25,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:52:25,860 INFO L82 PathProgramCache]: Analyzing trace with hash 30977, now seen corresponding path program 1 times [2019-11-28 02:52:25,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:52:25,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467397644] [2019-11-28 02:52:25,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:52:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:52:25,888 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 02:52:25,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467397644] [2019-11-28 02:52:25,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:52:25,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 02:52:25,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753009251] [2019-11-28 02:52:25,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:52:25,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:52:25,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:52:25,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:52:25,892 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 3 states. [2019-11-28 02:52:25,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:52:25,941 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-11-28 02:52:25,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:52:25,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 02:52:25,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:52:25,942 INFO L225 Difference]: With dead ends: 21 [2019-11-28 02:52:25,942 INFO L226 Difference]: Without dead ends: 20 [2019-11-28 02:52:25,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 02:52:25,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-28 02:52:25,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2019-11-28 02:52:25,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-28 02:52:25,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-11-28 02:52:25,948 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 3 [2019-11-28 02:52:25,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:52:25,949 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-11-28 02:52:25,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:52:25,949 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-11-28 02:52:25,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 02:52:25,950 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:52:25,950 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 02:52:25,950 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:52:25,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:52:25,951 INFO L82 PathProgramCache]: Analyzing trace with hash 29770307, now seen corresponding path program 1 times [2019-11-28 02:52:25,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:52:25,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783669587] [2019-11-28 02:52:25,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:52:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:52:25,971 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 02:52:25,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783669587] [2019-11-28 02:52:25,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:52:25,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 02:52:25,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082596657] [2019-11-28 02:52:25,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:52:25,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:52:25,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:52:25,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:52:25,974 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 3 states. [2019-11-28 02:52:25,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:52:25,999 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-11-28 02:52:26,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:52:26,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 02:52:26,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:52:26,001 INFO L225 Difference]: With dead ends: 19 [2019-11-28 02:52:26,001 INFO L226 Difference]: Without dead ends: 18 [2019-11-28 02:52:26,001 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 02:52:26,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-28 02:52:26,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-28 02:52:26,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 02:52:26,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-11-28 02:52:26,006 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 5 [2019-11-28 02:52:26,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:52:26,006 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-11-28 02:52:26,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:52:26,007 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-11-28 02:52:26,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-28 02:52:26,007 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:52:26,007 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-28 02:52:26,008 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:52:26,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:52:26,008 INFO L82 PathProgramCache]: Analyzing trace with hash 922879565, now seen corresponding path program 1 times [2019-11-28 02:52:26,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:52:26,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350053900] [2019-11-28 02:52:26,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:52:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:52:26,029 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 02:52:26,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350053900] [2019-11-28 02:52:26,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:52:26,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 02:52:26,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746443091] [2019-11-28 02:52:26,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:52:26,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:52:26,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:52:26,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:52:26,032 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 3 states. [2019-11-28 02:52:26,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:52:26,049 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-11-28 02:52:26,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:52:26,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-28 02:52:26,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:52:26,051 INFO L225 Difference]: With dead ends: 17 [2019-11-28 02:52:26,051 INFO L226 Difference]: Without dead ends: 16 [2019-11-28 02:52:26,051 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 02:52:26,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-11-28 02:52:26,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-28 02:52:26,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-28 02:52:26,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-11-28 02:52:26,056 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 6 [2019-11-28 02:52:26,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:52:26,057 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-11-28 02:52:26,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:52:26,057 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-11-28 02:52:26,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 02:52:26,058 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:52:26,058 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:52:26,058 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:52:26,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:52:26,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1455504507, now seen corresponding path program 1 times [2019-11-28 02:52:26,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:52:26,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791412098] [2019-11-28 02:52:26,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:52:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:52:26,087 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 02:52:26,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791412098] [2019-11-28 02:52:26,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:52:26,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 02:52:26,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590809103] [2019-11-28 02:52:26,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:52:26,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:52:26,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:52:26,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:52:26,092 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 3 states. [2019-11-28 02:52:26,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:52:26,111 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-11-28 02:52:26,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:52:26,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-28 02:52:26,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:52:26,112 INFO L225 Difference]: With dead ends: 16 [2019-11-28 02:52:26,112 INFO L226 Difference]: Without dead ends: 15 [2019-11-28 02:52:26,113 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 02:52:26,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-11-28 02:52:26,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-28 02:52:26,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-28 02:52:26,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-11-28 02:52:26,117 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 7 [2019-11-28 02:52:26,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:52:26,117 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-11-28 02:52:26,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:52:26,117 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-11-28 02:52:26,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 02:52:26,118 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:52:26,118 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:52:26,118 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:52:26,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:52:26,119 INFO L82 PathProgramCache]: Analyzing trace with hash 2124000591, now seen corresponding path program 1 times [2019-11-28 02:52:26,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:52:26,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282698268] [2019-11-28 02:52:26,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:52:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:52:26,179 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 02:52:26,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282698268] [2019-11-28 02:52:26,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:52:26,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 02:52:26,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178378325] [2019-11-28 02:52:26,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:52:26,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:52:26,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:52:26,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:52:26,182 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 3 states. [2019-11-28 02:52:26,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:52:26,216 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-11-28 02:52:26,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:52:26,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-28 02:52:26,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:52:26,218 INFO L225 Difference]: With dead ends: 19 [2019-11-28 02:52:26,218 INFO L226 Difference]: Without dead ends: 18 [2019-11-28 02:52:26,219 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 02:52:26,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-28 02:52:26,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-28 02:52:26,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 02:52:26,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-11-28 02:52:26,225 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 8 [2019-11-28 02:52:26,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:52:26,226 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-11-28 02:52:26,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:52:26,227 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-11-28 02:52:26,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 02:52:26,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:52:26,228 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:52:26,229 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:52:26,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:52:26,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1055103537, now seen corresponding path program 1 times [2019-11-28 02:52:26,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:52:26,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584431530] [2019-11-28 02:52:26,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:52:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:52:26,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:52:26,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584431530] [2019-11-28 02:52:26,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475083727] [2019-11-28 02:52:26,298 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 02:52:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:52:26,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:52:26,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:52:26,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:52:26,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:52:26,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-11-28 02:52:26,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221624846] [2019-11-28 02:52:26,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:52:26,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:52:26,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:52:26,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:52:26,423 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 9 states. [2019-11-28 02:52:26,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:52:26,593 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-11-28 02:52:26,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:52:26,594 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-11-28 02:52:26,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:52:26,595 INFO L225 Difference]: With dead ends: 25 [2019-11-28 02:52:26,595 INFO L226 Difference]: Without dead ends: 24 [2019-11-28 02:52:26,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:52:26,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-28 02:52:26,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2019-11-28 02:52:26,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 02:52:26,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-11-28 02:52:26,604 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 10 [2019-11-28 02:52:26,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:52:26,605 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-11-28 02:52:26,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:52:26,605 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-11-28 02:52:26,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 02:52:26,606 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:52:26,606 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 02:52:26,812 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:52:26,813 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:52:26,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:52:26,813 INFO L82 PathProgramCache]: Analyzing trace with hash 342218611, now seen corresponding path program 1 times [2019-11-28 02:52:26,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:52:26,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862806415] [2019-11-28 02:52:26,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:52:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:52:26,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:52:26,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862806415] [2019-11-28 02:52:26,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581010905] [2019-11-28 02:52:26,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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) [2019-11-28 02:52:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:52:26,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 02:52:26,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:52:26,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:52:26,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:52:26,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2019-11-28 02:52:26,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336439309] [2019-11-28 02:52:26,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:52:26,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:52:26,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:52:26,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:52:26,920 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 4 states. [2019-11-28 02:52:26,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:52:26,968 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-11-28 02:52:26,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:52:26,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-28 02:52:26,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:52:26,970 INFO L225 Difference]: With dead ends: 24 [2019-11-28 02:52:26,970 INFO L226 Difference]: Without dead ends: 23 [2019-11-28 02:52:26,971 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:52:26,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-28 02:52:26,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-28 02:52:26,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-28 02:52:26,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-11-28 02:52:26,977 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 12 [2019-11-28 02:52:26,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:52:26,978 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-11-28 02:52:26,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:52:26,978 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-11-28 02:52:26,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 02:52:26,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:52:26,979 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1] [2019-11-28 02:52:27,182 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:52:27,183 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:52:27,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:52:27,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1217672673, now seen corresponding path program 1 times [2019-11-28 02:52:27,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:52:27,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555037194] [2019-11-28 02:52:27,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:52:27,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:52:27,227 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:52:27,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555037194] [2019-11-28 02:52:27,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110604228] [2019-11-28 02:52:27,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 02:52:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:52:27,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 02:52:27,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:52:27,251 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:52:27,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:52:27,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2019-11-28 02:52:27,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681380096] [2019-11-28 02:52:27,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:52:27,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:52:27,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:52:27,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:52:27,254 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 4 states. [2019-11-28 02:52:27,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:52:27,292 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-11-28 02:52:27,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:52:27,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-28 02:52:27,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:52:27,294 INFO L225 Difference]: With dead ends: 26 [2019-11-28 02:52:27,294 INFO L226 Difference]: Without dead ends: 25 [2019-11-28 02:52:27,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:52:27,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-28 02:52:27,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-11-28 02:52:27,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 02:52:27,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-11-28 02:52:27,300 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 15 [2019-11-28 02:52:27,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:52:27,300 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-11-28 02:52:27,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:52:27,301 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-11-28 02:52:27,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 02:52:27,301 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:52:27,302 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1] [2019-11-28 02:52:27,509 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:52:27,510 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:52:27,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:52:27,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1952333055, now seen corresponding path program 2 times [2019-11-28 02:52:27,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:52:27,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229751679] [2019-11-28 02:52:27,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:52:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:52:27,602 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:52:27,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229751679] [2019-11-28 02:52:27,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055723918] [2019-11-28 02:52:27,605 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-11-28 02:52:27,639 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:52:27,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:52:27,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:52:27,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:52:27,742 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:52:27,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:52:27,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2019-11-28 02:52:27,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365802477] [2019-11-28 02:52:27,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 02:52:27,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:52:27,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 02:52:27,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:52:27,746 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2019-11-28 02:52:27,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:52:27,997 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-11-28 02:52:27,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:52:27,998 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2019-11-28 02:52:27,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:52:27,999 INFO L225 Difference]: With dead ends: 32 [2019-11-28 02:52:27,999 INFO L226 Difference]: Without dead ends: 31 [2019-11-28 02:52:28,000 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2019-11-28 02:52:28,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-28 02:52:28,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2019-11-28 02:52:28,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 02:52:28,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-11-28 02:52:28,008 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 17 [2019-11-28 02:52:28,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:52:28,010 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-11-28 02:52:28,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 02:52:28,011 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-11-28 02:52:28,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:52:28,011 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:52:28,011 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1] [2019-11-28 02:52:28,212 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:52:28,213 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:52:28,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:52:28,214 INFO L82 PathProgramCache]: Analyzing trace with hash 708643907, now seen corresponding path program 2 times [2019-11-28 02:52:28,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:52:28,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000748791] [2019-11-28 02:52:28,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:52:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:52:28,262 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-28 02:52:28,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000748791] [2019-11-28 02:52:28,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292275948] [2019-11-28 02:52:28,263 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 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 02:52:28,285 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:52:28,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:52:28,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:52:28,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:52:28,349 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:52:28,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:52:28,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-11-28 02:52:28,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809288813] [2019-11-28 02:52:28,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:52:28,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:52:28,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:52:28,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:52:28,352 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 8 states. [2019-11-28 02:52:28,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:52:28,488 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2019-11-28 02:52:28,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:52:28,489 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-28 02:52:28,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:52:28,490 INFO L225 Difference]: With dead ends: 37 [2019-11-28 02:52:28,490 INFO L226 Difference]: Without dead ends: 36 [2019-11-28 02:52:28,491 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-11-28 02:52:28,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-28 02:52:28,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2019-11-28 02:52:28,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 02:52:28,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-11-28 02:52:28,495 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 19 [2019-11-28 02:52:28,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:52:28,495 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-11-28 02:52:28,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:52:28,496 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-11-28 02:52:28,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:52:28,496 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:52:28,496 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1] [2019-11-28 02:52:28,699 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:52:28,700 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:52:28,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:52:28,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1446421327, now seen corresponding path program 2 times [2019-11-28 02:52:28,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:52:28,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273785292] [2019-11-28 02:52:28,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:52:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:52:28,774 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-28 02:52:28,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273785292] [2019-11-28 02:52:28,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064066276] [2019-11-28 02:52:28,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 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 02:52:28,819 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:52:28,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:52:28,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:52:28,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:52:28,887 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:52:28,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:52:28,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-11-28 02:52:28,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463216141] [2019-11-28 02:52:28,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:52:28,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:52:28,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:52:28,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:52:28,889 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 9 states. [2019-11-28 02:52:29,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:52:29,045 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-11-28 02:52:29,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:52:29,046 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-11-28 02:52:29,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:52:29,046 INFO L225 Difference]: With dead ends: 26 [2019-11-28 02:52:29,047 INFO L226 Difference]: Without dead ends: 25 [2019-11-28 02:52:29,047 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-11-28 02:52:29,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-28 02:52:29,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-11-28 02:52:29,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 02:52:29,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-11-28 02:52:29,055 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-11-28 02:52:29,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:52:29,056 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-11-28 02:52:29,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:52:29,056 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-11-28 02:52:29,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 02:52:29,056 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:52:29,059 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1] [2019-11-28 02:52:29,260 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:52:29,260 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:52:29,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:52:29,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1558507471, now seen corresponding path program 3 times [2019-11-28 02:52:29,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:52:29,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979278164] [2019-11-28 02:52:29,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:52:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:52:29,347 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:52:29,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979278164] [2019-11-28 02:52:29,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232431956] [2019-11-28 02:52:29,349 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 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 02:52:29,375 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-28 02:52:29,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:52:29,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:52:29,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:52:29,425 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-28 02:52:29,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:52:29,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 11 [2019-11-28 02:52:29,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084723071] [2019-11-28 02:52:29,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:52:29,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:52:29,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:52:29,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:52:29,428 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 5 states. [2019-11-28 02:52:29,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:52:29,467 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-11-28 02:52:29,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:52:29,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-11-28 02:52:29,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:52:29,469 INFO L225 Difference]: With dead ends: 25 [2019-11-28 02:52:29,469 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 02:52:29,469 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:52:29,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 02:52:29,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 02:52:29,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 02:52:29,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 02:52:29,471 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2019-11-28 02:52:29,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:52:29,471 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:52:29,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:52:29,471 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:52:29,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 02:52:29,675 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:52:29,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 02:52:29,807 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 13 [2019-11-28 02:52:29,812 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-11-28 02:52:29,812 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 02:52:29,812 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 16) no Hoare annotation was computed. [2019-11-28 02:52:29,812 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 17) no Hoare annotation was computed. [2019-11-28 02:52:29,813 INFO L242 CegarLoopResult]: At program point L19(lines 11 20) the Hoare annotation is: (<= ULTIMATE.start_main_~i~0 (+ ULTIMATE.start_main_~j~0 9999)) [2019-11-28 02:52:29,813 INFO L246 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2019-11-28 02:52:29,813 INFO L246 CegarLoopResult]: For program point L17-1(line 17) no Hoare annotation was computed. [2019-11-28 02:52:29,813 INFO L246 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2019-11-28 02:52:29,813 INFO L246 CegarLoopResult]: For program point L15-2(lines 15 18) no Hoare annotation was computed. [2019-11-28 02:52:29,813 INFO L242 CegarLoopResult]: At program point L15-4(lines 15 18) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0))) (and (<= ULTIMATE.start_main_~j~0 (+ ULTIMATE.start_main_~i~0 1)) (<= 10001 .cse0) (<= .cse0 10001) (<= ULTIMATE.start_main_~i~0 (+ ULTIMATE.start_main_~j~0 9999)))) [2019-11-28 02:52:29,813 INFO L246 CegarLoopResult]: For program point L15-5(lines 15 18) no Hoare annotation was computed. [2019-11-28 02:52:29,814 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-11-28 02:52:29,814 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 16) no Hoare annotation was computed. [2019-11-28 02:52:29,814 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 02:52:29,814 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 17) no Hoare annotation was computed. [2019-11-28 02:52:29,814 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 02:52:29,814 INFO L246 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2019-11-28 02:52:29,814 INFO L246 CegarLoopResult]: For program point L16-1(line 16) no Hoare annotation was computed. [2019-11-28 02:52:29,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:52:29 BoogieIcfgContainer [2019-11-28 02:52:29,832 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:52:29,833 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:52:29,833 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:52:29,833 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:52:29,833 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:52:25" (3/4) ... [2019-11-28 02:52:29,837 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 02:52:29,849 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 02:52:29,849 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 02:52:29,885 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:52:29,886 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:52:29,887 INFO L168 Benchmark]: Toolchain (without parser) took 4974.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.6 MB). Free memory was 961.7 MB in the beginning and 1.2 GB in the end (delta: -227.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:52:29,888 INFO L168 Benchmark]: CDTParser took 0.26 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 02:52:29,888 INFO L168 Benchmark]: CACSL2BoogieTranslator took 219.99 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:52:29,889 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.98 ms. Allocated memory is still 1.0 GB. Free memory is still 951.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:52:29,890 INFO L168 Benchmark]: Boogie Preprocessor took 69.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -195.9 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:52:29,890 INFO L168 Benchmark]: RCFGBuilder took 209.98 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: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-28 02:52:29,891 INFO L168 Benchmark]: TraceAbstraction took 4382.83 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -71.1 MB). Peak memory consumption was 296.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:52:29,892 INFO L168 Benchmark]: Witness Printer took 53.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:52:29,895 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.26 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 219.99 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.98 ms. Allocated memory is still 1.0 GB. Free memory is still 951.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -195.9 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 209.98 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: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4382.83 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -71.1 MB). Peak memory consumption was 296.7 MB. Max. memory is 11.5 GB. * Witness Printer took 53.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((j <= i + 1 && 10001 <= i + j) && i + j <= 10001) && i <= j + 9999 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: i <= j + 9999 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 6 error locations. Result: SAFE, OverallTime: 4.1s, OverallIterations: 13, TraceHistogramMax: 4, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 53 SDtfs, 145 SDslu, 21 SDs, 0 SdLazy, 393 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 25 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 6 NumberOfFragments, 26 HoareAnnotationTreeSize, 2 FomulaSimplifications, 71 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 108 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 269 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 249 ConstructedInterpolants, 0 QuantifiedInterpolants, 15709 SizeOfPredicates, 1 NumberOfNonLiveVariables, 184 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 20 InterpolantComputations, 7 PerfectInterpolantSequences, 64/174 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...