./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-numeric/recHanoi02_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/termination-numeric/recHanoi02_true-termination_true-no-overflow.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 5562cc301d5faa8ad8777fb25a4973bec89fa1c5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 21:51:13,687 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 21:51:13,689 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 21:51:13,701 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 21:51:13,701 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 21:51:13,703 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 21:51:13,704 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 21:51:13,706 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 21:51:13,708 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 21:51:13,709 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 21:51:13,709 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 21:51:13,710 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 21:51:13,711 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 21:51:13,712 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 21:51:13,713 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 21:51:13,714 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 21:51:13,715 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 21:51:13,717 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 21:51:13,720 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 21:51:13,721 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 21:51:13,723 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 21:51:13,724 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 21:51:13,726 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 21:51:13,726 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 21:51:13,727 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 21:51:13,728 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 21:51:13,729 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 21:51:13,730 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 21:51:13,731 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 21:51:13,732 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 21:51:13,733 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 21:51:13,733 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 21:51:13,733 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 21:51:13,734 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 21:51:13,735 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 21:51:13,736 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 21:51:13,736 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-14 21:51:13,763 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 21:51:13,763 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 21:51:13,765 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 21:51:13,766 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 21:51:13,766 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 21:51:13,767 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 21:51:13,767 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 21:51:13,767 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 21:51:13,767 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 21:51:13,767 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 21:51:13,767 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 21:51:13,768 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 21:51:13,768 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-14 21:51:13,768 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 21:51:13,768 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 21:51:13,768 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 21:51:13,768 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 21:51:13,769 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 21:51:13,769 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 21:51:13,769 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 21:51:13,769 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 21:51:13,769 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 21:51:13,769 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 21:51:13,770 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 21:51:13,773 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 21:51:13,773 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 21:51:13,773 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> 5562cc301d5faa8ad8777fb25a4973bec89fa1c5 [2019-01-14 21:51:13,837 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 21:51:13,855 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 21:51:13,863 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 21:51:13,865 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 21:51:13,866 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 21:51:13,868 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-numeric/recHanoi02_true-termination_true-no-overflow.c [2019-01-14 21:51:13,926 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78a4a8fd4/bfcb8dddf1e64792806e285d8988b402/FLAG0280b23ec [2019-01-14 21:51:14,333 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 21:51:14,334 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-numeric/recHanoi02_true-termination_true-no-overflow.c [2019-01-14 21:51:14,344 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78a4a8fd4/bfcb8dddf1e64792806e285d8988b402/FLAG0280b23ec [2019-01-14 21:51:14,697 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78a4a8fd4/bfcb8dddf1e64792806e285d8988b402 [2019-01-14 21:51:14,701 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 21:51:14,702 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 21:51:14,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 21:51:14,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 21:51:14,707 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 21:51:14,707 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 09:51:14" (1/1) ... [2019-01-14 21:51:14,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11c73574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:51:14, skipping insertion in model container [2019-01-14 21:51:14,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 09:51:14" (1/1) ... [2019-01-14 21:51:14,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 21:51:14,736 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 21:51:14,898 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 21:51:14,908 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 21:51:14,929 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 21:51:14,951 INFO L195 MainTranslator]: Completed translation [2019-01-14 21:51:14,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:51:14 WrapperNode [2019-01-14 21:51:14,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 21:51:14,954 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 21:51:14,954 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 21:51:14,954 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 21:51:14,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:51:14" (1/1) ... [2019-01-14 21:51:14,971 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:51:14" (1/1) ... [2019-01-14 21:51:14,998 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 21:51:14,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 21:51:14,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 21:51:14,999 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 21:51:15,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:51:14" (1/1) ... [2019-01-14 21:51:15,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:51:14" (1/1) ... [2019-01-14 21:51:15,012 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:51:14" (1/1) ... [2019-01-14 21:51:15,013 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:51:14" (1/1) ... [2019-01-14 21:51:15,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:51:14" (1/1) ... [2019-01-14 21:51:15,019 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:51:14" (1/1) ... [2019-01-14 21:51:15,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:51:14" (1/1) ... [2019-01-14 21:51:15,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 21:51:15,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 21:51:15,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 21:51:15,022 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 21:51:15,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:51:14" (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-01-14 21:51:15,156 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2019-01-14 21:51:15,157 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2019-01-14 21:51:15,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 21:51:15,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 21:51:15,438 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 21:51:15,439 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 21:51:15,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:51:15 BoogieIcfgContainer [2019-01-14 21:51:15,440 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 21:51:15,441 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 21:51:15,441 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 21:51:15,444 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 21:51:15,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 09:51:14" (1/3) ... [2019-01-14 21:51:15,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f28c64e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 09:51:15, skipping insertion in model container [2019-01-14 21:51:15,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:51:14" (2/3) ... [2019-01-14 21:51:15,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f28c64e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 09:51:15, skipping insertion in model container [2019-01-14 21:51:15,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:51:15" (3/3) ... [2019-01-14 21:51:15,447 INFO L112 eAbstractionObserver]: Analyzing ICFG recHanoi02_true-termination_true-no-overflow.c [2019-01-14 21:51:15,457 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 21:51:15,466 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-14 21:51:15,483 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-14 21:51:15,513 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 21:51:15,514 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 21:51:15,514 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 21:51:15,514 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 21:51:15,514 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 21:51:15,514 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 21:51:15,514 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 21:51:15,515 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 21:51:15,515 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 21:51:15,533 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-01-14 21:51:15,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-14 21:51:15,539 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:15,540 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-14 21:51:15,543 INFO L423 AbstractCegarLoop]: === Iteration 1 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:15,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:15,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1513948958, now seen corresponding path program 1 times [2019-01-14 21:51:15,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:15,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:15,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:15,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:51:15,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:15,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:51:15,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:51:15,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 21:51:15,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 21:51:15,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 21:51:15,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:51:15,888 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2019-01-14 21:51:16,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:16,040 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-01-14 21:51:16,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 21:51:16,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-01-14 21:51:16,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:16,049 INFO L225 Difference]: With dead ends: 33 [2019-01-14 21:51:16,050 INFO L226 Difference]: Without dead ends: 20 [2019-01-14 21:51:16,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 21:51:16,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-14 21:51:16,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-14 21:51:16,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-14 21:51:16,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-01-14 21:51:16,089 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 6 [2019-01-14 21:51:16,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:16,090 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-01-14 21:51:16,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 21:51:16,090 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-01-14 21:51:16,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-14 21:51:16,090 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:16,091 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:51:16,091 INFO L423 AbstractCegarLoop]: === Iteration 2 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:16,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:16,092 INFO L82 PathProgramCache]: Analyzing trace with hash -312222520, now seen corresponding path program 1 times [2019-01-14 21:51:16,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:16,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:16,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:16,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:51:16,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:16,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:51:16,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:51:16,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 21:51:16,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 21:51:16,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 21:51:16,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:51:16,177 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2019-01-14 21:51:16,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:16,413 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-01-14 21:51:16,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 21:51:16,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-14 21:51:16,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:16,418 INFO L225 Difference]: With dead ends: 39 [2019-01-14 21:51:16,419 INFO L226 Difference]: Without dead ends: 36 [2019-01-14 21:51:16,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 21:51:16,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-14 21:51:16,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2019-01-14 21:51:16,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-14 21:51:16,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-01-14 21:51:16,440 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 7 [2019-01-14 21:51:16,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:16,441 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-01-14 21:51:16,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 21:51:16,441 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-01-14 21:51:16,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 21:51:16,444 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:16,444 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 21:51:16,444 INFO L423 AbstractCegarLoop]: === Iteration 3 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:16,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:16,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1144431293, now seen corresponding path program 1 times [2019-01-14 21:51:16,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:16,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:16,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:16,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:51:16,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:16,615 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:51:16,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:51:16,615 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:51:16,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:51:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:16,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:51:16,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:51:16,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:51:16,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 21:51:16,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 21:51:16,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 21:51:16,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 21:51:16,728 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 7 states. [2019-01-14 21:51:16,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:16,905 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-01-14 21:51:16,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 21:51:16,905 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-14 21:51:16,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:16,907 INFO L225 Difference]: With dead ends: 55 [2019-01-14 21:51:16,907 INFO L226 Difference]: Without dead ends: 54 [2019-01-14 21:51:16,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-14 21:51:16,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-14 21:51:16,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 42. [2019-01-14 21:51:16,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-14 21:51:16,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2019-01-14 21:51:16,920 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 12 [2019-01-14 21:51:16,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:16,921 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-01-14 21:51:16,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 21:51:16,921 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2019-01-14 21:51:16,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 21:51:16,922 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:16,922 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:51:16,923 INFO L423 AbstractCegarLoop]: === Iteration 4 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:16,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:16,923 INFO L82 PathProgramCache]: Analyzing trace with hash -287349001, now seen corresponding path program 1 times [2019-01-14 21:51:16,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:16,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:16,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:16,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:51:16,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:17,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 21:51:17,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:51:17,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 21:51:17,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 21:51:17,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 21:51:17,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 21:51:17,058 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand 4 states. [2019-01-14 21:51:17,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:17,135 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2019-01-14 21:51:17,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 21:51:17,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-01-14 21:51:17,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:17,138 INFO L225 Difference]: With dead ends: 65 [2019-01-14 21:51:17,139 INFO L226 Difference]: Without dead ends: 54 [2019-01-14 21:51:17,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 21:51:17,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-14 21:51:17,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-01-14 21:51:17,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-14 21:51:17,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2019-01-14 21:51:17,151 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 14 [2019-01-14 21:51:17,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:17,152 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2019-01-14 21:51:17,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 21:51:17,153 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2019-01-14 21:51:17,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 21:51:17,154 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:17,154 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1] [2019-01-14 21:51:17,154 INFO L423 AbstractCegarLoop]: === Iteration 5 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:17,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:17,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1656222120, now seen corresponding path program 2 times [2019-01-14 21:51:17,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:17,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:17,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:17,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:51:17,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:17,307 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:51:17,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:51:17,307 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:51:17,317 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:51:17,332 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:51:17,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:51:17,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:51:17,342 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:51:17,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:51:17,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-14 21:51:17,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 21:51:17,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 21:51:17,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-14 21:51:17,364 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 9 states. [2019-01-14 21:51:17,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:17,862 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2019-01-14 21:51:17,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 21:51:17,865 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-01-14 21:51:17,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:17,866 INFO L225 Difference]: With dead ends: 86 [2019-01-14 21:51:17,867 INFO L226 Difference]: Without dead ends: 85 [2019-01-14 21:51:17,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-01-14 21:51:17,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-14 21:51:17,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2019-01-14 21:51:17,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-14 21:51:17,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2019-01-14 21:51:17,880 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 17 [2019-01-14 21:51:17,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:17,880 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2019-01-14 21:51:17,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 21:51:17,881 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2019-01-14 21:51:17,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 21:51:17,882 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:17,882 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1] [2019-01-14 21:51:17,882 INFO L423 AbstractCegarLoop]: === Iteration 6 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:17,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:17,883 INFO L82 PathProgramCache]: Analyzing trace with hash 438260835, now seen corresponding path program 3 times [2019-01-14 21:51:17,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:17,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:17,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:17,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:51:17,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:18,037 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:51:18,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:51:18,038 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:51:18,047 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:51:18,062 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 21:51:18,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:51:18,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:51:18,077 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:51:18,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:51:18,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-14 21:51:18,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 21:51:18,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 21:51:18,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-01-14 21:51:18,104 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand 11 states. [2019-01-14 21:51:18,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:18,715 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2019-01-14 21:51:18,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 21:51:18,719 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-01-14 21:51:18,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:18,721 INFO L225 Difference]: With dead ends: 109 [2019-01-14 21:51:18,721 INFO L226 Difference]: Without dead ends: 108 [2019-01-14 21:51:18,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-01-14 21:51:18,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-14 21:51:18,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 92. [2019-01-14 21:51:18,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-14 21:51:18,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 112 transitions. [2019-01-14 21:51:18,736 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 112 transitions. Word has length 22 [2019-01-14 21:51:18,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:18,736 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 112 transitions. [2019-01-14 21:51:18,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 21:51:18,737 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 112 transitions. [2019-01-14 21:51:18,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 21:51:18,738 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:18,738 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1] [2019-01-14 21:51:18,738 INFO L423 AbstractCegarLoop]: === Iteration 7 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:18,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:18,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1696558728, now seen corresponding path program 4 times [2019-01-14 21:51:18,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:18,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:18,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:18,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:51:18,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:18,953 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:51:18,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:51:18,953 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:51:18,970 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 21:51:19,008 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 21:51:19,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:51:19,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:51:19,023 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:51:19,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:51:19,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-01-14 21:51:19,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 21:51:19,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 21:51:19,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-01-14 21:51:19,048 INFO L87 Difference]: Start difference. First operand 92 states and 112 transitions. Second operand 13 states. [2019-01-14 21:51:19,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:19,356 INFO L93 Difference]: Finished difference Result 132 states and 137 transitions. [2019-01-14 21:51:19,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-14 21:51:19,357 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2019-01-14 21:51:19,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:19,363 INFO L225 Difference]: With dead ends: 132 [2019-01-14 21:51:19,363 INFO L226 Difference]: Without dead ends: 131 [2019-01-14 21:51:19,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2019-01-14 21:51:19,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-14 21:51:19,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 111. [2019-01-14 21:51:19,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-14 21:51:19,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 136 transitions. [2019-01-14 21:51:19,393 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 136 transitions. Word has length 27 [2019-01-14 21:51:19,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:19,393 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 136 transitions. [2019-01-14 21:51:19,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 21:51:19,395 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 136 transitions. [2019-01-14 21:51:19,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 21:51:19,396 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:19,396 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:51:19,396 INFO L423 AbstractCegarLoop]: === Iteration 8 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:19,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:19,400 INFO L82 PathProgramCache]: Analyzing trace with hash -563967927, now seen corresponding path program 1 times [2019-01-14 21:51:19,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:19,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:19,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:19,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:51:19,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:19,546 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 21:51:19,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:51:19,546 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:51:19,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:51:19,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:19,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:51:19,691 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 21:51:19,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:51:19,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-01-14 21:51:19,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 21:51:19,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 21:51:19,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-14 21:51:19,712 INFO L87 Difference]: Start difference. First operand 111 states and 136 transitions. Second operand 8 states. [2019-01-14 21:51:19,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:19,785 INFO L93 Difference]: Finished difference Result 153 states and 200 transitions. [2019-01-14 21:51:19,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 21:51:19,786 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-01-14 21:51:19,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:19,789 INFO L225 Difference]: With dead ends: 153 [2019-01-14 21:51:19,789 INFO L226 Difference]: Without dead ends: 151 [2019-01-14 21:51:19,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-14 21:51:19,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-01-14 21:51:19,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 145. [2019-01-14 21:51:19,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-01-14 21:51:19,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 177 transitions. [2019-01-14 21:51:19,805 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 177 transitions. Word has length 26 [2019-01-14 21:51:19,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:19,806 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 177 transitions. [2019-01-14 21:51:19,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 21:51:19,806 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 177 transitions. [2019-01-14 21:51:19,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 21:51:19,807 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:19,807 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:51:19,809 INFO L423 AbstractCegarLoop]: === Iteration 9 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:19,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:19,809 INFO L82 PathProgramCache]: Analyzing trace with hash -303136509, now seen corresponding path program 1 times [2019-01-14 21:51:19,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:19,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:19,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:19,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:51:19,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:19,877 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 21:51:19,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:51:19,878 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:51:19,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:51:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:19,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:51:19,968 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 21:51:19,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 21:51:19,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2019-01-14 21:51:19,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 21:51:19,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 21:51:19,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-14 21:51:19,998 INFO L87 Difference]: Start difference. First operand 145 states and 177 transitions. Second operand 8 states. [2019-01-14 21:51:20,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:20,060 INFO L93 Difference]: Finished difference Result 145 states and 177 transitions. [2019-01-14 21:51:20,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 21:51:20,061 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-01-14 21:51:20,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:20,063 INFO L225 Difference]: With dead ends: 145 [2019-01-14 21:51:20,063 INFO L226 Difference]: Without dead ends: 129 [2019-01-14 21:51:20,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-14 21:51:20,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-14 21:51:20,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-01-14 21:51:20,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-14 21:51:20,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 144 transitions. [2019-01-14 21:51:20,078 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 144 transitions. Word has length 27 [2019-01-14 21:51:20,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:20,079 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 144 transitions. [2019-01-14 21:51:20,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 21:51:20,079 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 144 transitions. [2019-01-14 21:51:20,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-14 21:51:20,082 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:20,082 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1] [2019-01-14 21:51:20,082 INFO L423 AbstractCegarLoop]: === Iteration 10 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:20,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:20,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1757224061, now seen corresponding path program 5 times [2019-01-14 21:51:20,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:20,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:20,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:20,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:51:20,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:20,292 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:51:20,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:51:20,293 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:51:20,303 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 21:51:20,316 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-14 21:51:20,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:51:20,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:51:20,331 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:51:20,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:51:20,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-01-14 21:51:20,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-14 21:51:20,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-14 21:51:20,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-01-14 21:51:20,355 INFO L87 Difference]: Start difference. First operand 129 states and 144 transitions. Second operand 15 states. [2019-01-14 21:51:20,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:20,722 INFO L93 Difference]: Finished difference Result 167 states and 173 transitions. [2019-01-14 21:51:20,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-14 21:51:20,724 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2019-01-14 21:51:20,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:20,730 INFO L225 Difference]: With dead ends: 167 [2019-01-14 21:51:20,730 INFO L226 Difference]: Without dead ends: 166 [2019-01-14 21:51:20,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2019-01-14 21:51:20,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-14 21:51:20,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 154. [2019-01-14 21:51:20,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-01-14 21:51:20,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 172 transitions. [2019-01-14 21:51:20,746 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 172 transitions. Word has length 32 [2019-01-14 21:51:20,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:20,746 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 172 transitions. [2019-01-14 21:51:20,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-14 21:51:20,747 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 172 transitions. [2019-01-14 21:51:20,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-14 21:51:20,749 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:20,750 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1] [2019-01-14 21:51:20,751 INFO L423 AbstractCegarLoop]: === Iteration 11 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:20,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:20,751 INFO L82 PathProgramCache]: Analyzing trace with hash -512208024, now seen corresponding path program 6 times [2019-01-14 21:51:20,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:20,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:20,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:20,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:51:20,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:21,247 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:51:21,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:51:21,247 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:51:21,257 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 21:51:21,298 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-14 21:51:21,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:51:21,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:51:21,348 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-14 21:51:21,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:51:21,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 17 [2019-01-14 21:51:21,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-14 21:51:21,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-14 21:51:21,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-01-14 21:51:21,372 INFO L87 Difference]: Start difference. First operand 154 states and 172 transitions. Second operand 18 states. [2019-01-14 21:51:21,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:21,443 INFO L93 Difference]: Finished difference Result 154 states and 172 transitions. [2019-01-14 21:51:21,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 21:51:21,448 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2019-01-14 21:51:21,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:21,452 INFO L225 Difference]: With dead ends: 154 [2019-01-14 21:51:21,452 INFO L226 Difference]: Without dead ends: 153 [2019-01-14 21:51:21,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-01-14 21:51:21,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-01-14 21:51:21,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-01-14 21:51:21,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-01-14 21:51:21,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 171 transitions. [2019-01-14 21:51:21,465 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 171 transitions. Word has length 37 [2019-01-14 21:51:21,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:21,465 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 171 transitions. [2019-01-14 21:51:21,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-14 21:51:21,467 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 171 transitions. [2019-01-14 21:51:21,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-14 21:51:21,475 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:21,475 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-14 21:51:21,476 INFO L423 AbstractCegarLoop]: === Iteration 12 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:21,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:21,476 INFO L82 PathProgramCache]: Analyzing trace with hash 867149367, now seen corresponding path program 2 times [2019-01-14 21:51:21,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:21,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:21,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:21,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:51:21,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:21,579 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-14 21:51:21,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:51:21,579 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:51:21,597 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:51:21,609 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:51:21,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:51:21,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:51:21,671 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-14 21:51:21,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:51:21,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-01-14 21:51:21,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 21:51:21,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 21:51:21,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-14 21:51:21,693 INFO L87 Difference]: Start difference. First operand 153 states and 171 transitions. Second operand 10 states. [2019-01-14 21:51:21,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:21,777 INFO L93 Difference]: Finished difference Result 207 states and 237 transitions. [2019-01-14 21:51:21,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 21:51:21,778 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2019-01-14 21:51:21,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:21,780 INFO L225 Difference]: With dead ends: 207 [2019-01-14 21:51:21,781 INFO L226 Difference]: Without dead ends: 185 [2019-01-14 21:51:21,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-14 21:51:21,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-01-14 21:51:21,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 179. [2019-01-14 21:51:21,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-01-14 21:51:21,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 197 transitions. [2019-01-14 21:51:21,793 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 197 transitions. Word has length 38 [2019-01-14 21:51:21,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:21,793 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 197 transitions. [2019-01-14 21:51:21,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 21:51:21,794 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 197 transitions. [2019-01-14 21:51:21,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-14 21:51:21,796 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:21,797 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2019-01-14 21:51:21,797 INFO L423 AbstractCegarLoop]: === Iteration 13 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:21,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:21,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1066180599, now seen corresponding path program 3 times [2019-01-14 21:51:21,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:21,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:21,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:21,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:51:21,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:21,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:21,890 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-01-14 21:51:21,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:51:21,890 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:51:21,902 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:51:21,918 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 21:51:21,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:51:21,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:51:22,009 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-01-14 21:51:22,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:51:22,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-01-14 21:51:22,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 21:51:22,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 21:51:22,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-01-14 21:51:22,029 INFO L87 Difference]: Start difference. First operand 179 states and 197 transitions. Second operand 12 states. [2019-01-14 21:51:22,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:22,137 INFO L93 Difference]: Finished difference Result 233 states and 263 transitions. [2019-01-14 21:51:22,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 21:51:22,138 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2019-01-14 21:51:22,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:22,139 INFO L225 Difference]: With dead ends: 233 [2019-01-14 21:51:22,139 INFO L226 Difference]: Without dead ends: 204 [2019-01-14 21:51:22,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-01-14 21:51:22,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-01-14 21:51:22,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 198. [2019-01-14 21:51:22,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-01-14 21:51:22,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 216 transitions. [2019-01-14 21:51:22,152 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 216 transitions. Word has length 50 [2019-01-14 21:51:22,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:22,152 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 216 transitions. [2019-01-14 21:51:22,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 21:51:22,152 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 216 transitions. [2019-01-14 21:51:22,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-14 21:51:22,155 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:22,155 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2019-01-14 21:51:22,156 INFO L423 AbstractCegarLoop]: === Iteration 14 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:22,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:22,156 INFO L82 PathProgramCache]: Analyzing trace with hash -158018185, now seen corresponding path program 4 times [2019-01-14 21:51:22,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:22,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:22,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:22,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:51:22,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:22,285 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-01-14 21:51:22,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:51:22,286 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:51:22,296 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 21:51:22,337 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 21:51:22,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:51:22,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:51:22,717 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-01-14 21:51:22,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:51:22,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2019-01-14 21:51:22,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-14 21:51:22,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 21:51:22,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-01-14 21:51:22,736 INFO L87 Difference]: Start difference. First operand 198 states and 216 transitions. Second operand 14 states. [2019-01-14 21:51:22,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:22,857 INFO L93 Difference]: Finished difference Result 252 states and 282 transitions. [2019-01-14 21:51:22,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 21:51:22,860 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2019-01-14 21:51:22,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:22,862 INFO L225 Difference]: With dead ends: 252 [2019-01-14 21:51:22,862 INFO L226 Difference]: Without dead ends: 216 [2019-01-14 21:51:22,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-01-14 21:51:22,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-01-14 21:51:22,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 210. [2019-01-14 21:51:22,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-14 21:51:22,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 228 transitions. [2019-01-14 21:51:22,874 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 228 transitions. Word has length 62 [2019-01-14 21:51:22,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:22,875 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 228 transitions. [2019-01-14 21:51:22,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-14 21:51:22,875 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 228 transitions. [2019-01-14 21:51:22,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-14 21:51:22,877 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:22,878 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2019-01-14 21:51:22,878 INFO L423 AbstractCegarLoop]: === Iteration 15 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:22,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:22,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1955313719, now seen corresponding path program 5 times [2019-01-14 21:51:22,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:22,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:22,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:22,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:51:22,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:23,594 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-01-14 21:51:23,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:51:23,595 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:51:23,604 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 21:51:23,674 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-01-14 21:51:23,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:51:23,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:51:24,000 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-01-14 21:51:24,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:51:24,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2019-01-14 21:51:24,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-14 21:51:24,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-14 21:51:24,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-01-14 21:51:24,020 INFO L87 Difference]: Start difference. First operand 210 states and 228 transitions. Second operand 16 states. [2019-01-14 21:51:24,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:24,115 INFO L93 Difference]: Finished difference Result 264 states and 294 transitions. [2019-01-14 21:51:24,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 21:51:24,116 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 74 [2019-01-14 21:51:24,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:24,118 INFO L225 Difference]: With dead ends: 264 [2019-01-14 21:51:24,118 INFO L226 Difference]: Without dead ends: 223 [2019-01-14 21:51:24,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 67 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-01-14 21:51:24,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-01-14 21:51:24,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 217. [2019-01-14 21:51:24,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-14 21:51:24,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 235 transitions. [2019-01-14 21:51:24,132 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 235 transitions. Word has length 74 [2019-01-14 21:51:24,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:24,132 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 235 transitions. [2019-01-14 21:51:24,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-14 21:51:24,132 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 235 transitions. [2019-01-14 21:51:24,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-14 21:51:24,135 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:24,135 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2019-01-14 21:51:24,136 INFO L423 AbstractCegarLoop]: === Iteration 16 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:24,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:24,137 INFO L82 PathProgramCache]: Analyzing trace with hash -330632009, now seen corresponding path program 6 times [2019-01-14 21:51:24,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:24,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:24,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:24,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:51:24,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:24,329 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-01-14 21:51:24,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:51:24,329 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:51:24,342 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 21:51:24,367 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-01-14 21:51:24,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:51:24,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:51:24,520 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-01-14 21:51:24,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:51:24,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2019-01-14 21:51:24,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-14 21:51:24,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-14 21:51:24,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-01-14 21:51:24,539 INFO L87 Difference]: Start difference. First operand 217 states and 235 transitions. Second operand 18 states. [2019-01-14 21:51:24,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:24,689 INFO L93 Difference]: Finished difference Result 271 states and 301 transitions. [2019-01-14 21:51:24,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-14 21:51:24,691 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 86 [2019-01-14 21:51:24,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:24,693 INFO L225 Difference]: With dead ends: 271 [2019-01-14 21:51:24,693 INFO L226 Difference]: Without dead ends: 230 [2019-01-14 21:51:24,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 78 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-01-14 21:51:24,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-01-14 21:51:24,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 224. [2019-01-14 21:51:24,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-01-14 21:51:24,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 242 transitions. [2019-01-14 21:51:24,709 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 242 transitions. Word has length 86 [2019-01-14 21:51:24,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:24,710 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 242 transitions. [2019-01-14 21:51:24,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-14 21:51:24,710 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 242 transitions. [2019-01-14 21:51:24,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-14 21:51:24,713 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:24,713 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2019-01-14 21:51:24,713 INFO L423 AbstractCegarLoop]: === Iteration 17 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:24,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:24,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1775681655, now seen corresponding path program 7 times [2019-01-14 21:51:24,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:24,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:24,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:24,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:51:24,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:24,939 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-01-14 21:51:24,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:51:24,939 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:51:24,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:51:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:24,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:51:25,196 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-01-14 21:51:25,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:51:25,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2019-01-14 21:51:25,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-14 21:51:25,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-14 21:51:25,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-01-14 21:51:25,216 INFO L87 Difference]: Start difference. First operand 224 states and 242 transitions. Second operand 20 states. [2019-01-14 21:51:25,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:25,414 INFO L93 Difference]: Finished difference Result 278 states and 308 transitions. [2019-01-14 21:51:25,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-14 21:51:25,415 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 98 [2019-01-14 21:51:25,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:25,417 INFO L225 Difference]: With dead ends: 278 [2019-01-14 21:51:25,417 INFO L226 Difference]: Without dead ends: 237 [2019-01-14 21:51:25,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 89 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-01-14 21:51:25,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-01-14 21:51:25,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 231. [2019-01-14 21:51:25,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-14 21:51:25,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 249 transitions. [2019-01-14 21:51:25,429 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 249 transitions. Word has length 98 [2019-01-14 21:51:25,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:25,429 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 249 transitions. [2019-01-14 21:51:25,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-14 21:51:25,429 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 249 transitions. [2019-01-14 21:51:25,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-01-14 21:51:25,433 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:25,433 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2019-01-14 21:51:25,434 INFO L423 AbstractCegarLoop]: === Iteration 18 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:25,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:25,434 INFO L82 PathProgramCache]: Analyzing trace with hash 73375164, now seen corresponding path program 8 times [2019-01-14 21:51:25,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:25,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:25,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:25,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:51:25,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:25,689 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2019-01-14 21:51:25,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:51:25,690 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:51:25,702 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:51:25,744 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:51:25,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:51:25,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:51:25,927 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2019-01-14 21:51:25,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:51:25,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2019-01-14 21:51:25,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-14 21:51:25,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-14 21:51:25,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-01-14 21:51:25,947 INFO L87 Difference]: Start difference. First operand 231 states and 249 transitions. Second operand 22 states. [2019-01-14 21:51:26,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:26,451 INFO L93 Difference]: Finished difference Result 285 states and 315 transitions. [2019-01-14 21:51:26,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-14 21:51:26,452 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 145 [2019-01-14 21:51:26,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:26,454 INFO L225 Difference]: With dead ends: 285 [2019-01-14 21:51:26,454 INFO L226 Difference]: Without dead ends: 244 [2019-01-14 21:51:26,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 135 SyntacticMatches, 8 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-01-14 21:51:26,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-01-14 21:51:26,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 238. [2019-01-14 21:51:26,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-01-14 21:51:26,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 256 transitions. [2019-01-14 21:51:26,466 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 256 transitions. Word has length 145 [2019-01-14 21:51:26,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:26,468 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 256 transitions. [2019-01-14 21:51:26,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-14 21:51:26,468 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 256 transitions. [2019-01-14 21:51:26,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-01-14 21:51:26,471 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:26,471 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2019-01-14 21:51:26,472 INFO L423 AbstractCegarLoop]: === Iteration 19 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:26,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:26,472 INFO L82 PathProgramCache]: Analyzing trace with hash -329358962, now seen corresponding path program 9 times [2019-01-14 21:51:26,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:26,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:26,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:26,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:51:26,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:27,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1002 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2019-01-14 21:51:27,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:51:27,250 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:51:27,261 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:51:27,363 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-14 21:51:27,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:51:27,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:51:27,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1002 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2019-01-14 21:51:27,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:51:27,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2019-01-14 21:51:27,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-14 21:51:27,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-14 21:51:27,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-01-14 21:51:27,629 INFO L87 Difference]: Start difference. First operand 238 states and 256 transitions. Second operand 24 states. [2019-01-14 21:51:27,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:27,783 INFO L93 Difference]: Finished difference Result 292 states and 322 transitions. [2019-01-14 21:51:27,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-14 21:51:27,785 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 157 [2019-01-14 21:51:27,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:27,787 INFO L225 Difference]: With dead ends: 292 [2019-01-14 21:51:27,788 INFO L226 Difference]: Without dead ends: 251 [2019-01-14 21:51:27,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 146 SyntacticMatches, 9 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-01-14 21:51:27,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-01-14 21:51:27,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 245. [2019-01-14 21:51:27,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-01-14 21:51:27,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 263 transitions. [2019-01-14 21:51:27,804 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 263 transitions. Word has length 157 [2019-01-14 21:51:27,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:27,804 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 263 transitions. [2019-01-14 21:51:27,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-14 21:51:27,804 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 263 transitions. [2019-01-14 21:51:27,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-01-14 21:51:27,809 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:27,809 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2019-01-14 21:51:27,810 INFO L423 AbstractCegarLoop]: === Iteration 20 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:27,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:27,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1310449148, now seen corresponding path program 10 times [2019-01-14 21:51:27,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:27,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:27,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:27,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:51:27,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:28,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 355 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2019-01-14 21:51:28,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:51:28,366 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:51:28,377 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 21:51:28,420 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 21:51:28,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:51:28,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:51:28,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 355 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2019-01-14 21:51:28,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:51:28,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2019-01-14 21:51:28,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-14 21:51:28,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-14 21:51:28,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2019-01-14 21:51:28,767 INFO L87 Difference]: Start difference. First operand 245 states and 263 transitions. Second operand 26 states. [2019-01-14 21:51:28,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:28,932 INFO L93 Difference]: Finished difference Result 299 states and 329 transitions. [2019-01-14 21:51:28,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-14 21:51:28,933 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 169 [2019-01-14 21:51:28,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:28,937 INFO L225 Difference]: With dead ends: 299 [2019-01-14 21:51:28,937 INFO L226 Difference]: Without dead ends: 258 [2019-01-14 21:51:28,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 157 SyntacticMatches, 10 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2019-01-14 21:51:28,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-01-14 21:51:28,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 252. [2019-01-14 21:51:28,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-14 21:51:28,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 270 transitions. [2019-01-14 21:51:28,951 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 270 transitions. Word has length 169 [2019-01-14 21:51:28,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:28,951 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 270 transitions. [2019-01-14 21:51:28,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-14 21:51:28,951 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 270 transitions. [2019-01-14 21:51:28,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-01-14 21:51:28,954 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:28,954 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2019-01-14 21:51:28,954 INFO L423 AbstractCegarLoop]: === Iteration 21 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:28,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:28,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1885455794, now seen corresponding path program 11 times [2019-01-14 21:51:28,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:28,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:28,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:28,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:51:28,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:29,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1322 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2019-01-14 21:51:29,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:51:29,341 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:51:29,351 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 21:51:29,422 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2019-01-14 21:51:29,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:51:29,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:51:29,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1322 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2019-01-14 21:51:29,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:51:29,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 27 [2019-01-14 21:51:29,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-14 21:51:29,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-14 21:51:29,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-01-14 21:51:29,700 INFO L87 Difference]: Start difference. First operand 252 states and 270 transitions. Second operand 28 states. [2019-01-14 21:51:29,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:29,922 INFO L93 Difference]: Finished difference Result 306 states and 336 transitions. [2019-01-14 21:51:29,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-14 21:51:29,923 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 181 [2019-01-14 21:51:29,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:29,926 INFO L225 Difference]: With dead ends: 306 [2019-01-14 21:51:29,926 INFO L226 Difference]: Without dead ends: 265 [2019-01-14 21:51:29,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 168 SyntacticMatches, 11 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-01-14 21:51:29,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-01-14 21:51:29,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 259. [2019-01-14 21:51:29,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-01-14 21:51:29,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 277 transitions. [2019-01-14 21:51:29,937 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 277 transitions. Word has length 181 [2019-01-14 21:51:29,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:29,937 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 277 transitions. [2019-01-14 21:51:29,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-14 21:51:29,939 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 277 transitions. [2019-01-14 21:51:29,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-01-14 21:51:29,942 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:29,942 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1] [2019-01-14 21:51:29,943 INFO L423 AbstractCegarLoop]: === Iteration 22 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:29,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:29,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1454043767, now seen corresponding path program 12 times [2019-01-14 21:51:29,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:29,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:29,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:29,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:51:29,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:30,297 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 0 proven. 510 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-01-14 21:51:30,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:51:30,298 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:51:30,310 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 21:51:30,353 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2019-01-14 21:51:30,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:51:30,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:51:30,681 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 0 proven. 510 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-01-14 21:51:30,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:51:30,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2019-01-14 21:51:30,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-14 21:51:30,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-14 21:51:30,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2019-01-14 21:51:30,702 INFO L87 Difference]: Start difference. First operand 259 states and 277 transitions. Second operand 30 states. [2019-01-14 21:51:30,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:30,929 INFO L93 Difference]: Finished difference Result 313 states and 343 transitions. [2019-01-14 21:51:30,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-14 21:51:30,932 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 158 [2019-01-14 21:51:30,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:30,934 INFO L225 Difference]: With dead ends: 313 [2019-01-14 21:51:30,934 INFO L226 Difference]: Without dead ends: 272 [2019-01-14 21:51:30,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 144 SyntacticMatches, 12 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2019-01-14 21:51:30,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-01-14 21:51:30,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 266. [2019-01-14 21:51:30,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-01-14 21:51:30,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 284 transitions. [2019-01-14 21:51:30,946 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 284 transitions. Word has length 158 [2019-01-14 21:51:30,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:30,947 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 284 transitions. [2019-01-14 21:51:30,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-14 21:51:30,947 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 284 transitions. [2019-01-14 21:51:30,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-01-14 21:51:30,951 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:30,951 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1] [2019-01-14 21:51:30,952 INFO L423 AbstractCegarLoop]: === Iteration 23 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:30,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:30,952 INFO L82 PathProgramCache]: Analyzing trace with hash 350954254, now seen corresponding path program 13 times [2019-01-14 21:51:30,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:30,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:30,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:30,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:51:30,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:31,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1690 backedges. 0 proven. 598 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2019-01-14 21:51:31,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:51:31,393 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:51:31,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:51:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:31,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:51:31,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1690 backedges. 0 proven. 598 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2019-01-14 21:51:31,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:51:31,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 31 [2019-01-14 21:51:31,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-14 21:51:31,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-14 21:51:31,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2019-01-14 21:51:31,808 INFO L87 Difference]: Start difference. First operand 266 states and 284 transitions. Second operand 32 states. [2019-01-14 21:51:32,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:32,366 INFO L93 Difference]: Finished difference Result 320 states and 350 transitions. [2019-01-14 21:51:32,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-14 21:51:32,368 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 205 [2019-01-14 21:51:32,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:32,371 INFO L225 Difference]: With dead ends: 320 [2019-01-14 21:51:32,371 INFO L226 Difference]: Without dead ends: 279 [2019-01-14 21:51:32,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 190 SyntacticMatches, 13 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2019-01-14 21:51:32,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-14 21:51:32,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 273. [2019-01-14 21:51:32,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-01-14 21:51:32,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 291 transitions. [2019-01-14 21:51:32,391 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 291 transitions. Word has length 205 [2019-01-14 21:51:32,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:32,392 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 291 transitions. [2019-01-14 21:51:32,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-14 21:51:32,392 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 291 transitions. [2019-01-14 21:51:32,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-01-14 21:51:32,398 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:32,398 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1] [2019-01-14 21:51:32,398 INFO L423 AbstractCegarLoop]: === Iteration 24 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:32,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:32,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1929171383, now seen corresponding path program 14 times [2019-01-14 21:51:32,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:32,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:32,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:32,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:51:32,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:33,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 0 proven. 693 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2019-01-14 21:51:33,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:51:33,403 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:51:33,413 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:51:33,452 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:51:33,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:51:33,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:51:33,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 0 proven. 693 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2019-01-14 21:51:33,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:51:33,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 33 [2019-01-14 21:51:33,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-14 21:51:33,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-14 21:51:33,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2019-01-14 21:51:33,806 INFO L87 Difference]: Start difference. First operand 273 states and 291 transitions. Second operand 34 states. [2019-01-14 21:51:34,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:34,925 INFO L93 Difference]: Finished difference Result 327 states and 357 transitions. [2019-01-14 21:51:34,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-14 21:51:34,926 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 182 [2019-01-14 21:51:34,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:34,928 INFO L225 Difference]: With dead ends: 327 [2019-01-14 21:51:34,928 INFO L226 Difference]: Without dead ends: 286 [2019-01-14 21:51:34,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 166 SyntacticMatches, 14 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2019-01-14 21:51:34,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-01-14 21:51:34,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 280. [2019-01-14 21:51:34,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-01-14 21:51:34,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 298 transitions. [2019-01-14 21:51:34,939 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 298 transitions. Word has length 182 [2019-01-14 21:51:34,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:34,940 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 298 transitions. [2019-01-14 21:51:34,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-14 21:51:34,942 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 298 transitions. [2019-01-14 21:51:34,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-01-14 21:51:34,944 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:34,944 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1] [2019-01-14 21:51:34,945 INFO L423 AbstractCegarLoop]: === Iteration 25 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:34,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:34,945 INFO L82 PathProgramCache]: Analyzing trace with hash -799687031, now seen corresponding path program 15 times [2019-01-14 21:51:34,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:34,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:34,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:34,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:51:34,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:36,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1427 backedges. 0 proven. 795 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2019-01-14 21:51:36,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:51:36,191 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:51:36,204 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:51:36,251 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-14 21:51:36,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:51:36,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:51:37,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1427 backedges. 0 proven. 795 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2019-01-14 21:51:37,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:51:37,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 35 [2019-01-14 21:51:37,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-14 21:51:37,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-14 21:51:37,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=919, Unknown=0, NotChecked=0, Total=1260 [2019-01-14 21:51:37,313 INFO L87 Difference]: Start difference. First operand 280 states and 298 transitions. Second operand 36 states. [2019-01-14 21:51:37,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:37,559 INFO L93 Difference]: Finished difference Result 334 states and 364 transitions. [2019-01-14 21:51:37,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-14 21:51:37,561 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 194 [2019-01-14 21:51:37,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:37,564 INFO L225 Difference]: With dead ends: 334 [2019-01-14 21:51:37,564 INFO L226 Difference]: Without dead ends: 293 [2019-01-14 21:51:37,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 177 SyntacticMatches, 15 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=341, Invalid=919, Unknown=0, NotChecked=0, Total=1260 [2019-01-14 21:51:37,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-01-14 21:51:37,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 287. [2019-01-14 21:51:37,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-01-14 21:51:37,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 305 transitions. [2019-01-14 21:51:37,580 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 305 transitions. Word has length 194 [2019-01-14 21:51:37,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:37,580 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 305 transitions. [2019-01-14 21:51:37,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-14 21:51:37,580 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 305 transitions. [2019-01-14 21:51:37,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-01-14 21:51:37,584 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:37,584 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1] [2019-01-14 21:51:37,584 INFO L423 AbstractCegarLoop]: === Iteration 26 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:37,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:37,584 INFO L82 PathProgramCache]: Analyzing trace with hash 315334903, now seen corresponding path program 16 times [2019-01-14 21:51:37,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:37,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:37,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:37,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:51:37,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:38,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 0 proven. 904 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2019-01-14 21:51:38,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:51:38,092 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:51:38,103 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 21:51:38,148 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 21:51:38,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:51:38,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:51:38,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 0 proven. 904 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2019-01-14 21:51:38,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:51:38,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 37 [2019-01-14 21:51:38,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-14 21:51:38,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-14 21:51:38,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2019-01-14 21:51:38,646 INFO L87 Difference]: Start difference. First operand 287 states and 305 transitions. Second operand 38 states. [2019-01-14 21:51:38,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:38,857 INFO L93 Difference]: Finished difference Result 341 states and 371 transitions. [2019-01-14 21:51:38,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-14 21:51:38,858 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 206 [2019-01-14 21:51:38,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:38,861 INFO L225 Difference]: With dead ends: 341 [2019-01-14 21:51:38,861 INFO L226 Difference]: Without dead ends: 300 [2019-01-14 21:51:38,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 188 SyntacticMatches, 16 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2019-01-14 21:51:38,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-01-14 21:51:38,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 294. [2019-01-14 21:51:38,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-01-14 21:51:38,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 312 transitions. [2019-01-14 21:51:38,870 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 312 transitions. Word has length 206 [2019-01-14 21:51:38,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:38,870 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 312 transitions. [2019-01-14 21:51:38,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-14 21:51:38,870 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 312 transitions. [2019-01-14 21:51:38,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-01-14 21:51:38,875 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:38,875 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1] [2019-01-14 21:51:38,875 INFO L423 AbstractCegarLoop]: === Iteration 27 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:38,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:38,876 INFO L82 PathProgramCache]: Analyzing trace with hash -843307890, now seen corresponding path program 17 times [2019-01-14 21:51:38,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:38,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:38,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:38,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:51:38,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:39,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2570 backedges. 0 proven. 1020 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2019-01-14 21:51:39,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:51:39,450 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:51:39,459 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 21:51:39,538 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2019-01-14 21:51:39,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:51:39,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:51:40,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2570 backedges. 0 proven. 1020 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2019-01-14 21:51:40,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:51:40,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 39 [2019-01-14 21:51:40,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-14 21:51:40,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-14 21:51:40,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1141, Unknown=0, NotChecked=0, Total=1560 [2019-01-14 21:51:40,040 INFO L87 Difference]: Start difference. First operand 294 states and 312 transitions. Second operand 40 states. [2019-01-14 21:51:40,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:40,453 INFO L93 Difference]: Finished difference Result 348 states and 378 transitions. [2019-01-14 21:51:40,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-14 21:51:40,454 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 253 [2019-01-14 21:51:40,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:40,457 INFO L225 Difference]: With dead ends: 348 [2019-01-14 21:51:40,457 INFO L226 Difference]: Without dead ends: 307 [2019-01-14 21:51:40,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 234 SyntacticMatches, 17 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=419, Invalid=1141, Unknown=0, NotChecked=0, Total=1560 [2019-01-14 21:51:40,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-01-14 21:51:40,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 301. [2019-01-14 21:51:40,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-01-14 21:51:40,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 319 transitions. [2019-01-14 21:51:40,471 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 319 transitions. Word has length 253 [2019-01-14 21:51:40,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:40,472 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 319 transitions. [2019-01-14 21:51:40,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-14 21:51:40,474 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 319 transitions. [2019-01-14 21:51:40,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-01-14 21:51:40,477 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:40,477 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1] [2019-01-14 21:51:40,477 INFO L423 AbstractCegarLoop]: === Iteration 28 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:40,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:40,478 INFO L82 PathProgramCache]: Analyzing trace with hash 349397047, now seen corresponding path program 18 times [2019-01-14 21:51:40,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:40,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:40,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:40,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:51:40,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:41,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2036 backedges. 0 proven. 1143 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2019-01-14 21:51:41,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:51:41,335 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:51:41,346 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 21:51:41,634 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2019-01-14 21:51:41,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:51:41,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:51:42,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2036 backedges. 0 proven. 1143 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2019-01-14 21:51:42,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:51:42,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 41 [2019-01-14 21:51:42,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-14 21:51:42,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-14 21:51:42,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1261, Unknown=0, NotChecked=0, Total=1722 [2019-01-14 21:51:42,440 INFO L87 Difference]: Start difference. First operand 301 states and 319 transitions. Second operand 42 states. [2019-01-14 21:51:42,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:42,820 INFO L93 Difference]: Finished difference Result 355 states and 385 transitions. [2019-01-14 21:51:42,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-14 21:51:42,828 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 230 [2019-01-14 21:51:42,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:42,830 INFO L225 Difference]: With dead ends: 355 [2019-01-14 21:51:42,830 INFO L226 Difference]: Without dead ends: 314 [2019-01-14 21:51:42,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 210 SyntacticMatches, 18 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 977 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=461, Invalid=1261, Unknown=0, NotChecked=0, Total=1722 [2019-01-14 21:51:42,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-01-14 21:51:42,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 308. [2019-01-14 21:51:42,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-01-14 21:51:42,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 326 transitions. [2019-01-14 21:51:42,844 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 326 transitions. Word has length 230 [2019-01-14 21:51:42,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:42,844 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 326 transitions. [2019-01-14 21:51:42,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-14 21:51:42,844 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 326 transitions. [2019-01-14 21:51:42,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-01-14 21:51:42,848 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:42,848 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1] [2019-01-14 21:51:42,849 INFO L423 AbstractCegarLoop]: === Iteration 29 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:42,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:42,849 INFO L82 PathProgramCache]: Analyzing trace with hash 420240905, now seen corresponding path program 19 times [2019-01-14 21:51:42,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:42,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:42,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:42,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:51:42,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:43,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2263 backedges. 0 proven. 1273 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-14 21:51:43,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:51:43,770 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:51:43,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:51:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:43,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:51:44,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2263 backedges. 0 proven. 1273 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-14 21:51:44,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:51:44,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 43 [2019-01-14 21:51:44,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-14 21:51:44,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-14 21:51:44,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2019-01-14 21:51:44,414 INFO L87 Difference]: Start difference. First operand 308 states and 326 transitions. Second operand 44 states. [2019-01-14 21:51:44,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:44,780 INFO L93 Difference]: Finished difference Result 362 states and 392 transitions. [2019-01-14 21:51:44,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-14 21:51:44,781 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 242 [2019-01-14 21:51:44,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:44,784 INFO L225 Difference]: With dead ends: 362 [2019-01-14 21:51:44,785 INFO L226 Difference]: Without dead ends: 321 [2019-01-14 21:51:44,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 221 SyntacticMatches, 19 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2019-01-14 21:51:44,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-01-14 21:51:44,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 315. [2019-01-14 21:51:44,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-01-14 21:51:44,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 333 transitions. [2019-01-14 21:51:44,796 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 333 transitions. Word has length 242 [2019-01-14 21:51:44,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:44,798 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 333 transitions. [2019-01-14 21:51:44,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-14 21:51:44,798 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 333 transitions. [2019-01-14 21:51:44,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-01-14 21:51:44,801 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:44,802 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 21, 21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1] [2019-01-14 21:51:44,802 INFO L423 AbstractCegarLoop]: === Iteration 30 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:44,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:44,802 INFO L82 PathProgramCache]: Analyzing trace with hash -2063192260, now seen corresponding path program 20 times [2019-01-14 21:51:44,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:44,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:44,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:44,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:51:44,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:45,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3356 backedges. 0 proven. 1410 refuted. 0 times theorem prover too weak. 1946 trivial. 0 not checked. [2019-01-14 21:51:45,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:51:45,674 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:51:45,687 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:51:45,766 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:51:45,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:51:45,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:51:46,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3356 backedges. 0 proven. 1410 refuted. 0 times theorem prover too weak. 1946 trivial. 0 not checked. [2019-01-14 21:51:46,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:51:46,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 45 [2019-01-14 21:51:46,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-14 21:51:46,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-14 21:51:46,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2019-01-14 21:51:46,372 INFO L87 Difference]: Start difference. First operand 315 states and 333 transitions. Second operand 46 states. [2019-01-14 21:51:46,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:46,705 INFO L93 Difference]: Finished difference Result 369 states and 399 transitions. [2019-01-14 21:51:46,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-14 21:51:46,706 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 289 [2019-01-14 21:51:46,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:46,708 INFO L225 Difference]: With dead ends: 369 [2019-01-14 21:51:46,708 INFO L226 Difference]: Without dead ends: 328 [2019-01-14 21:51:46,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 267 SyntacticMatches, 20 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1186 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2019-01-14 21:51:46,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-01-14 21:51:46,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 322. [2019-01-14 21:51:46,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-01-14 21:51:46,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 340 transitions. [2019-01-14 21:51:46,718 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 340 transitions. Word has length 289 [2019-01-14 21:51:46,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:46,720 INFO L480 AbstractCegarLoop]: Abstraction has 322 states and 340 transitions. [2019-01-14 21:51:46,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-14 21:51:46,720 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 340 transitions. [2019-01-14 21:51:46,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-01-14 21:51:46,724 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:46,724 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 22, 22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1] [2019-01-14 21:51:46,724 INFO L423 AbstractCegarLoop]: === Iteration 31 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:46,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:46,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1626433038, now seen corresponding path program 21 times [2019-01-14 21:51:46,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:46,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:46,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:46,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:51:46,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:47,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3642 backedges. 0 proven. 1554 refuted. 0 times theorem prover too weak. 2088 trivial. 0 not checked. [2019-01-14 21:51:47,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:51:47,603 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:51:47,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:51:47,705 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-14 21:51:47,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:51:47,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:51:49,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3642 backedges. 0 proven. 1554 refuted. 0 times theorem prover too weak. 2088 trivial. 0 not checked. [2019-01-14 21:51:49,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:51:49,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 47 [2019-01-14 21:51:49,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-14 21:51:49,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-14 21:51:49,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2019-01-14 21:51:49,658 INFO L87 Difference]: Start difference. First operand 322 states and 340 transitions. Second operand 48 states. [2019-01-14 21:51:50,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:50,078 INFO L93 Difference]: Finished difference Result 376 states and 406 transitions. [2019-01-14 21:51:50,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-14 21:51:50,079 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 301 [2019-01-14 21:51:50,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:50,082 INFO L225 Difference]: With dead ends: 376 [2019-01-14 21:51:50,082 INFO L226 Difference]: Without dead ends: 335 [2019-01-14 21:51:50,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 278 SyntacticMatches, 21 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1298 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2019-01-14 21:51:50,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-01-14 21:51:50,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 329. [2019-01-14 21:51:50,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-01-14 21:51:50,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 347 transitions. [2019-01-14 21:51:50,095 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 347 transitions. Word has length 301 [2019-01-14 21:51:50,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:50,095 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 347 transitions. [2019-01-14 21:51:50,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-14 21:51:50,097 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 347 transitions. [2019-01-14 21:51:50,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-01-14 21:51:50,100 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:50,100 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2019-01-14 21:51:50,100 INFO L423 AbstractCegarLoop]: === Iteration 32 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:50,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:50,103 INFO L82 PathProgramCache]: Analyzing trace with hash 338825084, now seen corresponding path program 22 times [2019-01-14 21:51:50,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:50,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:50,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:50,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:51:50,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:51,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3940 backedges. 0 proven. 1705 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2019-01-14 21:51:51,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:51:51,085 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:51:51,094 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 21:51:51,158 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 21:51:51,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:51:51,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:51:52,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3940 backedges. 0 proven. 1705 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2019-01-14 21:51:52,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:51:52,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 49 [2019-01-14 21:51:52,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-14 21:51:52,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-14 21:51:52,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=1801, Unknown=0, NotChecked=0, Total=2450 [2019-01-14 21:51:52,244 INFO L87 Difference]: Start difference. First operand 329 states and 347 transitions. Second operand 50 states. [2019-01-14 21:51:52,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:52,512 INFO L93 Difference]: Finished difference Result 383 states and 413 transitions. [2019-01-14 21:51:52,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-14 21:51:52,514 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 313 [2019-01-14 21:51:52,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:52,517 INFO L225 Difference]: With dead ends: 383 [2019-01-14 21:51:52,517 INFO L226 Difference]: Without dead ends: 342 [2019-01-14 21:51:52,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 289 SyntacticMatches, 22 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1415 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=649, Invalid=1801, Unknown=0, NotChecked=0, Total=2450 [2019-01-14 21:51:52,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-01-14 21:51:52,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 336. [2019-01-14 21:51:52,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-01-14 21:51:52,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 354 transitions. [2019-01-14 21:51:52,530 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 354 transitions. Word has length 313 [2019-01-14 21:51:52,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:52,531 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 354 transitions. [2019-01-14 21:51:52,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-14 21:51:52,531 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 354 transitions. [2019-01-14 21:51:52,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-01-14 21:51:52,536 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:52,536 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1] [2019-01-14 21:51:52,536 INFO L423 AbstractCegarLoop]: === Iteration 33 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:52,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:52,537 INFO L82 PathProgramCache]: Analyzing trace with hash 117652873, now seen corresponding path program 23 times [2019-01-14 21:51:52,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:52,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:52,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:52,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:51:52,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:52,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:53,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3291 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2019-01-14 21:51:53,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:51:53,843 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:51:53,857 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 21:51:53,932 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2019-01-14 21:51:53,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:51:53,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:51:54,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3291 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2019-01-14 21:51:54,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:51:54,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 51 [2019-01-14 21:51:54,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-14 21:51:54,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-14 21:51:54,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=701, Invalid=1951, Unknown=0, NotChecked=0, Total=2652 [2019-01-14 21:51:54,643 INFO L87 Difference]: Start difference. First operand 336 states and 354 transitions. Second operand 52 states. [2019-01-14 21:51:54,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:54,945 INFO L93 Difference]: Finished difference Result 390 states and 420 transitions. [2019-01-14 21:51:54,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-14 21:51:54,947 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 290 [2019-01-14 21:51:54,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:54,950 INFO L225 Difference]: With dead ends: 390 [2019-01-14 21:51:54,950 INFO L226 Difference]: Without dead ends: 349 [2019-01-14 21:51:54,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 265 SyntacticMatches, 23 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1537 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=701, Invalid=1951, Unknown=0, NotChecked=0, Total=2652 [2019-01-14 21:51:54,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-01-14 21:51:54,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 343. [2019-01-14 21:51:54,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-01-14 21:51:54,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 361 transitions. [2019-01-14 21:51:54,960 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 361 transitions. Word has length 290 [2019-01-14 21:51:54,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:54,960 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 361 transitions. [2019-01-14 21:51:54,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-14 21:51:54,960 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 361 transitions. [2019-01-14 21:51:54,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-01-14 21:51:54,966 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:54,966 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 25, 25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1] [2019-01-14 21:51:54,966 INFO L423 AbstractCegarLoop]: === Iteration 34 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:54,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:54,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1252532292, now seen corresponding path program 24 times [2019-01-14 21:51:54,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:54,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:54,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:54,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:51:54,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:56,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4572 backedges. 0 proven. 2028 refuted. 0 times theorem prover too weak. 2544 trivial. 0 not checked. [2019-01-14 21:51:56,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:51:56,190 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:51:56,200 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 21:51:56,298 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2019-01-14 21:51:56,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:51:56,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:51:57,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4572 backedges. 0 proven. 2028 refuted. 0 times theorem prover too weak. 2544 trivial. 0 not checked. [2019-01-14 21:51:57,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:51:57,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 53 [2019-01-14 21:51:57,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-14 21:51:57,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-14 21:51:57,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2019-01-14 21:51:57,407 INFO L87 Difference]: Start difference. First operand 343 states and 361 transitions. Second operand 54 states. [2019-01-14 21:51:57,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:57,729 INFO L93 Difference]: Finished difference Result 397 states and 427 transitions. [2019-01-14 21:51:57,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-14 21:51:57,730 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 337 [2019-01-14 21:51:57,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:57,733 INFO L225 Difference]: With dead ends: 397 [2019-01-14 21:51:57,733 INFO L226 Difference]: Without dead ends: 356 [2019-01-14 21:51:57,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 311 SyntacticMatches, 24 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1664 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2019-01-14 21:51:57,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-01-14 21:51:57,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 350. [2019-01-14 21:51:57,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-01-14 21:51:57,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 368 transitions. [2019-01-14 21:51:57,744 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 368 transitions. Word has length 337 [2019-01-14 21:51:57,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:57,745 INFO L480 AbstractCegarLoop]: Abstraction has 350 states and 368 transitions. [2019-01-14 21:51:57,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-14 21:51:57,745 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 368 transitions. [2019-01-14 21:51:57,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-01-14 21:51:57,750 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:57,750 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 26, 26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1] [2019-01-14 21:51:57,750 INFO L423 AbstractCegarLoop]: === Iteration 35 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:57,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:57,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1465194610, now seen corresponding path program 25 times [2019-01-14 21:51:57,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:57,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:57,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:57,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:51:57,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:58,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 2200 refuted. 0 times theorem prover too weak. 2706 trivial. 0 not checked. [2019-01-14 21:51:58,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:51:58,764 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:51:58,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:51:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:58,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:52:01,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 2340 proven. 1016 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2019-01-14 21:52:01,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:52:01,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 46] total 98 [2019-01-14 21:52:01,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-14 21:52:01,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-14 21:52:01,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=8282, Unknown=0, NotChecked=0, Total=9506 [2019-01-14 21:52:01,108 INFO L87 Difference]: Start difference. First operand 350 states and 368 transitions. Second operand 98 states. [2019-01-14 21:52:18,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:52:18,803 INFO L93 Difference]: Finished difference Result 599 states and 627 transitions. [2019-01-14 21:52:18,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-01-14 21:52:18,804 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 349 [2019-01-14 21:52:18,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:52:18,808 INFO L225 Difference]: With dead ends: 599 [2019-01-14 21:52:18,808 INFO L226 Difference]: Without dead ends: 359 [2019-01-14 21:52:18,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14185 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=8364, Invalid=49958, Unknown=0, NotChecked=0, Total=58322 [2019-01-14 21:52:18,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-01-14 21:52:18,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 350. [2019-01-14 21:52:18,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-01-14 21:52:18,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 359 transitions. [2019-01-14 21:52:18,824 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 359 transitions. Word has length 349 [2019-01-14 21:52:18,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:52:18,827 INFO L480 AbstractCegarLoop]: Abstraction has 350 states and 359 transitions. [2019-01-14 21:52:18,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-14 21:52:18,827 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 359 transitions. [2019-01-14 21:52:18,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-01-14 21:52:18,831 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:52:18,832 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 27, 27, 27, 26, 26, 26, 26, 1, 1, 1, 1, 1] [2019-01-14 21:52:18,832 INFO L423 AbstractCegarLoop]: === Iteration 36 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:52:18,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:52:18,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1553997372, now seen corresponding path program 26 times [2019-01-14 21:52:18,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:52:18,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:52:18,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:52:18,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:52:18,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:52:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:52:20,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4614 backedges. 0 proven. 2379 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2019-01-14 21:52:20,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:52:20,017 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:52:20,037 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:52:20,122 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:52:20,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:52:20,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:52:20,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4614 backedges. 0 proven. 2379 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2019-01-14 21:52:20,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:52:20,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 57 [2019-01-14 21:52:20,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-14 21:52:20,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-14 21:52:20,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=869, Invalid=2437, Unknown=0, NotChecked=0, Total=3306 [2019-01-14 21:52:20,982 INFO L87 Difference]: Start difference. First operand 350 states and 359 transitions. Second operand 58 states. [2019-01-14 21:52:21,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:52:21,272 INFO L93 Difference]: Finished difference Result 375 states and 387 transitions. [2019-01-14 21:52:21,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-14 21:52:21,274 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 341 [2019-01-14 21:52:21,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:52:21,278 INFO L225 Difference]: With dead ends: 375 [2019-01-14 21:52:21,278 INFO L226 Difference]: Without dead ends: 327 [2019-01-14 21:52:21,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 313 SyntacticMatches, 26 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1933 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=869, Invalid=2437, Unknown=0, NotChecked=0, Total=3306 [2019-01-14 21:52:21,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-01-14 21:52:21,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2019-01-14 21:52:21,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-01-14 21:52:21,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 331 transitions. [2019-01-14 21:52:21,287 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 331 transitions. Word has length 341 [2019-01-14 21:52:21,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:52:21,288 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 331 transitions. [2019-01-14 21:52:21,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-14 21:52:21,288 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 331 transitions. [2019-01-14 21:52:21,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-01-14 21:52:21,290 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:52:21,291 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1] [2019-01-14 21:52:21,291 INFO L423 AbstractCegarLoop]: === Iteration 37 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:52:21,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:52:21,291 INFO L82 PathProgramCache]: Analyzing trace with hash -195404535, now seen corresponding path program 27 times [2019-01-14 21:52:21,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:52:21,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:52:21,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:52:21,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:52:21,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:52:21,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:52:22,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4511 backedges. 0 proven. 2565 refuted. 0 times theorem prover too weak. 1946 trivial. 0 not checked. [2019-01-14 21:52:22,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:52:22,775 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:52:22,795 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:52:22,963 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-14 21:52:22,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:52:22,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:52:24,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4511 backedges. 0 proven. 2565 refuted. 0 times theorem prover too weak. 1946 trivial. 0 not checked. [2019-01-14 21:52:24,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:52:24,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 59 [2019-01-14 21:52:24,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-14 21:52:24,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-14 21:52:24,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=929, Invalid=2611, Unknown=0, NotChecked=0, Total=3540 [2019-01-14 21:52:24,188 INFO L87 Difference]: Start difference. First operand 325 states and 331 transitions. Second operand 60 states. [2019-01-14 21:52:24,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:52:24,521 INFO L93 Difference]: Finished difference Result 342 states and 349 transitions. [2019-01-14 21:52:24,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-14 21:52:24,523 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 338 [2019-01-14 21:52:24,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:52:24,526 INFO L225 Difference]: With dead ends: 342 [2019-01-14 21:52:24,526 INFO L226 Difference]: Without dead ends: 294 [2019-01-14 21:52:24,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 309 SyntacticMatches, 27 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2075 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=929, Invalid=2611, Unknown=0, NotChecked=0, Total=3540 [2019-01-14 21:52:24,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-01-14 21:52:24,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2019-01-14 21:52:24,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-01-14 21:52:24,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 296 transitions. [2019-01-14 21:52:24,536 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 296 transitions. Word has length 338 [2019-01-14 21:52:24,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:52:24,539 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 296 transitions. [2019-01-14 21:52:24,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-14 21:52:24,539 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 296 transitions. [2019-01-14 21:52:24,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-01-14 21:52:24,543 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:52:24,543 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 29, 29, 29, 28, 28, 28, 28, 1, 1, 1, 1, 1] [2019-01-14 21:52:24,544 INFO L423 AbstractCegarLoop]: === Iteration 38 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:52:24,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:52:24,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1815869028, now seen corresponding path program 28 times [2019-01-14 21:52:24,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:52:24,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:52:24,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:52:24,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:52:24,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:52:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:52:25,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4993 backedges. 0 proven. 2758 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2019-01-14 21:52:25,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:52:25,773 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:52:25,782 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 21:52:25,854 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 21:52:25,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:52:25,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:52:26,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4993 backedges. 0 proven. 2758 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2019-01-14 21:52:26,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:52:26,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 61 [2019-01-14 21:52:26,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-14 21:52:26,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-14 21:52:26,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=2791, Unknown=0, NotChecked=0, Total=3782 [2019-01-14 21:52:26,966 INFO L87 Difference]: Start difference. First operand 293 states and 296 transitions. Second operand 62 states. [2019-01-14 21:52:27,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:52:27,588 INFO L93 Difference]: Finished difference Result 302 states and 304 transitions. [2019-01-14 21:52:27,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-14 21:52:27,589 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 355 [2019-01-14 21:52:27,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:52:27,591 INFO L225 Difference]: With dead ends: 302 [2019-01-14 21:52:27,591 INFO L226 Difference]: Without dead ends: 254 [2019-01-14 21:52:27,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 325 SyntacticMatches, 28 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2222 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=991, Invalid=2791, Unknown=0, NotChecked=0, Total=3782 [2019-01-14 21:52:27,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-01-14 21:52:27,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2019-01-14 21:52:27,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-01-14 21:52:27,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2019-01-14 21:52:27,598 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 355 [2019-01-14 21:52:27,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:52:27,599 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2019-01-14 21:52:27,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-14 21:52:27,601 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2019-01-14 21:52:27,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-01-14 21:52:27,603 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:52:27,603 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1] [2019-01-14 21:52:27,604 INFO L423 AbstractCegarLoop]: === Iteration 39 === [hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:52:27,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:52:27,607 INFO L82 PathProgramCache]: Analyzing trace with hash 139723977, now seen corresponding path program 29 times [2019-01-14 21:52:27,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:52:27,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:52:27,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:52:27,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:52:27,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:52:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:52:28,915 INFO L134 CoverageAnalysis]: Checked inductivity of 5193 backedges. 0 proven. 2958 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2019-01-14 21:52:28,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:52:28,916 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:52:28,926 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 21:52:29,043 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2019-01-14 21:52:29,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:52:29,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:52:30,096 INFO L134 CoverageAnalysis]: Checked inductivity of 5193 backedges. 0 proven. 2958 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2019-01-14 21:52:30,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:52:30,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 63 [2019-01-14 21:52:30,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-14 21:52:30,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-14 21:52:30,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=2977, Unknown=0, NotChecked=0, Total=4032 [2019-01-14 21:52:30,117 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand 64 states. [2019-01-14 21:52:30,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:52:30,472 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2019-01-14 21:52:30,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-14 21:52:30,474 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 362 [2019-01-14 21:52:30,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:52:30,475 INFO L225 Difference]: With dead ends: 254 [2019-01-14 21:52:30,475 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 21:52:30,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 331 SyntacticMatches, 29 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2374 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1055, Invalid=2977, Unknown=0, NotChecked=0, Total=4032 [2019-01-14 21:52:30,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 21:52:30,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 21:52:30,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 21:52:30,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 21:52:30,481 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 362 [2019-01-14 21:52:30,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:52:30,481 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 21:52:30,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-14 21:52:30,481 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 21:52:30,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 21:52:30,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 21:52:30,790 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 20 [2019-01-14 21:52:30,792 INFO L448 ceAbstractionStarter]: For program point hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 21:52:30,792 INFO L448 ceAbstractionStarter]: For program point hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 21:52:30,793 INFO L448 ceAbstractionStarter]: For program point hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 21:52:30,793 INFO L448 ceAbstractionStarter]: For program point hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 21:52:30,793 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-01-14 21:52:30,793 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-01-14 21:52:30,793 INFO L444 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (let ((.cse0 (< |hanoi_#in~n| 1))) (and (or (< 30 |hanoi_#in~n|) .cse0 (<= hanoi_~n |hanoi_#in~n|)) (or .cse0 (< 31 |hanoi_#in~n|) (and (<= hanoi_~n 31) (<= 1 hanoi_~n) (not (= 1 hanoi_~n)))))) [2019-01-14 21:52:30,793 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 19) no Hoare annotation was computed. [2019-01-14 21:52:30,794 INFO L448 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-01-14 21:52:30,794 INFO L448 ceAbstractionStarter]: For program point L20-4(line 20) no Hoare annotation was computed. [2019-01-14 21:52:30,794 INFO L448 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2019-01-14 21:52:30,794 INFO L448 ceAbstractionStarter]: For program point L20-6(line 20) no Hoare annotation was computed. [2019-01-14 21:52:30,794 INFO L448 ceAbstractionStarter]: For program point hanoiEXIT(lines 16 21) no Hoare annotation was computed. [2019-01-14 21:52:30,794 INFO L448 ceAbstractionStarter]: For program point hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 21:52:30,794 INFO L448 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2019-01-14 21:52:30,794 INFO L448 ceAbstractionStarter]: For program point hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 21:52:30,794 INFO L451 ceAbstractionStarter]: At program point hanoiENTRY(lines 16 21) the Hoare annotation is: true [2019-01-14 21:52:30,794 INFO L448 ceAbstractionStarter]: For program point hanoiFINAL(lines 16 21) no Hoare annotation was computed. [2019-01-14 21:52:30,795 INFO L448 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-01-14 21:52:30,795 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 21:52:30,795 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 34) no Hoare annotation was computed. [2019-01-14 21:52:30,795 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 21:52:30,795 INFO L444 ceAbstractionStarter]: At program point L29(line 29) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~n~0) (<= ULTIMATE.start_main_~n~0 31)) [2019-01-14 21:52:30,795 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 21:52:30,795 INFO L448 ceAbstractionStarter]: For program point L29-1(line 29) no Hoare annotation was computed. [2019-01-14 21:52:30,795 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2019-01-14 21:52:30,795 INFO L451 ceAbstractionStarter]: At program point L24(lines 24 35) the Hoare annotation is: true [2019-01-14 21:52:30,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 09:52:30 BoogieIcfgContainer [2019-01-14 21:52:30,802 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 21:52:30,802 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 21:52:30,802 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 21:52:30,802 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 21:52:30,803 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:51:15" (3/4) ... [2019-01-14 21:52:30,806 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 21:52:30,813 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure hanoi [2019-01-14 21:52:30,818 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-14 21:52:30,818 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 21:52:30,859 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 21:52:30,859 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 21:52:30,860 INFO L168 Benchmark]: Toolchain (without parser) took 76159.27 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 716.2 MB). Free memory was 947.3 MB in the beginning and 1.6 GB in the end (delta: -655.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. [2019-01-14 21:52:30,863 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:52:30,863 INFO L168 Benchmark]: CACSL2BoogieTranslator took 249.40 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 21:52:30,863 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.73 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:52:30,865 INFO L168 Benchmark]: Boogie Preprocessor took 22.35 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:52:30,866 INFO L168 Benchmark]: RCFGBuilder took 418.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -140.4 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-01-14 21:52:30,866 INFO L168 Benchmark]: TraceAbstraction took 75361.00 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 609.2 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -526.0 MB). Peak memory consumption was 83.3 MB. Max. memory is 11.5 GB. [2019-01-14 21:52:30,869 INFO L168 Benchmark]: Witness Printer took 57.39 ms. Allocated memory is still 1.7 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 35.2 kB). Peak memory consumption was 35.2 kB. Max. memory is 11.5 GB. [2019-01-14 21:52:30,874 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 249.40 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 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 44.73 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.35 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 418.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -140.4 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 75361.00 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 609.2 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -526.0 MB). Peak memory consumption was 83.3 MB. Max. memory is 11.5 GB. * Witness Printer took 57.39 ms. Allocated memory is still 1.7 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 35.2 kB). Peak memory consumption was 35.2 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: 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: 24]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 6 error locations. SAFE Result, 75.2s OverallTime, 39 OverallIterations, 34 TraceHistogramMax, 29.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 636 SDtfs, 3454 SDslu, 11687 SDs, 0 SdLazy, 22756 SolverSat, 976 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7386 GetRequests, 5691 SyntacticMatches, 414 SemanticMatches, 1281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38009 ImplicationChecksByTransitivity, 43.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=350occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 39 MinimizatonAttempts, 234 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 20 PreInvPairs, 22 NumberOfFragments, 42 HoareAnnotationTreeSize, 20 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 323 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 40.0s InterpolantComputationTime, 12437 NumberOfCodeBlocks, 12342 NumberOfCodeBlocksAsserted, 351 NumberOfCheckSat, 12362 ConstructedInterpolants, 0 QuantifiedInterpolants, 6572760 SizeOfPredicates, 62 NumberOfNonLiveVariables, 10560 ConjunctsInSsa, 1048 ConjunctsInUnsatCore, 75 InterpolantComputations, 4 PerfectInterpolantSequences, 65170/124808 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...