./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 2e94e6aa 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-2e94e6a [2019-01-01 20:59:47,002 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 20:59:47,004 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 20:59:47,029 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 20:59:47,029 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 20:59:47,031 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 20:59:47,032 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 20:59:47,034 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 20:59:47,036 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 20:59:47,038 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 20:59:47,039 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 20:59:47,039 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 20:59:47,041 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 20:59:47,043 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 20:59:47,044 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 20:59:47,045 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 20:59:47,047 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 20:59:47,049 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 20:59:47,051 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 20:59:47,053 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 20:59:47,055 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 20:59:47,057 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 20:59:47,060 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 20:59:47,061 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 20:59:47,061 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 20:59:47,063 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 20:59:47,064 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 20:59:47,066 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 20:59:47,066 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 20:59:47,068 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 20:59:47,068 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 20:59:47,069 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 20:59:47,070 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 20:59:47,070 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 20:59:47,071 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 20:59:47,072 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 20:59:47,073 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-01 20:59:47,102 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 20:59:47,102 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 20:59:47,107 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 20:59:47,108 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 20:59:47,108 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 20:59:47,108 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 20:59:47,108 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 20:59:47,108 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 20:59:47,109 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 20:59:47,109 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 20:59:47,109 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 20:59:47,109 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 20:59:47,109 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-01 20:59:47,109 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 20:59:47,110 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 20:59:47,110 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 20:59:47,110 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 20:59:47,110 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 20:59:47,110 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 20:59:47,111 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 20:59:47,111 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 20:59:47,111 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 20:59:47,111 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 20:59:47,111 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 20:59:47,111 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 20:59:47,112 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 20:59:47,112 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 20:59:47,112 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-01 20:59:47,173 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 20:59:47,191 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 20:59:47,196 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 20:59:47,198 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 20:59:47,198 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 20:59:47,199 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-numeric/recHanoi02_true-termination_true-no-overflow.c [2019-01-01 20:59:47,272 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/141c33b51/04d1a0ab5ac843cd8d28d087d9259653/FLAG62f07d466 [2019-01-01 20:59:47,771 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 20:59:47,772 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-numeric/recHanoi02_true-termination_true-no-overflow.c [2019-01-01 20:59:47,780 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/141c33b51/04d1a0ab5ac843cd8d28d087d9259653/FLAG62f07d466 [2019-01-01 20:59:48,129 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/141c33b51/04d1a0ab5ac843cd8d28d087d9259653 [2019-01-01 20:59:48,136 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 20:59:48,139 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 20:59:48,141 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 20:59:48,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 20:59:48,148 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 20:59:48,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:59:48" (1/1) ... [2019-01-01 20:59:48,154 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17ed9335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:59:48, skipping insertion in model container [2019-01-01 20:59:48,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:59:48" (1/1) ... [2019-01-01 20:59:48,167 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 20:59:48,191 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 20:59:48,452 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:59:48,459 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 20:59:48,482 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:59:48,501 INFO L195 MainTranslator]: Completed translation [2019-01-01 20:59:48,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:59:48 WrapperNode [2019-01-01 20:59:48,502 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 20:59:48,504 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 20:59:48,504 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 20:59:48,504 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 20:59:48,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:59:48" (1/1) ... [2019-01-01 20:59:48,526 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:59:48" (1/1) ... [2019-01-01 20:59:48,552 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 20:59:48,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 20:59:48,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 20:59:48,553 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 20:59:48,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:59:48" (1/1) ... [2019-01-01 20:59:48,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:59:48" (1/1) ... [2019-01-01 20:59:48,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:59:48" (1/1) ... [2019-01-01 20:59:48,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:59:48" (1/1) ... [2019-01-01 20:59:48,574 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:59:48" (1/1) ... [2019-01-01 20:59:48,579 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:59:48" (1/1) ... [2019-01-01 20:59:48,580 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:59:48" (1/1) ... [2019-01-01 20:59:48,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 20:59:48,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 20:59:48,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 20:59:48,583 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 20:59:48,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:59:48" (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-01 20:59:48,740 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2019-01-01 20:59:48,740 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2019-01-01 20:59:48,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 20:59:48,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 20:59:49,030 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 20:59:49,031 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-01 20:59:49,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:59:49 BoogieIcfgContainer [2019-01-01 20:59:49,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 20:59:49,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 20:59:49,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 20:59:49,037 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 20:59:49,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 08:59:48" (1/3) ... [2019-01-01 20:59:49,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43198018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:59:49, skipping insertion in model container [2019-01-01 20:59:49,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:59:48" (2/3) ... [2019-01-01 20:59:49,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43198018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:59:49, skipping insertion in model container [2019-01-01 20:59:49,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:59:49" (3/3) ... [2019-01-01 20:59:49,042 INFO L112 eAbstractionObserver]: Analyzing ICFG recHanoi02_true-termination_true-no-overflow.c [2019-01-01 20:59:49,052 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 20:59:49,064 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-01 20:59:49,082 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-01 20:59:49,121 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 20:59:49,122 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 20:59:49,122 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 20:59:49,122 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 20:59:49,123 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 20:59:49,123 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 20:59:49,123 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 20:59:49,123 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 20:59:49,123 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 20:59:49,145 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-01-01 20:59:49,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-01 20:59:49,151 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:59:49,152 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-01 20:59:49,156 INFO L423 AbstractCegarLoop]: === Iteration 1 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:59:49,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:59:49,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1513948958, now seen corresponding path program 1 times [2019-01-01 20:59:49,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:59:49,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:59:49,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:49,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:59:49,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:59:49,527 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-01 20:59:49,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:59:49,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 20:59:49,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:59:49,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:59:49,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:59:49,560 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2019-01-01 20:59:49,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:59:49,704 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-01-01 20:59:49,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 20:59:49,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-01-01 20:59:49,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:59:49,718 INFO L225 Difference]: With dead ends: 33 [2019-01-01 20:59:49,718 INFO L226 Difference]: Without dead ends: 20 [2019-01-01 20:59:49,721 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-01 20:59:49,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-01 20:59:49,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-01 20:59:49,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-01 20:59:49,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-01-01 20:59:49,767 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 6 [2019-01-01 20:59:49,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:59:49,767 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-01-01 20:59:49,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:59:49,768 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-01-01 20:59:49,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-01 20:59:49,768 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:59:49,769 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:59:49,769 INFO L423 AbstractCegarLoop]: === Iteration 2 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:59:49,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:59:49,770 INFO L82 PathProgramCache]: Analyzing trace with hash -312222520, now seen corresponding path program 1 times [2019-01-01 20:59:49,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:59:49,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:59:49,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:49,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:59:49,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:59:49,852 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-01 20:59:49,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:59:49,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 20:59:49,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:59:49,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:59:49,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:59:49,855 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2019-01-01 20:59:50,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:59:50,131 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-01-01 20:59:50,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:59:50,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-01 20:59:50,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:59:50,138 INFO L225 Difference]: With dead ends: 39 [2019-01-01 20:59:50,138 INFO L226 Difference]: Without dead ends: 36 [2019-01-01 20:59:50,140 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-01 20:59:50,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-01 20:59:50,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2019-01-01 20:59:50,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-01 20:59:50,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-01-01 20:59:50,153 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 7 [2019-01-01 20:59:50,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:59:50,153 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-01-01 20:59:50,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:59:50,154 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-01-01 20:59:50,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-01 20:59:50,157 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:59:50,157 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 20:59:50,158 INFO L423 AbstractCegarLoop]: === Iteration 3 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:59:50,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:59:50,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1144431293, now seen corresponding path program 1 times [2019-01-01 20:59:50,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:59:50,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:59:50,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:50,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:59:50,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:59:50,335 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-01 20:59:50,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:59:50,336 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-01 20:59:50,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:59:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:59:50,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:59:50,436 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-01 20:59:50,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:59:50,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-01 20:59:50,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 20:59:50,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 20:59:50,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:59:50,469 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 7 states. [2019-01-01 20:59:50,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:59:50,689 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-01-01 20:59:50,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 20:59:50,691 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-01 20:59:50,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:59:50,694 INFO L225 Difference]: With dead ends: 55 [2019-01-01 20:59:50,695 INFO L226 Difference]: Without dead ends: 54 [2019-01-01 20:59:50,696 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-01 20:59:50,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-01 20:59:50,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 42. [2019-01-01 20:59:50,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-01 20:59:50,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2019-01-01 20:59:50,710 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 12 [2019-01-01 20:59:50,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:59:50,710 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-01-01 20:59:50,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 20:59:50,711 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2019-01-01 20:59:50,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-01 20:59:50,712 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:59:50,712 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:59:50,712 INFO L423 AbstractCegarLoop]: === Iteration 4 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:59:50,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:59:50,713 INFO L82 PathProgramCache]: Analyzing trace with hash -287349001, now seen corresponding path program 1 times [2019-01-01 20:59:50,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:59:50,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:59:50,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:50,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:59:50,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:50,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:59:50,875 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-01 20:59:50,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:59:50,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 20:59:50,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:59:50,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:59:50,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:59:50,879 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand 4 states. [2019-01-01 20:59:50,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:59:50,989 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2019-01-01 20:59:50,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 20:59:50,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-01-01 20:59:50,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:59:50,993 INFO L225 Difference]: With dead ends: 65 [2019-01-01 20:59:50,993 INFO L226 Difference]: Without dead ends: 54 [2019-01-01 20:59:50,994 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-01 20:59:50,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-01 20:59:51,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-01-01 20:59:51,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-01 20:59:51,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2019-01-01 20:59:51,006 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 14 [2019-01-01 20:59:51,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:59:51,006 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2019-01-01 20:59:51,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:59:51,007 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2019-01-01 20:59:51,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-01 20:59:51,008 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:59:51,008 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1] [2019-01-01 20:59:51,008 INFO L423 AbstractCegarLoop]: === Iteration 5 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:59:51,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:59:51,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1656222120, now seen corresponding path program 2 times [2019-01-01 20:59:51,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:59:51,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:59:51,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:51,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:59:51,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:59:51,210 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-01 20:59:51,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:59:51,211 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-01 20:59:51,222 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:59:51,235 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:59:51,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:59:51,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:59:51,248 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-01 20:59:51,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:59:51,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-01 20:59:51,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 20:59:51,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 20:59:51,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-01 20:59:51,277 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 9 states. [2019-01-01 20:59:51,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:59:51,900 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2019-01-01 20:59:51,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 20:59:51,902 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-01-01 20:59:51,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:59:51,903 INFO L225 Difference]: With dead ends: 86 [2019-01-01 20:59:51,903 INFO L226 Difference]: Without dead ends: 85 [2019-01-01 20:59:51,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-01-01 20:59:51,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-01 20:59:51,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2019-01-01 20:59:51,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-01 20:59:51,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2019-01-01 20:59:51,917 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 17 [2019-01-01 20:59:51,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:59:51,917 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2019-01-01 20:59:51,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 20:59:51,918 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2019-01-01 20:59:51,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-01 20:59:51,919 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:59:51,919 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1] [2019-01-01 20:59:51,920 INFO L423 AbstractCegarLoop]: === Iteration 6 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:59:51,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:59:51,920 INFO L82 PathProgramCache]: Analyzing trace with hash 438260835, now seen corresponding path program 3 times [2019-01-01 20:59:51,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:59:51,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:59:51,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:51,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:59:51,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:59:52,208 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-01 20:59:52,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:59:52,209 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-01 20:59:52,220 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:59:52,254 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-01 20:59:52,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:59:52,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:59:52,268 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-01 20:59:52,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:59:52,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-01 20:59:52,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 20:59:52,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 20:59:52,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-01-01 20:59:52,299 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand 11 states. [2019-01-01 20:59:53,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:59:53,024 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2019-01-01 20:59:53,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 20:59:53,028 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-01-01 20:59:53,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:59:53,030 INFO L225 Difference]: With dead ends: 109 [2019-01-01 20:59:53,030 INFO L226 Difference]: Without dead ends: 108 [2019-01-01 20:59:53,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-01-01 20:59:53,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-01 20:59:53,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 92. [2019-01-01 20:59:53,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-01 20:59:53,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 112 transitions. [2019-01-01 20:59:53,047 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 112 transitions. Word has length 22 [2019-01-01 20:59:53,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:59:53,047 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 112 transitions. [2019-01-01 20:59:53,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 20:59:53,047 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 112 transitions. [2019-01-01 20:59:53,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-01 20:59:53,050 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:59:53,050 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1] [2019-01-01 20:59:53,051 INFO L423 AbstractCegarLoop]: === Iteration 7 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:59:53,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:59:53,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1696558728, now seen corresponding path program 4 times [2019-01-01 20:59:53,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:59:53,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:59:53,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:53,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:59:53,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:59:53,334 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-01 20:59:53,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:59:53,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 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-01 20:59:53,356 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:59:53,396 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:59:53,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:59:53,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:59:53,412 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-01 20:59:53,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:59:53,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-01-01 20:59:53,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 20:59:53,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 20:59:53,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-01-01 20:59:53,437 INFO L87 Difference]: Start difference. First operand 92 states and 112 transitions. Second operand 13 states. [2019-01-01 20:59:53,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:59:53,782 INFO L93 Difference]: Finished difference Result 132 states and 137 transitions. [2019-01-01 20:59:53,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-01 20:59:53,784 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2019-01-01 20:59:53,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:59:53,786 INFO L225 Difference]: With dead ends: 132 [2019-01-01 20:59:53,787 INFO L226 Difference]: Without dead ends: 131 [2019-01-01 20:59:53,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2019-01-01 20:59:53,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-01 20:59:53,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 111. [2019-01-01 20:59:53,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-01 20:59:53,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 136 transitions. [2019-01-01 20:59:53,804 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 136 transitions. Word has length 27 [2019-01-01 20:59:53,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:59:53,804 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 136 transitions. [2019-01-01 20:59:53,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 20:59:53,805 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 136 transitions. [2019-01-01 20:59:53,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-01 20:59:53,807 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:59:53,807 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:59:53,808 INFO L423 AbstractCegarLoop]: === Iteration 8 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:59:53,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:59:53,809 INFO L82 PathProgramCache]: Analyzing trace with hash -563967927, now seen corresponding path program 1 times [2019-01-01 20:59:53,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:59:53,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:59:53,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:53,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:59:53,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:59:53,899 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-01 20:59:53,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:59:53,900 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-01 20:59:53,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:59:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:59:53,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:59:54,003 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-01 20:59:54,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:59:54,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-01-01 20:59:54,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 20:59:54,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 20:59:54,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:59:54,031 INFO L87 Difference]: Start difference. First operand 111 states and 136 transitions. Second operand 8 states. [2019-01-01 20:59:54,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:59:54,122 INFO L93 Difference]: Finished difference Result 153 states and 200 transitions. [2019-01-01 20:59:54,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 20:59:54,124 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-01-01 20:59:54,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:59:54,128 INFO L225 Difference]: With dead ends: 153 [2019-01-01 20:59:54,128 INFO L226 Difference]: Without dead ends: 151 [2019-01-01 20:59:54,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:59:54,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-01-01 20:59:54,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 145. [2019-01-01 20:59:54,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-01-01 20:59:54,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 177 transitions. [2019-01-01 20:59:54,147 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 177 transitions. Word has length 26 [2019-01-01 20:59:54,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:59:54,148 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 177 transitions. [2019-01-01 20:59:54,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 20:59:54,148 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 177 transitions. [2019-01-01 20:59:54,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-01 20:59:54,149 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:59:54,149 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:59:54,150 INFO L423 AbstractCegarLoop]: === Iteration 9 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:59:54,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:59:54,150 INFO L82 PathProgramCache]: Analyzing trace with hash -303136509, now seen corresponding path program 1 times [2019-01-01 20:59:54,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:59:54,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:59:54,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:54,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:59:54,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:59:54,225 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-01 20:59:54,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:59:54,226 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-01 20:59:54,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:59:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:59:54,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:59:54,329 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-01 20:59:54,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 20:59:54,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2019-01-01 20:59:54,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 20:59:54,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 20:59:54,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:59:54,363 INFO L87 Difference]: Start difference. First operand 145 states and 177 transitions. Second operand 8 states. [2019-01-01 20:59:54,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:59:54,453 INFO L93 Difference]: Finished difference Result 145 states and 177 transitions. [2019-01-01 20:59:54,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:59:54,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-01-01 20:59:54,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:59:54,457 INFO L225 Difference]: With dead ends: 145 [2019-01-01 20:59:54,457 INFO L226 Difference]: Without dead ends: 129 [2019-01-01 20:59:54,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:59:54,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-01 20:59:54,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-01-01 20:59:54,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-01 20:59:54,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 144 transitions. [2019-01-01 20:59:54,470 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 144 transitions. Word has length 27 [2019-01-01 20:59:54,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:59:54,471 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 144 transitions. [2019-01-01 20:59:54,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 20:59:54,471 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 144 transitions. [2019-01-01 20:59:54,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-01 20:59:54,472 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:59:54,472 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1] [2019-01-01 20:59:54,473 INFO L423 AbstractCegarLoop]: === Iteration 10 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:59:54,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:59:54,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1757224061, now seen corresponding path program 5 times [2019-01-01 20:59:54,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:59:54,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:59:54,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:54,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:59:54,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:59:54,893 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-01 20:59:54,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:59:54,894 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-01 20:59:54,906 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 20:59:54,920 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-01 20:59:54,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:59:54,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:59:54,938 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-01 20:59:54,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:59:54,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-01-01 20:59:54,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-01 20:59:54,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-01 20:59:54,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-01-01 20:59:54,962 INFO L87 Difference]: Start difference. First operand 129 states and 144 transitions. Second operand 15 states. [2019-01-01 20:59:55,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:59:55,366 INFO L93 Difference]: Finished difference Result 167 states and 173 transitions. [2019-01-01 20:59:55,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-01 20:59:55,368 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2019-01-01 20:59:55,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:59:55,369 INFO L225 Difference]: With dead ends: 167 [2019-01-01 20:59:55,369 INFO L226 Difference]: Without dead ends: 166 [2019-01-01 20:59:55,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2019-01-01 20:59:55,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-01 20:59:55,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 154. [2019-01-01 20:59:55,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-01-01 20:59:55,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 172 transitions. [2019-01-01 20:59:55,385 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 172 transitions. Word has length 32 [2019-01-01 20:59:55,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:59:55,385 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 172 transitions. [2019-01-01 20:59:55,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-01 20:59:55,386 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 172 transitions. [2019-01-01 20:59:55,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-01 20:59:55,387 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:59:55,387 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1] [2019-01-01 20:59:55,388 INFO L423 AbstractCegarLoop]: === Iteration 11 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:59:55,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:59:55,388 INFO L82 PathProgramCache]: Analyzing trace with hash -512208024, now seen corresponding path program 6 times [2019-01-01 20:59:55,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:59:55,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:59:55,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:55,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:59:55,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:59:55,843 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-01 20:59:55,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:59:55,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 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-01 20:59:55,855 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 20:59:55,893 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-01 20:59:55,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:59:55,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:59:55,978 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-01 20:59:56,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:59:56,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 17 [2019-01-01 20:59:56,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-01 20:59:56,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-01 20:59:56,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-01-01 20:59:56,009 INFO L87 Difference]: Start difference. First operand 154 states and 172 transitions. Second operand 18 states. [2019-01-01 20:59:56,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:59:56,098 INFO L93 Difference]: Finished difference Result 154 states and 172 transitions. [2019-01-01 20:59:56,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:59:56,105 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2019-01-01 20:59:56,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:59:56,108 INFO L225 Difference]: With dead ends: 154 [2019-01-01 20:59:56,108 INFO L226 Difference]: Without dead ends: 153 [2019-01-01 20:59:56,109 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-01 20:59:56,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-01-01 20:59:56,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-01-01 20:59:56,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-01-01 20:59:56,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 171 transitions. [2019-01-01 20:59:56,140 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 171 transitions. Word has length 37 [2019-01-01 20:59:56,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:59:56,140 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 171 transitions. [2019-01-01 20:59:56,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-01 20:59:56,140 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 171 transitions. [2019-01-01 20:59:56,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-01 20:59:56,142 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:59:56,142 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-01 20:59:56,148 INFO L423 AbstractCegarLoop]: === Iteration 12 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:59:56,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:59:56,149 INFO L82 PathProgramCache]: Analyzing trace with hash 867149367, now seen corresponding path program 2 times [2019-01-01 20:59:56,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:59:56,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:59:56,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:56,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:59:56,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:59:56,483 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-01 20:59:56,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:59:56,483 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-01 20:59:56,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:59:56,507 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:59:56,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:59:56,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:59:56,588 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-01 20:59:56,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:59:56,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-01-01 20:59:56,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 20:59:56,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 20:59:56,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-01 20:59:56,612 INFO L87 Difference]: Start difference. First operand 153 states and 171 transitions. Second operand 10 states. [2019-01-01 20:59:56,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:59:56,690 INFO L93 Difference]: Finished difference Result 207 states and 237 transitions. [2019-01-01 20:59:56,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 20:59:56,692 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2019-01-01 20:59:56,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:59:56,694 INFO L225 Difference]: With dead ends: 207 [2019-01-01 20:59:56,695 INFO L226 Difference]: Without dead ends: 185 [2019-01-01 20:59:56,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-01 20:59:56,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-01-01 20:59:56,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 179. [2019-01-01 20:59:56,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-01-01 20:59:56,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 197 transitions. [2019-01-01 20:59:56,710 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 197 transitions. Word has length 38 [2019-01-01 20:59:56,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:59:56,710 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 197 transitions. [2019-01-01 20:59:56,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 20:59:56,710 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 197 transitions. [2019-01-01 20:59:56,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-01 20:59:56,713 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:59:56,714 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2019-01-01 20:59:56,714 INFO L423 AbstractCegarLoop]: === Iteration 13 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:59:56,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:59:56,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1066180599, now seen corresponding path program 3 times [2019-01-01 20:59:56,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:59:56,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:59:56,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:56,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:59:56,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:59:56,848 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-01 20:59:56,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:59:56,849 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-01 20:59:56,860 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:59:56,887 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-01 20:59:56,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:59:56,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:59:56,990 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-01 20:59:57,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:59:57,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-01-01 20:59:57,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 20:59:57,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 20:59:57,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-01-01 20:59:57,013 INFO L87 Difference]: Start difference. First operand 179 states and 197 transitions. Second operand 12 states. [2019-01-01 20:59:57,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:59:57,107 INFO L93 Difference]: Finished difference Result 233 states and 263 transitions. [2019-01-01 20:59:57,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 20:59:57,110 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2019-01-01 20:59:57,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:59:57,111 INFO L225 Difference]: With dead ends: 233 [2019-01-01 20:59:57,112 INFO L226 Difference]: Without dead ends: 204 [2019-01-01 20:59:57,112 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-01 20:59:57,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-01-01 20:59:57,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 198. [2019-01-01 20:59:57,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-01-01 20:59:57,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 216 transitions. [2019-01-01 20:59:57,125 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 216 transitions. Word has length 50 [2019-01-01 20:59:57,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:59:57,125 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 216 transitions. [2019-01-01 20:59:57,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 20:59:57,125 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 216 transitions. [2019-01-01 20:59:57,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-01 20:59:57,128 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:59:57,128 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2019-01-01 20:59:57,128 INFO L423 AbstractCegarLoop]: === Iteration 14 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:59:57,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:59:57,129 INFO L82 PathProgramCache]: Analyzing trace with hash -158018185, now seen corresponding path program 4 times [2019-01-01 20:59:57,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:59:57,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:59:57,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:57,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:59:57,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:59:57,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-01 20:59:57,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:59:57,285 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-01 20:59:57,299 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:59:57,333 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:59:57,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:59:57,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:59:57,450 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-01 20:59:57,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:59:57,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2019-01-01 20:59:57,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-01 20:59:57,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-01 20:59:57,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-01-01 20:59:57,472 INFO L87 Difference]: Start difference. First operand 198 states and 216 transitions. Second operand 14 states. [2019-01-01 20:59:57,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:59:57,635 INFO L93 Difference]: Finished difference Result 252 states and 282 transitions. [2019-01-01 20:59:57,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 20:59:57,637 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2019-01-01 20:59:57,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:59:57,639 INFO L225 Difference]: With dead ends: 252 [2019-01-01 20:59:57,639 INFO L226 Difference]: Without dead ends: 216 [2019-01-01 20:59:57,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-01-01 20:59:57,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-01-01 20:59:57,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 210. [2019-01-01 20:59:57,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-01 20:59:57,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 228 transitions. [2019-01-01 20:59:57,653 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 228 transitions. Word has length 62 [2019-01-01 20:59:57,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:59:57,653 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 228 transitions. [2019-01-01 20:59:57,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-01 20:59:57,653 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 228 transitions. [2019-01-01 20:59:57,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-01 20:59:57,655 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:59:57,656 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2019-01-01 20:59:57,656 INFO L423 AbstractCegarLoop]: === Iteration 15 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:59:57,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:59:57,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1955313719, now seen corresponding path program 5 times [2019-01-01 20:59:57,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:59:57,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:59:57,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:57,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:59:57,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:57,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:59:57,918 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-01 20:59:57,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:59:57,918 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-01 20:59:57,929 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 20:59:58,043 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-01-01 20:59:58,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:59:58,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:59:58,973 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-01 20:59:58,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:59:58,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2019-01-01 20:59:58,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-01 20:59:58,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-01 20:59:58,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-01-01 20:59:58,996 INFO L87 Difference]: Start difference. First operand 210 states and 228 transitions. Second operand 16 states. [2019-01-01 20:59:59,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:59:59,108 INFO L93 Difference]: Finished difference Result 264 states and 294 transitions. [2019-01-01 20:59:59,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 20:59:59,109 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 74 [2019-01-01 20:59:59,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:59:59,111 INFO L225 Difference]: With dead ends: 264 [2019-01-01 20:59:59,111 INFO L226 Difference]: Without dead ends: 223 [2019-01-01 20:59:59,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 67 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-01-01 20:59:59,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-01-01 20:59:59,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 217. [2019-01-01 20:59:59,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-01 20:59:59,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 235 transitions. [2019-01-01 20:59:59,124 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 235 transitions. Word has length 74 [2019-01-01 20:59:59,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:59:59,124 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 235 transitions. [2019-01-01 20:59:59,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-01 20:59:59,124 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 235 transitions. [2019-01-01 20:59:59,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-01 20:59:59,126 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:59:59,127 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2019-01-01 20:59:59,127 INFO L423 AbstractCegarLoop]: === Iteration 16 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:59:59,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:59:59,127 INFO L82 PathProgramCache]: Analyzing trace with hash -330632009, now seen corresponding path program 6 times [2019-01-01 20:59:59,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:59:59,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:59:59,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:59,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:59:59,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:59:59,385 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-01 20:59:59,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:59:59,387 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-01 20:59:59,401 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 20:59:59,450 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-01-01 20:59:59,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:59:59,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:59:59,600 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-01 20:59:59,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:59:59,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2019-01-01 20:59:59,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-01 20:59:59,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-01 20:59:59,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-01-01 20:59:59,622 INFO L87 Difference]: Start difference. First operand 217 states and 235 transitions. Second operand 18 states. [2019-01-01 20:59:59,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:59:59,792 INFO L93 Difference]: Finished difference Result 271 states and 301 transitions. [2019-01-01 20:59:59,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-01 20:59:59,794 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 86 [2019-01-01 20:59:59,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:59:59,796 INFO L225 Difference]: With dead ends: 271 [2019-01-01 20:59:59,797 INFO L226 Difference]: Without dead ends: 230 [2019-01-01 20:59:59,798 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-01 20:59:59,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-01-01 20:59:59,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 224. [2019-01-01 20:59:59,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-01-01 20:59:59,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 242 transitions. [2019-01-01 20:59:59,811 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 242 transitions. Word has length 86 [2019-01-01 20:59:59,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:59:59,811 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 242 transitions. [2019-01-01 20:59:59,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-01 20:59:59,812 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 242 transitions. [2019-01-01 20:59:59,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-01 20:59:59,814 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:59:59,814 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2019-01-01 20:59:59,814 INFO L423 AbstractCegarLoop]: === Iteration 17 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:59:59,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:59:59,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1775681655, now seen corresponding path program 7 times [2019-01-01 20:59:59,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:59:59,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:59:59,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:59,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:59:59,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:00:00,316 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-01 21:00:00,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:00:00,317 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-01 21:00:00,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:00:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:00:00,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:00:00,599 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-01 21:00:00,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:00:00,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2019-01-01 21:00:00,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-01 21:00:00,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-01 21:00:00,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-01-01 21:00:00,621 INFO L87 Difference]: Start difference. First operand 224 states and 242 transitions. Second operand 20 states. [2019-01-01 21:00:00,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:00:00,857 INFO L93 Difference]: Finished difference Result 278 states and 308 transitions. [2019-01-01 21:00:00,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-01 21:00:00,858 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 98 [2019-01-01 21:00:00,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:00:00,859 INFO L225 Difference]: With dead ends: 278 [2019-01-01 21:00:00,860 INFO L226 Difference]: Without dead ends: 237 [2019-01-01 21:00:00,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 89 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-01-01 21:00:00,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-01-01 21:00:00,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 231. [2019-01-01 21:00:00,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-01 21:00:00,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 249 transitions. [2019-01-01 21:00:00,884 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 249 transitions. Word has length 98 [2019-01-01 21:00:00,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:00:00,885 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 249 transitions. [2019-01-01 21:00:00,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-01 21:00:00,885 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 249 transitions. [2019-01-01 21:00:00,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-01-01 21:00:00,889 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:00:00,890 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2019-01-01 21:00:00,890 INFO L423 AbstractCegarLoop]: === Iteration 18 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:00:00,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:00:00,890 INFO L82 PathProgramCache]: Analyzing trace with hash 73375164, now seen corresponding path program 8 times [2019-01-01 21:00:00,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:00:00,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:00:00,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:00,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:00:00,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:00:01,328 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-01 21:00:01,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:00:01,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 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-01 21:00:01,340 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:00:01,386 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:00:01,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:00:01,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:00:01,675 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-01 21:00:01,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:00:01,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2019-01-01 21:00:01,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-01 21:00:01,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-01 21:00:01,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-01-01 21:00:01,698 INFO L87 Difference]: Start difference. First operand 231 states and 249 transitions. Second operand 22 states. [2019-01-01 21:00:02,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:00:02,241 INFO L93 Difference]: Finished difference Result 285 states and 315 transitions. [2019-01-01 21:00:02,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-01 21:00:02,243 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 145 [2019-01-01 21:00:02,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:00:02,246 INFO L225 Difference]: With dead ends: 285 [2019-01-01 21:00:02,246 INFO L226 Difference]: Without dead ends: 244 [2019-01-01 21:00:02,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 135 SyntacticMatches, 8 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-01-01 21:00:02,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-01-01 21:00:02,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 238. [2019-01-01 21:00:02,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-01-01 21:00:02,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 256 transitions. [2019-01-01 21:00:02,261 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 256 transitions. Word has length 145 [2019-01-01 21:00:02,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:00:02,264 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 256 transitions. [2019-01-01 21:00:02,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-01 21:00:02,264 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 256 transitions. [2019-01-01 21:00:02,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-01-01 21:00:02,268 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:00:02,268 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2019-01-01 21:00:02,269 INFO L423 AbstractCegarLoop]: === Iteration 19 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:00:02,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:00:02,269 INFO L82 PathProgramCache]: Analyzing trace with hash -329358962, now seen corresponding path program 9 times [2019-01-01 21:00:02,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:00:02,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:00:02,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:02,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:00:02,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:00:02,892 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-01 21:00:02,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:00:02,893 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-01 21:00:02,903 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 21:00:03,020 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-01 21:00:03,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:00:03,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:00:03,373 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-01 21:00:03,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:00:03,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2019-01-01 21:00:03,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-01 21:00:03,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-01 21:00:03,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-01-01 21:00:03,395 INFO L87 Difference]: Start difference. First operand 238 states and 256 transitions. Second operand 24 states. [2019-01-01 21:00:03,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:00:03,572 INFO L93 Difference]: Finished difference Result 292 states and 322 transitions. [2019-01-01 21:00:03,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-01 21:00:03,574 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 157 [2019-01-01 21:00:03,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:00:03,577 INFO L225 Difference]: With dead ends: 292 [2019-01-01 21:00:03,577 INFO L226 Difference]: Without dead ends: 251 [2019-01-01 21:00:03,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 146 SyntacticMatches, 9 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-01-01 21:00:03,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-01-01 21:00:03,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 245. [2019-01-01 21:00:03,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-01-01 21:00:03,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 263 transitions. [2019-01-01 21:00:03,594 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 263 transitions. Word has length 157 [2019-01-01 21:00:03,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:00:03,598 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 263 transitions. [2019-01-01 21:00:03,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-01 21:00:03,598 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 263 transitions. [2019-01-01 21:00:03,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-01-01 21:00:03,601 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:00:03,602 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2019-01-01 21:00:03,602 INFO L423 AbstractCegarLoop]: === Iteration 20 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:00:03,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:00:03,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1310449148, now seen corresponding path program 10 times [2019-01-01 21:00:03,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:00:03,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:00:03,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:03,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:00:03,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:00:04,061 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-01 21:00:04,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:00:04,062 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-01 21:00:04,073 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 21:00:04,117 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 21:00:04,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:00:04,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:00:04,430 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-01 21:00:04,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:00:04,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2019-01-01 21:00:04,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-01 21:00:04,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-01 21:00:04,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2019-01-01 21:00:04,452 INFO L87 Difference]: Start difference. First operand 245 states and 263 transitions. Second operand 26 states. [2019-01-01 21:00:04,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:00:04,628 INFO L93 Difference]: Finished difference Result 299 states and 329 transitions. [2019-01-01 21:00:04,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-01 21:00:04,629 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 169 [2019-01-01 21:00:04,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:00:04,635 INFO L225 Difference]: With dead ends: 299 [2019-01-01 21:00:04,635 INFO L226 Difference]: Without dead ends: 258 [2019-01-01 21:00:04,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 157 SyntacticMatches, 10 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2019-01-01 21:00:04,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-01-01 21:00:04,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 252. [2019-01-01 21:00:04,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-01 21:00:04,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 270 transitions. [2019-01-01 21:00:04,647 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 270 transitions. Word has length 169 [2019-01-01 21:00:04,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:00:04,650 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 270 transitions. [2019-01-01 21:00:04,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-01 21:00:04,651 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 270 transitions. [2019-01-01 21:00:04,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-01-01 21:00:04,655 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:00:04,655 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2019-01-01 21:00:04,655 INFO L423 AbstractCegarLoop]: === Iteration 21 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:00:04,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:00:04,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1885455794, now seen corresponding path program 11 times [2019-01-01 21:00:04,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:00:04,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:00:04,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:04,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:00:04,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:00:05,816 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-01 21:00:05,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:00:05,817 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-01 21:00:05,828 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 21:00:05,907 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2019-01-01 21:00:05,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:00:05,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:00:06,287 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-01 21:00:06,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:00:06,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 27 [2019-01-01 21:00:06,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-01 21:00:06,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-01 21:00:06,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-01-01 21:00:06,312 INFO L87 Difference]: Start difference. First operand 252 states and 270 transitions. Second operand 28 states. [2019-01-01 21:00:06,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:00:06,564 INFO L93 Difference]: Finished difference Result 306 states and 336 transitions. [2019-01-01 21:00:06,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-01 21:00:06,565 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 181 [2019-01-01 21:00:06,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:00:06,569 INFO L225 Difference]: With dead ends: 306 [2019-01-01 21:00:06,569 INFO L226 Difference]: Without dead ends: 265 [2019-01-01 21:00:06,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 168 SyntacticMatches, 11 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-01-01 21:00:06,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-01-01 21:00:06,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 259. [2019-01-01 21:00:06,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-01-01 21:00:06,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 277 transitions. [2019-01-01 21:00:06,582 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 277 transitions. Word has length 181 [2019-01-01 21:00:06,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:00:06,583 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 277 transitions. [2019-01-01 21:00:06,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-01 21:00:06,583 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 277 transitions. [2019-01-01 21:00:06,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-01-01 21:00:06,588 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:00:06,588 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1] [2019-01-01 21:00:06,590 INFO L423 AbstractCegarLoop]: === Iteration 22 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:00:06,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:00:06,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1454043767, now seen corresponding path program 12 times [2019-01-01 21:00:06,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:00:06,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:00:06,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:06,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:00:06,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:00:07,098 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-01 21:00:07,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:00:07,099 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-01 21:00:07,113 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 21:00:07,160 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2019-01-01 21:00:07,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:00:07,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:00:07,540 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-01 21:00:07,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:00:07,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2019-01-01 21:00:07,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-01 21:00:07,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-01 21:00:07,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2019-01-01 21:00:07,563 INFO L87 Difference]: Start difference. First operand 259 states and 277 transitions. Second operand 30 states. [2019-01-01 21:00:07,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:00:07,847 INFO L93 Difference]: Finished difference Result 313 states and 343 transitions. [2019-01-01 21:00:07,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-01 21:00:07,852 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 158 [2019-01-01 21:00:07,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:00:07,854 INFO L225 Difference]: With dead ends: 313 [2019-01-01 21:00:07,854 INFO L226 Difference]: Without dead ends: 272 [2019-01-01 21:00:07,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 144 SyntacticMatches, 12 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2019-01-01 21:00:07,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-01-01 21:00:07,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 266. [2019-01-01 21:00:07,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-01-01 21:00:07,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 284 transitions. [2019-01-01 21:00:07,867 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 284 transitions. Word has length 158 [2019-01-01 21:00:07,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:00:07,868 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 284 transitions. [2019-01-01 21:00:07,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-01 21:00:07,868 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 284 transitions. [2019-01-01 21:00:07,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-01-01 21:00:07,877 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:00:07,877 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1] [2019-01-01 21:00:07,877 INFO L423 AbstractCegarLoop]: === Iteration 23 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:00:07,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:00:07,878 INFO L82 PathProgramCache]: Analyzing trace with hash 350954254, now seen corresponding path program 13 times [2019-01-01 21:00:07,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:00:07,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:00:07,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:07,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:00:07,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:00:08,685 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-01 21:00:08,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:00:08,686 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-01 21:00:08,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:00:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:00:08,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:00:09,083 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-01 21:00:09,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:00:09,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 31 [2019-01-01 21:00:09,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-01 21:00:09,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-01 21:00:09,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2019-01-01 21:00:09,107 INFO L87 Difference]: Start difference. First operand 266 states and 284 transitions. Second operand 32 states. [2019-01-01 21:00:09,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:00:09,768 INFO L93 Difference]: Finished difference Result 320 states and 350 transitions. [2019-01-01 21:00:09,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-01 21:00:09,770 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 205 [2019-01-01 21:00:09,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:00:09,775 INFO L225 Difference]: With dead ends: 320 [2019-01-01 21:00:09,776 INFO L226 Difference]: Without dead ends: 279 [2019-01-01 21:00:09,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 190 SyntacticMatches, 13 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2019-01-01 21:00:09,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-01 21:00:09,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 273. [2019-01-01 21:00:09,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-01-01 21:00:09,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 291 transitions. [2019-01-01 21:00:09,796 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 291 transitions. Word has length 205 [2019-01-01 21:00:09,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:00:09,797 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 291 transitions. [2019-01-01 21:00:09,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-01 21:00:09,797 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 291 transitions. [2019-01-01 21:00:09,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-01-01 21:00:09,802 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:00:09,802 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1] [2019-01-01 21:00:09,803 INFO L423 AbstractCegarLoop]: === Iteration 24 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:00:09,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:00:09,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1929171383, now seen corresponding path program 14 times [2019-01-01 21:00:09,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:00:09,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:00:09,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:09,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:00:09,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:00:11,178 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-01 21:00:11,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:00:11,178 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-01 21:00:11,189 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:00:11,234 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:00:11,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:00:11,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:00:11,626 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-01 21:00:11,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:00:11,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 33 [2019-01-01 21:00:11,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-01 21:00:11,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-01 21:00:11,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2019-01-01 21:00:11,650 INFO L87 Difference]: Start difference. First operand 273 states and 291 transitions. Second operand 34 states. [2019-01-01 21:00:12,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:00:12,426 INFO L93 Difference]: Finished difference Result 327 states and 357 transitions. [2019-01-01 21:00:12,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-01 21:00:12,428 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 182 [2019-01-01 21:00:12,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:00:12,431 INFO L225 Difference]: With dead ends: 327 [2019-01-01 21:00:12,431 INFO L226 Difference]: Without dead ends: 286 [2019-01-01 21:00:12,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 166 SyntacticMatches, 14 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2019-01-01 21:00:12,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-01-01 21:00:12,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 280. [2019-01-01 21:00:12,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-01-01 21:00:12,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 298 transitions. [2019-01-01 21:00:12,445 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 298 transitions. Word has length 182 [2019-01-01 21:00:12,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:00:12,448 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 298 transitions. [2019-01-01 21:00:12,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-01 21:00:12,448 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 298 transitions. [2019-01-01 21:00:12,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-01-01 21:00:12,452 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:00:12,453 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1] [2019-01-01 21:00:12,453 INFO L423 AbstractCegarLoop]: === Iteration 25 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:00:12,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:00:12,453 INFO L82 PathProgramCache]: Analyzing trace with hash -799687031, now seen corresponding path program 15 times [2019-01-01 21:00:12,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:00:12,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:00:12,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:12,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:00:12,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:12,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:00:13,880 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-01 21:00:13,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:00:13,881 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-01 21:00:13,893 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 21:00:13,948 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-01 21:00:13,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:00:13,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:00:14,923 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-01 21:00:14,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:00:14,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 35 [2019-01-01 21:00:14,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-01 21:00:14,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-01 21:00:14,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=919, Unknown=0, NotChecked=0, Total=1260 [2019-01-01 21:00:14,946 INFO L87 Difference]: Start difference. First operand 280 states and 298 transitions. Second operand 36 states. [2019-01-01 21:00:15,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:00:15,485 INFO L93 Difference]: Finished difference Result 334 states and 364 transitions. [2019-01-01 21:00:15,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-01 21:00:15,486 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 194 [2019-01-01 21:00:15,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:00:15,489 INFO L225 Difference]: With dead ends: 334 [2019-01-01 21:00:15,489 INFO L226 Difference]: Without dead ends: 293 [2019-01-01 21:00:15,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 177 SyntacticMatches, 15 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=341, Invalid=919, Unknown=0, NotChecked=0, Total=1260 [2019-01-01 21:00:15,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-01-01 21:00:15,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 287. [2019-01-01 21:00:15,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-01-01 21:00:15,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 305 transitions. [2019-01-01 21:00:15,505 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 305 transitions. Word has length 194 [2019-01-01 21:00:15,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:00:15,506 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 305 transitions. [2019-01-01 21:00:15,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-01 21:00:15,506 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 305 transitions. [2019-01-01 21:00:15,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-01-01 21:00:15,510 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:00:15,510 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1] [2019-01-01 21:00:15,510 INFO L423 AbstractCegarLoop]: === Iteration 26 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:00:15,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:00:15,511 INFO L82 PathProgramCache]: Analyzing trace with hash 315334903, now seen corresponding path program 16 times [2019-01-01 21:00:15,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:00:15,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:00:15,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:15,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:00:15,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:00:16,482 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-01 21:00:16,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:00:16,483 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-01 21:00:16,496 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 21:00:16,544 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 21:00:16,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:00:16,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:00:17,132 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-01 21:00:17,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:00:17,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 37 [2019-01-01 21:00:17,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-01 21:00:17,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-01 21:00:17,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2019-01-01 21:00:17,154 INFO L87 Difference]: Start difference. First operand 287 states and 305 transitions. Second operand 38 states. [2019-01-01 21:00:17,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:00:17,437 INFO L93 Difference]: Finished difference Result 341 states and 371 transitions. [2019-01-01 21:00:17,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-01 21:00:17,438 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 206 [2019-01-01 21:00:17,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:00:17,441 INFO L225 Difference]: With dead ends: 341 [2019-01-01 21:00:17,441 INFO L226 Difference]: Without dead ends: 300 [2019-01-01 21:00:17,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 188 SyntacticMatches, 16 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2019-01-01 21:00:17,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-01-01 21:00:17,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 294. [2019-01-01 21:00:17,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-01-01 21:00:17,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 312 transitions. [2019-01-01 21:00:17,453 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 312 transitions. Word has length 206 [2019-01-01 21:00:17,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:00:17,455 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 312 transitions. [2019-01-01 21:00:17,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-01 21:00:17,455 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 312 transitions. [2019-01-01 21:00:17,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-01-01 21:00:17,459 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:00:17,459 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1] [2019-01-01 21:00:17,459 INFO L423 AbstractCegarLoop]: === Iteration 27 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:00:17,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:00:17,461 INFO L82 PathProgramCache]: Analyzing trace with hash -843307890, now seen corresponding path program 17 times [2019-01-01 21:00:17,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:00:17,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:00:17,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:17,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:00:17,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:00:18,780 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-01 21:00:18,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:00:18,781 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-01 21:00:18,791 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 21:00:18,885 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2019-01-01 21:00:18,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:00:18,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:00:19,335 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-01 21:00:19,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:00:19,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 39 [2019-01-01 21:00:19,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-01 21:00:19,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-01 21:00:19,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1141, Unknown=0, NotChecked=0, Total=1560 [2019-01-01 21:00:19,359 INFO L87 Difference]: Start difference. First operand 294 states and 312 transitions. Second operand 40 states. [2019-01-01 21:00:19,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:00:19,608 INFO L93 Difference]: Finished difference Result 348 states and 378 transitions. [2019-01-01 21:00:19,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-01 21:00:19,609 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 253 [2019-01-01 21:00:19,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:00:19,612 INFO L225 Difference]: With dead ends: 348 [2019-01-01 21:00:19,613 INFO L226 Difference]: Without dead ends: 307 [2019-01-01 21:00:19,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 234 SyntacticMatches, 17 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=419, Invalid=1141, Unknown=0, NotChecked=0, Total=1560 [2019-01-01 21:00:19,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-01-01 21:00:19,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 301. [2019-01-01 21:00:19,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-01-01 21:00:19,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 319 transitions. [2019-01-01 21:00:19,627 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 319 transitions. Word has length 253 [2019-01-01 21:00:19,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:00:19,627 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 319 transitions. [2019-01-01 21:00:19,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-01 21:00:19,627 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 319 transitions. [2019-01-01 21:00:19,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-01-01 21:00:19,632 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:00:19,632 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1] [2019-01-01 21:00:19,632 INFO L423 AbstractCegarLoop]: === Iteration 28 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:00:19,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:00:19,635 INFO L82 PathProgramCache]: Analyzing trace with hash 349397047, now seen corresponding path program 18 times [2019-01-01 21:00:19,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:00:19,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:00:19,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:19,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:00:19,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:19,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:00:20,610 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-01 21:00:20,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:00:20,611 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-01 21:00:20,623 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 21:00:20,736 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2019-01-01 21:00:20,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:00:20,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:00:21,437 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-01 21:00:21,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:00:21,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 41 [2019-01-01 21:00:21,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-01 21:00:21,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-01 21:00:21,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1261, Unknown=0, NotChecked=0, Total=1722 [2019-01-01 21:00:21,461 INFO L87 Difference]: Start difference. First operand 301 states and 319 transitions. Second operand 42 states. [2019-01-01 21:00:21,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:00:21,939 INFO L93 Difference]: Finished difference Result 355 states and 385 transitions. [2019-01-01 21:00:21,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-01 21:00:21,941 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 230 [2019-01-01 21:00:21,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:00:21,944 INFO L225 Difference]: With dead ends: 355 [2019-01-01 21:00:21,944 INFO L226 Difference]: Without dead ends: 314 [2019-01-01 21:00:21,946 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-01 21:00:21,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-01-01 21:00:21,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 308. [2019-01-01 21:00:21,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-01-01 21:00:21,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 326 transitions. [2019-01-01 21:00:21,959 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 326 transitions. Word has length 230 [2019-01-01 21:00:21,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:00:21,961 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 326 transitions. [2019-01-01 21:00:21,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-01 21:00:21,961 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 326 transitions. [2019-01-01 21:00:21,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-01-01 21:00:21,963 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:00:21,963 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1] [2019-01-01 21:00:21,966 INFO L423 AbstractCegarLoop]: === Iteration 29 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:00:21,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:00:21,967 INFO L82 PathProgramCache]: Analyzing trace with hash 420240905, now seen corresponding path program 19 times [2019-01-01 21:00:21,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:00:21,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:00:21,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:21,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:00:21,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:00:22,893 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-01 21:00:22,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:00:22,893 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-01 21:00:22,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:00:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:00:22,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:00:23,643 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-01 21:00:23,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:00:23,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 43 [2019-01-01 21:00:23,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-01 21:00:23,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-01 21:00:23,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2019-01-01 21:00:23,666 INFO L87 Difference]: Start difference. First operand 308 states and 326 transitions. Second operand 44 states. [2019-01-01 21:00:24,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:00:24,052 INFO L93 Difference]: Finished difference Result 362 states and 392 transitions. [2019-01-01 21:00:24,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-01 21:00:24,053 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 242 [2019-01-01 21:00:24,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:00:24,058 INFO L225 Difference]: With dead ends: 362 [2019-01-01 21:00:24,058 INFO L226 Difference]: Without dead ends: 321 [2019-01-01 21:00:24,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 221 SyntacticMatches, 19 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2019-01-01 21:00:24,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-01-01 21:00:24,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 315. [2019-01-01 21:00:24,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-01-01 21:00:24,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 333 transitions. [2019-01-01 21:00:24,071 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 333 transitions. Word has length 242 [2019-01-01 21:00:24,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:00:24,072 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 333 transitions. [2019-01-01 21:00:24,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-01 21:00:24,072 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 333 transitions. [2019-01-01 21:00:24,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-01-01 21:00:24,079 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:00:24,080 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 21, 21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1] [2019-01-01 21:00:24,080 INFO L423 AbstractCegarLoop]: === Iteration 30 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:00:24,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:00:24,080 INFO L82 PathProgramCache]: Analyzing trace with hash -2063192260, now seen corresponding path program 20 times [2019-01-01 21:00:24,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:00:24,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:00:24,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:24,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:00:24,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:00:26,547 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-01 21:00:26,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:00:26,547 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-01 21:00:26,560 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:00:26,642 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:00:26,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:00:26,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:00:27,893 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-01 21:00:27,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:00:27,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 45 [2019-01-01 21:00:27,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-01 21:00:27,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-01 21:00:27,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2019-01-01 21:00:27,917 INFO L87 Difference]: Start difference. First operand 315 states and 333 transitions. Second operand 46 states. [2019-01-01 21:00:28,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:00:28,238 INFO L93 Difference]: Finished difference Result 369 states and 399 transitions. [2019-01-01 21:00:28,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-01 21:00:28,240 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 289 [2019-01-01 21:00:28,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:00:28,243 INFO L225 Difference]: With dead ends: 369 [2019-01-01 21:00:28,243 INFO L226 Difference]: Without dead ends: 328 [2019-01-01 21:00:28,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 267 SyntacticMatches, 20 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1186 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2019-01-01 21:00:28,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-01-01 21:00:28,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 322. [2019-01-01 21:00:28,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-01-01 21:00:28,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 340 transitions. [2019-01-01 21:00:28,256 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 340 transitions. Word has length 289 [2019-01-01 21:00:28,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:00:28,258 INFO L480 AbstractCegarLoop]: Abstraction has 322 states and 340 transitions. [2019-01-01 21:00:28,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-01 21:00:28,258 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 340 transitions. [2019-01-01 21:00:28,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-01-01 21:00:28,263 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:00:28,263 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 22, 22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1] [2019-01-01 21:00:28,263 INFO L423 AbstractCegarLoop]: === Iteration 31 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:00:28,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:00:28,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1626433038, now seen corresponding path program 21 times [2019-01-01 21:00:28,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:00:28,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:00:28,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:28,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:00:28,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:00:29,287 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-01 21:00:29,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:00:29,288 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-01 21:00:29,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 21:00:29,376 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-01 21:00:29,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:00:29,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:00:31,965 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-01 21:00:31,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:00:31,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 47 [2019-01-01 21:00:31,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-01 21:00:31,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-01 21:00:31,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2019-01-01 21:00:31,988 INFO L87 Difference]: Start difference. First operand 322 states and 340 transitions. Second operand 48 states. [2019-01-01 21:00:32,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:00:32,541 INFO L93 Difference]: Finished difference Result 376 states and 406 transitions. [2019-01-01 21:00:32,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-01 21:00:32,542 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 301 [2019-01-01 21:00:32,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:00:32,545 INFO L225 Difference]: With dead ends: 376 [2019-01-01 21:00:32,545 INFO L226 Difference]: Without dead ends: 335 [2019-01-01 21:00:32,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 278 SyntacticMatches, 21 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1298 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2019-01-01 21:00:32,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-01-01 21:00:32,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 329. [2019-01-01 21:00:32,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-01-01 21:00:32,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 347 transitions. [2019-01-01 21:00:32,558 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 347 transitions. Word has length 301 [2019-01-01 21:00:32,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:00:32,561 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 347 transitions. [2019-01-01 21:00:32,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-01 21:00:32,562 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 347 transitions. [2019-01-01 21:00:32,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-01-01 21:00:32,566 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:00:32,566 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2019-01-01 21:00:32,567 INFO L423 AbstractCegarLoop]: === Iteration 32 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:00:32,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:00:32,567 INFO L82 PathProgramCache]: Analyzing trace with hash 338825084, now seen corresponding path program 22 times [2019-01-01 21:00:32,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:00:32,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:00:32,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:32,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:00:32,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:00:33,643 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-01 21:00:33,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:00:33,644 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-01 21:00:33,654 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 21:00:33,721 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 21:00:33,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:00:33,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:00:34,538 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-01 21:00:34,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:00:34,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 49 [2019-01-01 21:00:34,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-01 21:00:34,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-01 21:00:34,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=1801, Unknown=0, NotChecked=0, Total=2450 [2019-01-01 21:00:34,563 INFO L87 Difference]: Start difference. First operand 329 states and 347 transitions. Second operand 50 states. [2019-01-01 21:00:34,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:00:34,888 INFO L93 Difference]: Finished difference Result 383 states and 413 transitions. [2019-01-01 21:00:34,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-01 21:00:34,889 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 313 [2019-01-01 21:00:34,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:00:34,892 INFO L225 Difference]: With dead ends: 383 [2019-01-01 21:00:34,892 INFO L226 Difference]: Without dead ends: 342 [2019-01-01 21:00:34,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 289 SyntacticMatches, 22 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1415 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=649, Invalid=1801, Unknown=0, NotChecked=0, Total=2450 [2019-01-01 21:00:34,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-01-01 21:00:34,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 336. [2019-01-01 21:00:34,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-01-01 21:00:34,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 354 transitions. [2019-01-01 21:00:34,910 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 354 transitions. Word has length 313 [2019-01-01 21:00:34,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:00:34,913 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 354 transitions. [2019-01-01 21:00:34,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-01 21:00:34,913 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 354 transitions. [2019-01-01 21:00:34,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-01-01 21:00:34,919 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:00:34,920 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1] [2019-01-01 21:00:34,920 INFO L423 AbstractCegarLoop]: === Iteration 33 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:00:34,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:00:34,921 INFO L82 PathProgramCache]: Analyzing trace with hash 117652873, now seen corresponding path program 23 times [2019-01-01 21:00:34,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:00:34,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:00:34,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:34,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:00:34,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:00:36,721 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-01 21:00:36,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:00:36,722 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-01 21:00:36,737 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 21:00:36,837 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2019-01-01 21:00:36,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:00:36,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:00:37,794 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-01 21:00:37,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:00:37,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 51 [2019-01-01 21:00:37,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-01 21:00:37,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-01 21:00:37,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=701, Invalid=1951, Unknown=0, NotChecked=0, Total=2652 [2019-01-01 21:00:37,816 INFO L87 Difference]: Start difference. First operand 336 states and 354 transitions. Second operand 52 states. [2019-01-01 21:00:38,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:00:38,144 INFO L93 Difference]: Finished difference Result 390 states and 420 transitions. [2019-01-01 21:00:38,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-01 21:00:38,146 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 290 [2019-01-01 21:00:38,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:00:38,149 INFO L225 Difference]: With dead ends: 390 [2019-01-01 21:00:38,149 INFO L226 Difference]: Without dead ends: 349 [2019-01-01 21:00:38,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 265 SyntacticMatches, 23 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1537 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=701, Invalid=1951, Unknown=0, NotChecked=0, Total=2652 [2019-01-01 21:00:38,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-01-01 21:00:38,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 343. [2019-01-01 21:00:38,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-01-01 21:00:38,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 361 transitions. [2019-01-01 21:00:38,164 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 361 transitions. Word has length 290 [2019-01-01 21:00:38,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:00:38,164 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 361 transitions. [2019-01-01 21:00:38,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-01 21:00:38,164 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 361 transitions. [2019-01-01 21:00:38,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-01-01 21:00:38,170 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:00:38,170 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 25, 25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1] [2019-01-01 21:00:38,172 INFO L423 AbstractCegarLoop]: === Iteration 34 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:00:38,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:00:38,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1252532292, now seen corresponding path program 24 times [2019-01-01 21:00:38,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:00:38,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:00:38,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:38,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:00:38,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:00:39,293 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-01 21:00:39,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:00:39,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 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-01 21:00:39,305 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 21:00:39,424 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2019-01-01 21:00:39,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:00:39,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:00:40,299 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-01 21:00:40,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:00:40,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 53 [2019-01-01 21:00:40,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-01 21:00:40,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-01 21:00:40,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2019-01-01 21:00:40,324 INFO L87 Difference]: Start difference. First operand 343 states and 361 transitions. Second operand 54 states. [2019-01-01 21:00:40,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:00:40,686 INFO L93 Difference]: Finished difference Result 397 states and 427 transitions. [2019-01-01 21:00:40,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-01 21:00:40,688 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 337 [2019-01-01 21:00:40,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:00:40,691 INFO L225 Difference]: With dead ends: 397 [2019-01-01 21:00:40,691 INFO L226 Difference]: Without dead ends: 356 [2019-01-01 21:00:40,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 311 SyntacticMatches, 24 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1664 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2019-01-01 21:00:40,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-01-01 21:00:40,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 350. [2019-01-01 21:00:40,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-01-01 21:00:40,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 368 transitions. [2019-01-01 21:00:40,702 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 368 transitions. Word has length 337 [2019-01-01 21:00:40,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:00:40,703 INFO L480 AbstractCegarLoop]: Abstraction has 350 states and 368 transitions. [2019-01-01 21:00:40,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-01 21:00:40,703 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 368 transitions. [2019-01-01 21:00:40,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-01-01 21:00:40,710 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:00:40,710 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 26, 26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1] [2019-01-01 21:00:40,710 INFO L423 AbstractCegarLoop]: === Iteration 35 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:00:40,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:00:40,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1465194610, now seen corresponding path program 25 times [2019-01-01 21:00:40,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:00:40,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:00:40,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:40,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:00:40,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:00:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:00:42,518 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-01 21:00:42,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:00:42,518 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-01 21:00:42,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:00:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:00:42,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:00:45,739 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-01 21:00:45,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:00:45,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 46] total 98 [2019-01-01 21:00:45,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-01 21:00:45,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-01 21:00:45,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=8282, Unknown=0, NotChecked=0, Total=9506 [2019-01-01 21:00:45,765 INFO L87 Difference]: Start difference. First operand 350 states and 368 transitions. Second operand 98 states. [2019-01-01 21:01:04,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:01:04,489 INFO L93 Difference]: Finished difference Result 599 states and 627 transitions. [2019-01-01 21:01:04,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-01-01 21:01:04,491 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 349 [2019-01-01 21:01:04,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:01:04,494 INFO L225 Difference]: With dead ends: 599 [2019-01-01 21:01:04,494 INFO L226 Difference]: Without dead ends: 359 [2019-01-01 21:01:04,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14185 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=8364, Invalid=49958, Unknown=0, NotChecked=0, Total=58322 [2019-01-01 21:01:04,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-01-01 21:01:04,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 350. [2019-01-01 21:01:04,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-01-01 21:01:04,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 359 transitions. [2019-01-01 21:01:04,519 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 359 transitions. Word has length 349 [2019-01-01 21:01:04,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:01:04,520 INFO L480 AbstractCegarLoop]: Abstraction has 350 states and 359 transitions. [2019-01-01 21:01:04,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-01 21:01:04,520 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 359 transitions. [2019-01-01 21:01:04,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-01-01 21:01:04,525 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:01:04,526 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 27, 26, 26, 26, 26, 1, 1, 1, 1, 1] [2019-01-01 21:01:04,526 INFO L423 AbstractCegarLoop]: === Iteration 36 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:01:04,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:01:04,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1859894583, now seen corresponding path program 26 times [2019-01-01 21:01:04,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:01:04,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:01:04,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:01:04,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:01:04,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:01:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:01:05,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4188 backedges. 0 proven. 2379 refuted. 0 times theorem prover too weak. 1809 trivial. 0 not checked. [2019-01-01 21:01:05,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:01:05,716 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-01 21:01:05,740 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:01:05,830 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:01:05,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:01:05,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:01:06,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4188 backedges. 0 proven. 2379 refuted. 0 times theorem prover too weak. 1809 trivial. 0 not checked. [2019-01-01 21:01:06,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:01:06,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 57 [2019-01-01 21:01:06,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-01 21:01:06,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-01 21:01:06,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=869, Invalid=2437, Unknown=0, NotChecked=0, Total=3306 [2019-01-01 21:01:06,785 INFO L87 Difference]: Start difference. First operand 350 states and 359 transitions. Second operand 58 states. [2019-01-01 21:01:07,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:01:07,097 INFO L93 Difference]: Finished difference Result 375 states and 387 transitions. [2019-01-01 21:01:07,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-01 21:01:07,100 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 326 [2019-01-01 21:01:07,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:01:07,103 INFO L225 Difference]: With dead ends: 375 [2019-01-01 21:01:07,104 INFO L226 Difference]: Without dead ends: 327 [2019-01-01 21:01:07,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 298 SyntacticMatches, 26 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1933 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=869, Invalid=2437, Unknown=0, NotChecked=0, Total=3306 [2019-01-01 21:01:07,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-01-01 21:01:07,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2019-01-01 21:01:07,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-01-01 21:01:07,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 331 transitions. [2019-01-01 21:01:07,120 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 331 transitions. Word has length 326 [2019-01-01 21:01:07,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:01:07,123 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 331 transitions. [2019-01-01 21:01:07,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-01 21:01:07,123 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 331 transitions. [2019-01-01 21:01:07,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-01-01 21:01:07,128 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:01:07,129 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1] [2019-01-01 21:01:07,129 INFO L423 AbstractCegarLoop]: === Iteration 37 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:01:07,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:01:07,129 INFO L82 PathProgramCache]: Analyzing trace with hash -195404535, now seen corresponding path program 27 times [2019-01-01 21:01:07,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:01:07,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:01:07,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:01:07,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:01:07,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:01:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:01:08,919 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-01 21:01:08,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:01:08,920 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-01 21:01:08,942 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 21:01:09,136 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-01 21:01:09,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:01:09,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:01:10,408 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-01 21:01:10,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:01:10,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 59 [2019-01-01 21:01:10,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-01 21:01:10,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-01 21:01:10,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=929, Invalid=2611, Unknown=0, NotChecked=0, Total=3540 [2019-01-01 21:01:10,430 INFO L87 Difference]: Start difference. First operand 325 states and 331 transitions. Second operand 60 states. [2019-01-01 21:01:10,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:01:10,708 INFO L93 Difference]: Finished difference Result 342 states and 349 transitions. [2019-01-01 21:01:10,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-01 21:01:10,710 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 338 [2019-01-01 21:01:10,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:01:10,713 INFO L225 Difference]: With dead ends: 342 [2019-01-01 21:01:10,713 INFO L226 Difference]: Without dead ends: 294 [2019-01-01 21:01:10,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 309 SyntacticMatches, 27 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2075 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=929, Invalid=2611, Unknown=0, NotChecked=0, Total=3540 [2019-01-01 21:01:10,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-01-01 21:01:10,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2019-01-01 21:01:10,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-01-01 21:01:10,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 296 transitions. [2019-01-01 21:01:10,723 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 296 transitions. Word has length 338 [2019-01-01 21:01:10,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:01:10,724 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 296 transitions. [2019-01-01 21:01:10,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-01 21:01:10,724 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 296 transitions. [2019-01-01 21:01:10,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-01-01 21:01:10,726 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:01:10,727 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 29, 29, 29, 28, 28, 28, 28, 1, 1, 1, 1, 1] [2019-01-01 21:01:10,727 INFO L423 AbstractCegarLoop]: === Iteration 38 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:01:10,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:01:10,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1815869028, now seen corresponding path program 28 times [2019-01-01 21:01:10,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:01:10,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:01:10,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:01:10,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:01:10,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:01:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:01:11,999 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-01 21:01:11,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:01:11,999 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-01 21:01:12,022 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 21:01:12,112 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 21:01:12,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:01:12,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:01:13,274 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-01 21:01:13,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:01:13,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 61 [2019-01-01 21:01:13,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-01 21:01:13,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-01 21:01:13,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=2791, Unknown=0, NotChecked=0, Total=3782 [2019-01-01 21:01:13,297 INFO L87 Difference]: Start difference. First operand 293 states and 296 transitions. Second operand 62 states. [2019-01-01 21:01:14,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:01:14,097 INFO L93 Difference]: Finished difference Result 302 states and 304 transitions. [2019-01-01 21:01:14,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-01 21:01:14,098 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 355 [2019-01-01 21:01:14,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:01:14,101 INFO L225 Difference]: With dead ends: 302 [2019-01-01 21:01:14,101 INFO L226 Difference]: Without dead ends: 254 [2019-01-01 21:01:14,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 325 SyntacticMatches, 28 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2222 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=991, Invalid=2791, Unknown=0, NotChecked=0, Total=3782 [2019-01-01 21:01:14,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-01-01 21:01:14,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2019-01-01 21:01:14,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-01-01 21:01:14,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2019-01-01 21:01:14,110 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 355 [2019-01-01 21:01:14,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:01:14,111 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2019-01-01 21:01:14,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-01 21:01:14,111 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2019-01-01 21:01:14,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-01-01 21:01:14,116 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:01:14,116 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1] [2019-01-01 21:01:14,116 INFO L423 AbstractCegarLoop]: === Iteration 39 === [hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:01:14,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:01:14,122 INFO L82 PathProgramCache]: Analyzing trace with hash 139723977, now seen corresponding path program 29 times [2019-01-01 21:01:14,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:01:14,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:01:14,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:01:14,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:01:14,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:01:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:01:15,480 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-01 21:01:15,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:01:15,480 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-01 21:01:15,492 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 21:01:15,636 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2019-01-01 21:01:15,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:01:15,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:01:16,962 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-01 21:01:16,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:01:16,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 63 [2019-01-01 21:01:16,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-01 21:01:16,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-01 21:01:16,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=2977, Unknown=0, NotChecked=0, Total=4032 [2019-01-01 21:01:16,987 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand 64 states. [2019-01-01 21:01:17,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:01:17,278 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2019-01-01 21:01:17,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-01 21:01:17,280 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 362 [2019-01-01 21:01:17,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:01:17,281 INFO L225 Difference]: With dead ends: 254 [2019-01-01 21:01:17,282 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 21:01:17,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 331 SyntacticMatches, 29 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2374 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1055, Invalid=2977, Unknown=0, NotChecked=0, Total=4032 [2019-01-01 21:01:17,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 21:01:17,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 21:01:17,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 21:01:17,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 21:01:17,285 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 362 [2019-01-01 21:01:17,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:01:17,285 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:01:17,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-01 21:01:17,285 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:01:17,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 21:01:17,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-01 21:01:17,594 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 20 [2019-01-01 21:01:17,598 INFO L448 ceAbstractionStarter]: For program point hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 21:01:17,599 INFO L448 ceAbstractionStarter]: For program point hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 21:01:17,599 INFO L448 ceAbstractionStarter]: For program point hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 21:01:17,599 INFO L448 ceAbstractionStarter]: For program point hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 21:01:17,599 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-01-01 21:01:17,599 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-01-01 21:01:17,600 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-01 21:01:17,600 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 19) no Hoare annotation was computed. [2019-01-01 21:01:17,600 INFO L448 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-01-01 21:01:17,600 INFO L448 ceAbstractionStarter]: For program point L20-4(line 20) no Hoare annotation was computed. [2019-01-01 21:01:17,600 INFO L448 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2019-01-01 21:01:17,600 INFO L448 ceAbstractionStarter]: For program point L20-6(line 20) no Hoare annotation was computed. [2019-01-01 21:01:17,600 INFO L448 ceAbstractionStarter]: For program point hanoiEXIT(lines 16 21) no Hoare annotation was computed. [2019-01-01 21:01:17,601 INFO L448 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2019-01-01 21:01:17,601 INFO L451 ceAbstractionStarter]: At program point hanoiENTRY(lines 16 21) the Hoare annotation is: true [2019-01-01 21:01:17,601 INFO L448 ceAbstractionStarter]: For program point hanoiFINAL(lines 16 21) no Hoare annotation was computed. [2019-01-01 21:01:17,601 INFO L448 ceAbstractionStarter]: For program point hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 21:01:17,601 INFO L448 ceAbstractionStarter]: For program point hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 21:01:17,601 INFO L448 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-01-01 21:01:17,601 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-01 21:01:17,601 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 34) no Hoare annotation was computed. [2019-01-01 21:01:17,601 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-01 21:01:17,602 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-01 21:01:17,602 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-01 21:01:17,602 INFO L448 ceAbstractionStarter]: For program point L29-1(line 29) no Hoare annotation was computed. [2019-01-01 21:01:17,602 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2019-01-01 21:01:17,602 INFO L451 ceAbstractionStarter]: At program point L24(lines 24 35) the Hoare annotation is: true [2019-01-01 21:01:17,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 09:01:17 BoogieIcfgContainer [2019-01-01 21:01:17,609 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 21:01:17,610 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:01:17,610 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:01:17,610 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:01:17,611 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:59:49" (3/4) ... [2019-01-01 21:01:17,616 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 21:01:17,626 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure hanoi [2019-01-01 21:01:17,634 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-01 21:01:17,634 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-01 21:01:17,691 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 21:01:17,691 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:01:17,694 INFO L168 Benchmark]: Toolchain (without parser) took 89555.53 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 741.3 MB). Free memory was 951.4 MB in the beginning and 1.6 GB in the end (delta: -675.7 MB). Peak memory consumption was 65.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:01:17,695 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:01:17,696 INFO L168 Benchmark]: CACSL2BoogieTranslator took 361.74 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:01:17,697 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.73 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:01:17,700 INFO L168 Benchmark]: Boogie Preprocessor took 30.12 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:01:17,701 INFO L168 Benchmark]: RCFGBuilder took 449.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -152.4 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-01-01 21:01:17,701 INFO L168 Benchmark]: TraceAbstraction took 88576.29 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 617.6 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -534.0 MB). Peak memory consumption was 83.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:01:17,702 INFO L168 Benchmark]: Witness Printer took 81.71 ms. Allocated memory is still 1.8 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:01:17,711 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 361.74 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.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 48.73 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.12 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 449.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -152.4 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 88576.29 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 617.6 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -534.0 MB). Peak memory consumption was 83.6 MB. Max. memory is 11.5 GB. * Witness Printer took 81.71 ms. Allocated memory is still 1.8 GB. Free memory is still 1.6 GB. There was no memory consumed. 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, 88.4s OverallTime, 39 OverallIterations, 34 TraceHistogramMax, 31.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 636 SDtfs, 3454 SDslu, 10787 SDs, 0 SdLazy, 22484 SolverSat, 976 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7371 GetRequests, 5676 SyntacticMatches, 414 SemanticMatches, 1281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38009 ImplicationChecksByTransitivity, 53.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.5s 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.6s SatisfiabilityAnalysisTime, 50.3s InterpolantComputationTime, 12407 NumberOfCodeBlocks, 12312 NumberOfCodeBlocksAsserted, 351 NumberOfCheckSat, 12332 ConstructedInterpolants, 0 QuantifiedInterpolants, 6541650 SizeOfPredicates, 62 NumberOfNonLiveVariables, 10533 ConjunctsInSsa, 1048 ConjunctsInUnsatCore, 75 InterpolantComputations, 4 PerfectInterpolantSequences, 64318/123956 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...