./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-numeric/recHanoi02_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/termination-numeric/recHanoi02_true-termination_true-no-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5562cc301d5faa8ad8777fb25a4973bec89fa1c5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 01:42:07,822 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 01:42:07,824 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 01:42:07,835 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 01:42:07,836 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 01:42:07,837 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 01:42:07,838 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 01:42:07,840 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 01:42:07,842 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 01:42:07,843 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 01:42:07,844 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 01:42:07,844 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 01:42:07,845 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 01:42:07,847 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 01:42:07,848 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 01:42:07,848 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 01:42:07,850 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 01:42:07,852 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 01:42:07,854 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 01:42:07,855 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 01:42:07,856 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 01:42:07,858 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 01:42:07,861 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 01:42:07,861 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 01:42:07,861 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 01:42:07,862 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 01:42:07,863 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 01:42:07,864 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 01:42:07,865 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 01:42:07,866 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 01:42:07,867 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 01:42:07,867 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 01:42:07,868 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 01:42:07,868 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 01:42:07,869 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 01:42:07,870 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 01:42:07,870 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-14 01:42:07,886 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 01:42:07,886 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 01:42:07,887 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 01:42:07,887 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 01:42:07,887 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 01:42:07,888 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 01:42:07,888 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 01:42:07,889 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 01:42:07,889 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 01:42:07,889 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 01:42:07,889 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 01:42:07,889 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 01:42:07,889 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-14 01:42:07,890 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 01:42:07,891 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 01:42:07,891 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 01:42:07,891 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 01:42:07,891 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 01:42:07,891 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 01:42:07,891 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 01:42:07,892 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 01:42:07,892 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 01:42:07,892 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 01:42:07,892 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 01:42:07,892 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 01:42:07,892 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 01:42:07,893 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 01:42:07,894 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5562cc301d5faa8ad8777fb25a4973bec89fa1c5 [2019-01-14 01:42:07,938 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 01:42:07,954 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 01:42:07,959 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 01:42:07,962 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 01:42:07,963 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 01:42:07,964 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-numeric/recHanoi02_true-termination_true-no-overflow.c [2019-01-14 01:42:08,029 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ff0ee8dc/8828327d33b34cc9957fef1f0f8b1cae/FLAGefdaa90f0 [2019-01-14 01:42:08,410 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 01:42:08,411 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-numeric/recHanoi02_true-termination_true-no-overflow.c [2019-01-14 01:42:08,417 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ff0ee8dc/8828327d33b34cc9957fef1f0f8b1cae/FLAGefdaa90f0 [2019-01-14 01:42:08,810 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ff0ee8dc/8828327d33b34cc9957fef1f0f8b1cae [2019-01-14 01:42:08,813 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 01:42:08,815 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 01:42:08,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 01:42:08,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 01:42:08,820 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 01:42:08,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:42:08" (1/1) ... [2019-01-14 01:42:08,824 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d1a718d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:42:08, skipping insertion in model container [2019-01-14 01:42:08,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:42:08" (1/1) ... [2019-01-14 01:42:08,832 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 01:42:08,850 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 01:42:09,036 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:42:09,041 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 01:42:09,063 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:42:09,082 INFO L195 MainTranslator]: Completed translation [2019-01-14 01:42:09,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:42:09 WrapperNode [2019-01-14 01:42:09,083 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 01:42:09,086 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 01:42:09,086 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 01:42:09,086 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 01:42:09,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:42:09" (1/1) ... [2019-01-14 01:42:09,103 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:42:09" (1/1) ... [2019-01-14 01:42:09,123 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 01:42:09,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 01:42:09,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 01:42:09,124 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 01:42:09,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:42:09" (1/1) ... [2019-01-14 01:42:09,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:42:09" (1/1) ... [2019-01-14 01:42:09,134 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:42:09" (1/1) ... [2019-01-14 01:42:09,135 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:42:09" (1/1) ... [2019-01-14 01:42:09,137 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:42:09" (1/1) ... [2019-01-14 01:42:09,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:42:09" (1/1) ... [2019-01-14 01:42:09,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:42:09" (1/1) ... [2019-01-14 01:42:09,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 01:42:09,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 01:42:09,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 01:42:09,143 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 01:42:09,144 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:42:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 01:42:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2019-01-14 01:42:09,271 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2019-01-14 01:42:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 01:42:09,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 01:42:09,525 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 01:42:09,525 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 01:42:09,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:42:09 BoogieIcfgContainer [2019-01-14 01:42:09,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 01:42:09,527 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 01:42:09,528 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 01:42:09,530 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 01:42:09,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 01:42:08" (1/3) ... [2019-01-14 01:42:09,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e2b683e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:42:09, skipping insertion in model container [2019-01-14 01:42:09,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:42:09" (2/3) ... [2019-01-14 01:42:09,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e2b683e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:42:09, skipping insertion in model container [2019-01-14 01:42:09,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:42:09" (3/3) ... [2019-01-14 01:42:09,534 INFO L112 eAbstractionObserver]: Analyzing ICFG recHanoi02_true-termination_true-no-overflow.c [2019-01-14 01:42:09,544 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 01:42:09,552 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-14 01:42:09,569 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-14 01:42:09,596 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 01:42:09,597 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 01:42:09,597 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 01:42:09,597 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 01:42:09,597 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 01:42:09,597 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 01:42:09,598 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 01:42:09,598 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 01:42:09,598 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 01:42:09,618 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-01-14 01:42:09,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-14 01:42:09,624 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:42:09,625 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-14 01:42:09,627 INFO L423 AbstractCegarLoop]: === Iteration 1 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:42:09,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:42:09,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1513948958, now seen corresponding path program 1 times [2019-01-14 01:42:09,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:42:09,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:42:09,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:09,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:42:09,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:10,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:42:10,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:42:10,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 01:42:10,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:42:10,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:42:10,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:42:10,035 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2019-01-14 01:42:10,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:42:10,207 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-01-14 01:42:10,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 01:42:10,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-01-14 01:42:10,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:42:10,220 INFO L225 Difference]: With dead ends: 33 [2019-01-14 01:42:10,220 INFO L226 Difference]: Without dead ends: 20 [2019-01-14 01:42:10,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:42:10,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-14 01:42:10,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-14 01:42:10,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-14 01:42:10,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-01-14 01:42:10,257 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 6 [2019-01-14 01:42:10,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:42:10,258 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-01-14 01:42:10,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:42:10,258 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-01-14 01:42:10,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-14 01:42:10,259 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:42:10,259 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:42:10,260 INFO L423 AbstractCegarLoop]: === Iteration 2 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:42:10,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:42:10,260 INFO L82 PathProgramCache]: Analyzing trace with hash -312222520, now seen corresponding path program 1 times [2019-01-14 01:42:10,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:42:10,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:42:10,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:10,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:42:10,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:10,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:42:10,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:42:10,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 01:42:10,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:42:10,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:42:10,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:42:10,350 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2019-01-14 01:42:10,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:42:10,523 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-01-14 01:42:10,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:42:10,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-14 01:42:10,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:42:10,529 INFO L225 Difference]: With dead ends: 39 [2019-01-14 01:42:10,529 INFO L226 Difference]: Without dead ends: 36 [2019-01-14 01:42:10,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:42:10,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-14 01:42:10,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2019-01-14 01:42:10,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-14 01:42:10,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-01-14 01:42:10,541 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 7 [2019-01-14 01:42:10,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:42:10,542 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-01-14 01:42:10,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:42:10,542 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-01-14 01:42:10,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 01:42:10,545 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:42:10,545 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 01:42:10,545 INFO L423 AbstractCegarLoop]: === Iteration 3 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:42:10,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:42:10,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1144431293, now seen corresponding path program 1 times [2019-01-14 01:42:10,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:42:10,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:42:10,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:10,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:42:10,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:10,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:42:10,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:42:10,780 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:42:10,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:42:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:10,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:42:10,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:42:10,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:42:10,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 01:42:10,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 01:42:10,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 01:42:10,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:42:10,886 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 7 states. [2019-01-14 01:42:11,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:42:11,193 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-01-14 01:42:11,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 01:42:11,195 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-14 01:42:11,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:42:11,196 INFO L225 Difference]: With dead ends: 55 [2019-01-14 01:42:11,196 INFO L226 Difference]: Without dead ends: 54 [2019-01-14 01:42:11,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:42:11,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-14 01:42:11,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 42. [2019-01-14 01:42:11,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-14 01:42:11,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2019-01-14 01:42:11,210 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 12 [2019-01-14 01:42:11,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:42:11,210 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-01-14 01:42:11,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 01:42:11,211 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2019-01-14 01:42:11,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 01:42:11,211 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:42:11,212 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:42:11,213 INFO L423 AbstractCegarLoop]: === Iteration 4 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:42:11,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:42:11,213 INFO L82 PathProgramCache]: Analyzing trace with hash -287349001, now seen corresponding path program 1 times [2019-01-14 01:42:11,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:42:11,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:42:11,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:11,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:42:11,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 01:42:11,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:42:11,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 01:42:11,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 01:42:11,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 01:42:11,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:42:11,332 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand 4 states. [2019-01-14 01:42:11,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:42:11,415 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2019-01-14 01:42:11,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 01:42:11,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-01-14 01:42:11,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:42:11,418 INFO L225 Difference]: With dead ends: 65 [2019-01-14 01:42:11,419 INFO L226 Difference]: Without dead ends: 54 [2019-01-14 01:42:11,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:42:11,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-14 01:42:11,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-01-14 01:42:11,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-14 01:42:11,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2019-01-14 01:42:11,430 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 14 [2019-01-14 01:42:11,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:42:11,431 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2019-01-14 01:42:11,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 01:42:11,431 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2019-01-14 01:42:11,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 01:42:11,432 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:42:11,432 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1] [2019-01-14 01:42:11,433 INFO L423 AbstractCegarLoop]: === Iteration 5 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:42:11,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:42:11,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1656222120, now seen corresponding path program 2 times [2019-01-14 01:42:11,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:42:11,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:42:11,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:11,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:42:11,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:11,621 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:42:11,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:42:11,622 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:42:11,638 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:42:11,653 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:42:11,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:42:11,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:42:11,664 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:42:11,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:42:11,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-14 01:42:11,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 01:42:11,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 01:42:11,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:42:11,684 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 9 states. [2019-01-14 01:42:12,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:42:12,145 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2019-01-14 01:42:12,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 01:42:12,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-01-14 01:42:12,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:42:12,148 INFO L225 Difference]: With dead ends: 86 [2019-01-14 01:42:12,148 INFO L226 Difference]: Without dead ends: 85 [2019-01-14 01:42:12,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-01-14 01:42:12,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-14 01:42:12,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2019-01-14 01:42:12,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-14 01:42:12,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2019-01-14 01:42:12,160 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 17 [2019-01-14 01:42:12,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:42:12,160 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2019-01-14 01:42:12,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 01:42:12,161 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2019-01-14 01:42:12,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 01:42:12,161 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:42:12,162 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1] [2019-01-14 01:42:12,162 INFO L423 AbstractCegarLoop]: === Iteration 6 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:42:12,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:42:12,163 INFO L82 PathProgramCache]: Analyzing trace with hash 438260835, now seen corresponding path program 3 times [2019-01-14 01:42:12,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:42:12,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:42:12,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:12,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:42:12,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:12,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:12,422 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:42:12,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:42:12,422 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:42:12,431 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:42:12,443 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 01:42:12,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:42:12,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:42:12,456 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:42:12,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:42:12,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-14 01:42:12,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 01:42:12,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 01:42:12,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-01-14 01:42:12,483 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand 11 states. [2019-01-14 01:42:13,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:42:13,075 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2019-01-14 01:42:13,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 01:42:13,077 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-01-14 01:42:13,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:42:13,078 INFO L225 Difference]: With dead ends: 109 [2019-01-14 01:42:13,078 INFO L226 Difference]: Without dead ends: 108 [2019-01-14 01:42:13,080 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-14 01:42:13,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-14 01:42:13,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 92. [2019-01-14 01:42:13,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-14 01:42:13,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 112 transitions. [2019-01-14 01:42:13,093 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 112 transitions. Word has length 22 [2019-01-14 01:42:13,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:42:13,093 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 112 transitions. [2019-01-14 01:42:13,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 01:42:13,093 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 112 transitions. [2019-01-14 01:42:13,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 01:42:13,095 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:42:13,096 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1] [2019-01-14 01:42:13,096 INFO L423 AbstractCegarLoop]: === Iteration 7 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:42:13,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:42:13,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1696558728, now seen corresponding path program 4 times [2019-01-14 01:42:13,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:42:13,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:42:13,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:13,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:42:13,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:13,351 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:42:13,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:42:13,351 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:42:13,362 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:42:13,393 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:42:13,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:42:13,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:42:13,406 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:42:13,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:42:13,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-01-14 01:42:13,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 01:42:13,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 01:42:13,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-01-14 01:42:13,430 INFO L87 Difference]: Start difference. First operand 92 states and 112 transitions. Second operand 13 states. [2019-01-14 01:42:13,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:42:13,697 INFO L93 Difference]: Finished difference Result 132 states and 137 transitions. [2019-01-14 01:42:13,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-14 01:42:13,702 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2019-01-14 01:42:13,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:42:13,704 INFO L225 Difference]: With dead ends: 132 [2019-01-14 01:42:13,704 INFO L226 Difference]: Without dead ends: 131 [2019-01-14 01:42:13,705 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-14 01:42:13,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-14 01:42:13,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 111. [2019-01-14 01:42:13,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-14 01:42:13,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 136 transitions. [2019-01-14 01:42:13,717 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 136 transitions. Word has length 27 [2019-01-14 01:42:13,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:42:13,718 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 136 transitions. [2019-01-14 01:42:13,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 01:42:13,718 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 136 transitions. [2019-01-14 01:42:13,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 01:42:13,719 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:42:13,719 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:42:13,720 INFO L423 AbstractCegarLoop]: === Iteration 8 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:42:13,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:42:13,720 INFO L82 PathProgramCache]: Analyzing trace with hash -563967927, now seen corresponding path program 1 times [2019-01-14 01:42:13,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:42:13,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:42:13,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:13,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:42:13,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:13,802 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 01:42:13,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:42:13,803 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:42:13,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:42:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:13,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:42:13,895 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 01:42:13,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:42:13,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-01-14 01:42:13,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 01:42:13,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 01:42:13,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:42:13,915 INFO L87 Difference]: Start difference. First operand 111 states and 136 transitions. Second operand 8 states. [2019-01-14 01:42:13,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:42:13,991 INFO L93 Difference]: Finished difference Result 153 states and 200 transitions. [2019-01-14 01:42:13,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 01:42:13,992 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-01-14 01:42:13,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:42:13,995 INFO L225 Difference]: With dead ends: 153 [2019-01-14 01:42:13,995 INFO L226 Difference]: Without dead ends: 151 [2019-01-14 01:42:13,996 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-14 01:42:13,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-01-14 01:42:14,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 145. [2019-01-14 01:42:14,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-01-14 01:42:14,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 177 transitions. [2019-01-14 01:42:14,011 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 177 transitions. Word has length 26 [2019-01-14 01:42:14,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:42:14,011 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 177 transitions. [2019-01-14 01:42:14,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 01:42:14,011 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 177 transitions. [2019-01-14 01:42:14,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 01:42:14,012 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:42:14,012 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:42:14,013 INFO L423 AbstractCegarLoop]: === Iteration 9 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:42:14,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:42:14,013 INFO L82 PathProgramCache]: Analyzing trace with hash -303136509, now seen corresponding path program 1 times [2019-01-14 01:42:14,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:42:14,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:42:14,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:14,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:42:14,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:14,087 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 01:42:14,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:42:14,088 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:42:14,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:42:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:14,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:42:14,191 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 01:42:14,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 01:42:14,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2019-01-14 01:42:14,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 01:42:14,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 01:42:14,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:42:14,221 INFO L87 Difference]: Start difference. First operand 145 states and 177 transitions. Second operand 8 states. [2019-01-14 01:42:14,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:42:14,283 INFO L93 Difference]: Finished difference Result 145 states and 177 transitions. [2019-01-14 01:42:14,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:42:14,285 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-01-14 01:42:14,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:42:14,287 INFO L225 Difference]: With dead ends: 145 [2019-01-14 01:42:14,287 INFO L226 Difference]: Without dead ends: 129 [2019-01-14 01:42:14,288 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-14 01:42:14,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-14 01:42:14,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-01-14 01:42:14,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-14 01:42:14,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 144 transitions. [2019-01-14 01:42:14,298 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 144 transitions. Word has length 27 [2019-01-14 01:42:14,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:42:14,298 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 144 transitions. [2019-01-14 01:42:14,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 01:42:14,298 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 144 transitions. [2019-01-14 01:42:14,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-14 01:42:14,299 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:42:14,299 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1] [2019-01-14 01:42:14,300 INFO L423 AbstractCegarLoop]: === Iteration 10 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:42:14,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:42:14,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1757224061, now seen corresponding path program 5 times [2019-01-14 01:42:14,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:42:14,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:42:14,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:14,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:42:14,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:14,658 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:42:14,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:42:14,658 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:42:14,687 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 01:42:14,723 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-14 01:42:14,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:42:14,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:42:14,739 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:42:14,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:42:14,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-01-14 01:42:14,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-14 01:42:14,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-14 01:42:14,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-01-14 01:42:14,760 INFO L87 Difference]: Start difference. First operand 129 states and 144 transitions. Second operand 15 states. [2019-01-14 01:42:15,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:42:15,077 INFO L93 Difference]: Finished difference Result 167 states and 173 transitions. [2019-01-14 01:42:15,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-14 01:42:15,078 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2019-01-14 01:42:15,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:42:15,080 INFO L225 Difference]: With dead ends: 167 [2019-01-14 01:42:15,081 INFO L226 Difference]: Without dead ends: 166 [2019-01-14 01:42:15,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2019-01-14 01:42:15,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-14 01:42:15,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 154. [2019-01-14 01:42:15,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-01-14 01:42:15,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 172 transitions. [2019-01-14 01:42:15,092 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 172 transitions. Word has length 32 [2019-01-14 01:42:15,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:42:15,094 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 172 transitions. [2019-01-14 01:42:15,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-14 01:42:15,094 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 172 transitions. [2019-01-14 01:42:15,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-14 01:42:15,096 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:42:15,096 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1] [2019-01-14 01:42:15,097 INFO L423 AbstractCegarLoop]: === Iteration 11 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:42:15,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:42:15,097 INFO L82 PathProgramCache]: Analyzing trace with hash -512208024, now seen corresponding path program 6 times [2019-01-14 01:42:15,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:42:15,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:42:15,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:15,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:42:15,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:15,571 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:42:15,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:42:15,572 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:42:15,580 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 01:42:15,616 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-14 01:42:15,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:42:15,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:42:15,691 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-14 01:42:15,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:42:15,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 17 [2019-01-14 01:42:15,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-14 01:42:15,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-14 01:42:15,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-01-14 01:42:15,717 INFO L87 Difference]: Start difference. First operand 154 states and 172 transitions. Second operand 18 states. [2019-01-14 01:42:15,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:42:15,787 INFO L93 Difference]: Finished difference Result 154 states and 172 transitions. [2019-01-14 01:42:15,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:42:15,793 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2019-01-14 01:42:15,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:42:15,795 INFO L225 Difference]: With dead ends: 154 [2019-01-14 01:42:15,797 INFO L226 Difference]: Without dead ends: 153 [2019-01-14 01:42:15,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-01-14 01:42:15,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-01-14 01:42:15,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-01-14 01:42:15,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-01-14 01:42:15,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 171 transitions. [2019-01-14 01:42:15,817 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 171 transitions. Word has length 37 [2019-01-14 01:42:15,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:42:15,818 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 171 transitions. [2019-01-14 01:42:15,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-14 01:42:15,818 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 171 transitions. [2019-01-14 01:42:15,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-14 01:42:15,820 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:42:15,826 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-14 01:42:15,827 INFO L423 AbstractCegarLoop]: === Iteration 12 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:42:15,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:42:15,828 INFO L82 PathProgramCache]: Analyzing trace with hash 867149367, now seen corresponding path program 2 times [2019-01-14 01:42:15,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:42:15,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:42:15,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:15,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:42:15,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:15,931 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-14 01:42:15,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:42:15,931 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:42:15,941 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:42:15,955 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:42:15,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:42:15,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:42:16,061 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-14 01:42:16,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:42:16,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-01-14 01:42:16,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 01:42:16,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 01:42:16,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:42:16,082 INFO L87 Difference]: Start difference. First operand 153 states and 171 transitions. Second operand 10 states. [2019-01-14 01:42:16,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:42:16,134 INFO L93 Difference]: Finished difference Result 207 states and 237 transitions. [2019-01-14 01:42:16,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 01:42:16,135 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2019-01-14 01:42:16,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:42:16,137 INFO L225 Difference]: With dead ends: 207 [2019-01-14 01:42:16,137 INFO L226 Difference]: Without dead ends: 185 [2019-01-14 01:42:16,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:42:16,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-01-14 01:42:16,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 179. [2019-01-14 01:42:16,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-01-14 01:42:16,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 197 transitions. [2019-01-14 01:42:16,153 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 197 transitions. Word has length 38 [2019-01-14 01:42:16,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:42:16,153 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 197 transitions. [2019-01-14 01:42:16,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 01:42:16,153 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 197 transitions. [2019-01-14 01:42:16,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-14 01:42:16,157 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:42:16,157 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2019-01-14 01:42:16,157 INFO L423 AbstractCegarLoop]: === Iteration 13 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:42:16,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:42:16,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1066180599, now seen corresponding path program 3 times [2019-01-14 01:42:16,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:42:16,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:42:16,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:16,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:42:16,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:16,279 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-01-14 01:42:16,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:42:16,279 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:42:16,289 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:42:16,306 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 01:42:16,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:42:16,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:42:16,402 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-01-14 01:42:16,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:42:16,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-01-14 01:42:16,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 01:42:16,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 01:42:16,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-01-14 01:42:16,422 INFO L87 Difference]: Start difference. First operand 179 states and 197 transitions. Second operand 12 states. [2019-01-14 01:42:16,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:42:16,493 INFO L93 Difference]: Finished difference Result 233 states and 263 transitions. [2019-01-14 01:42:16,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 01:42:16,494 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2019-01-14 01:42:16,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:42:16,496 INFO L225 Difference]: With dead ends: 233 [2019-01-14 01:42:16,496 INFO L226 Difference]: Without dead ends: 204 [2019-01-14 01:42:16,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-01-14 01:42:16,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-01-14 01:42:16,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 198. [2019-01-14 01:42:16,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-01-14 01:42:16,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 216 transitions. [2019-01-14 01:42:16,510 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 216 transitions. Word has length 50 [2019-01-14 01:42:16,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:42:16,510 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 216 transitions. [2019-01-14 01:42:16,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 01:42:16,510 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 216 transitions. [2019-01-14 01:42:16,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-14 01:42:16,514 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:42:16,514 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2019-01-14 01:42:16,514 INFO L423 AbstractCegarLoop]: === Iteration 14 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:42:16,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:42:16,515 INFO L82 PathProgramCache]: Analyzing trace with hash -158018185, now seen corresponding path program 4 times [2019-01-14 01:42:16,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:42:16,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:42:16,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:16,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:42:16,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:16,638 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-01-14 01:42:16,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:42:16,639 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:42:16,647 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:42:16,695 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:42:16,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:42:16,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:42:16,930 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-01-14 01:42:16,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:42:16,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2019-01-14 01:42:16,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-14 01:42:16,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 01:42:16,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-01-14 01:42:16,951 INFO L87 Difference]: Start difference. First operand 198 states and 216 transitions. Second operand 14 states. [2019-01-14 01:42:17,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:42:17,047 INFO L93 Difference]: Finished difference Result 252 states and 282 transitions. [2019-01-14 01:42:17,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 01:42:17,050 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2019-01-14 01:42:17,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:42:17,052 INFO L225 Difference]: With dead ends: 252 [2019-01-14 01:42:17,052 INFO L226 Difference]: Without dead ends: 216 [2019-01-14 01:42:17,052 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-14 01:42:17,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-01-14 01:42:17,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 210. [2019-01-14 01:42:17,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-14 01:42:17,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 228 transitions. [2019-01-14 01:42:17,064 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 228 transitions. Word has length 62 [2019-01-14 01:42:17,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:42:17,064 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 228 transitions. [2019-01-14 01:42:17,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-14 01:42:17,064 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 228 transitions. [2019-01-14 01:42:17,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-14 01:42:17,067 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:42:17,067 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2019-01-14 01:42:17,068 INFO L423 AbstractCegarLoop]: === Iteration 15 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:42:17,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:42:17,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1955313719, now seen corresponding path program 5 times [2019-01-14 01:42:17,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:42:17,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:42:17,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:17,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:42:17,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:17,417 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-01-14 01:42:17,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:42:17,417 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:42:17,427 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 01:42:17,488 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-01-14 01:42:17,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:42:17,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:42:17,663 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-01-14 01:42:17,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:42:17,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2019-01-14 01:42:17,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-14 01:42:17,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-14 01:42:17,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-01-14 01:42:17,682 INFO L87 Difference]: Start difference. First operand 210 states and 228 transitions. Second operand 16 states. [2019-01-14 01:42:17,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:42:17,798 INFO L93 Difference]: Finished difference Result 264 states and 294 transitions. [2019-01-14 01:42:17,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 01:42:17,799 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 74 [2019-01-14 01:42:17,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:42:17,801 INFO L225 Difference]: With dead ends: 264 [2019-01-14 01:42:17,801 INFO L226 Difference]: Without dead ends: 223 [2019-01-14 01:42:17,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 67 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-01-14 01:42:17,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-01-14 01:42:17,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 217. [2019-01-14 01:42:17,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-14 01:42:17,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 235 transitions. [2019-01-14 01:42:17,816 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 235 transitions. Word has length 74 [2019-01-14 01:42:17,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:42:17,816 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 235 transitions. [2019-01-14 01:42:17,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-14 01:42:17,816 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 235 transitions. [2019-01-14 01:42:17,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-14 01:42:17,820 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:42:17,820 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2019-01-14 01:42:17,820 INFO L423 AbstractCegarLoop]: === Iteration 16 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:42:17,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:42:17,821 INFO L82 PathProgramCache]: Analyzing trace with hash -330632009, now seen corresponding path program 6 times [2019-01-14 01:42:17,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:42:17,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:42:17,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:17,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:42:17,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:18,090 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-01-14 01:42:18,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:42:18,091 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:42:18,110 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 01:42:18,157 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-01-14 01:42:18,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:42:18,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:42:18,312 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-01-14 01:42:18,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:42:18,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2019-01-14 01:42:18,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-14 01:42:18,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-14 01:42:18,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-01-14 01:42:18,331 INFO L87 Difference]: Start difference. First operand 217 states and 235 transitions. Second operand 18 states. [2019-01-14 01:42:18,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:42:18,496 INFO L93 Difference]: Finished difference Result 271 states and 301 transitions. [2019-01-14 01:42:18,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-14 01:42:18,497 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 86 [2019-01-14 01:42:18,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:42:18,499 INFO L225 Difference]: With dead ends: 271 [2019-01-14 01:42:18,500 INFO L226 Difference]: Without dead ends: 230 [2019-01-14 01:42:18,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 78 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-01-14 01:42:18,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-01-14 01:42:18,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 224. [2019-01-14 01:42:18,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-01-14 01:42:18,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 242 transitions. [2019-01-14 01:42:18,518 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 242 transitions. Word has length 86 [2019-01-14 01:42:18,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:42:18,519 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 242 transitions. [2019-01-14 01:42:18,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-14 01:42:18,519 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 242 transitions. [2019-01-14 01:42:18,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-14 01:42:18,522 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:42:18,522 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2019-01-14 01:42:18,522 INFO L423 AbstractCegarLoop]: === Iteration 17 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:42:18,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:42:18,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1775681655, now seen corresponding path program 7 times [2019-01-14 01:42:18,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:42:18,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:42:18,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:18,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:42:18,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:18,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:18,734 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-01-14 01:42:18,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:42:18,735 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:42:18,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:42:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:18,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:42:19,131 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-01-14 01:42:19,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:42:19,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2019-01-14 01:42:19,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-14 01:42:19,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-14 01:42:19,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-01-14 01:42:19,161 INFO L87 Difference]: Start difference. First operand 224 states and 242 transitions. Second operand 20 states. [2019-01-14 01:42:19,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:42:19,344 INFO L93 Difference]: Finished difference Result 278 states and 308 transitions. [2019-01-14 01:42:19,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-14 01:42:19,345 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 98 [2019-01-14 01:42:19,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:42:19,347 INFO L225 Difference]: With dead ends: 278 [2019-01-14 01:42:19,347 INFO L226 Difference]: Without dead ends: 237 [2019-01-14 01:42:19,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 89 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-01-14 01:42:19,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-01-14 01:42:19,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 231. [2019-01-14 01:42:19,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-14 01:42:19,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 249 transitions. [2019-01-14 01:42:19,360 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 249 transitions. Word has length 98 [2019-01-14 01:42:19,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:42:19,360 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 249 transitions. [2019-01-14 01:42:19,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-14 01:42:19,360 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 249 transitions. [2019-01-14 01:42:19,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-01-14 01:42:19,364 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:42:19,364 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2019-01-14 01:42:19,364 INFO L423 AbstractCegarLoop]: === Iteration 18 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:42:19,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:42:19,364 INFO L82 PathProgramCache]: Analyzing trace with hash 73375164, now seen corresponding path program 8 times [2019-01-14 01:42:19,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:42:19,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:42:19,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:19,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:42:19,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:19,577 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2019-01-14 01:42:19,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:42:19,577 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:42:19,586 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:42:19,643 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:42:19,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:42:19,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:42:19,844 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2019-01-14 01:42:19,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:42:19,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2019-01-14 01:42:19,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-14 01:42:19,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-14 01:42:19,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-01-14 01:42:19,864 INFO L87 Difference]: Start difference. First operand 231 states and 249 transitions. Second operand 22 states. [2019-01-14 01:42:20,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:42:20,257 INFO L93 Difference]: Finished difference Result 285 states and 315 transitions. [2019-01-14 01:42:20,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-14 01:42:20,258 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 145 [2019-01-14 01:42:20,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:42:20,261 INFO L225 Difference]: With dead ends: 285 [2019-01-14 01:42:20,261 INFO L226 Difference]: Without dead ends: 244 [2019-01-14 01:42:20,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 135 SyntacticMatches, 8 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-01-14 01:42:20,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-01-14 01:42:20,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 238. [2019-01-14 01:42:20,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-01-14 01:42:20,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 256 transitions. [2019-01-14 01:42:20,272 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 256 transitions. Word has length 145 [2019-01-14 01:42:20,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:42:20,274 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 256 transitions. [2019-01-14 01:42:20,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-14 01:42:20,274 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 256 transitions. [2019-01-14 01:42:20,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-01-14 01:42:20,277 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:42:20,277 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2019-01-14 01:42:20,278 INFO L423 AbstractCegarLoop]: === Iteration 19 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:42:20,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:42:20,279 INFO L82 PathProgramCache]: Analyzing trace with hash -329358962, now seen corresponding path program 9 times [2019-01-14 01:42:20,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:42:20,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:42:20,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:20,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:42:20,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:20,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1002 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2019-01-14 01:42:20,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:42:20,573 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:42:20,583 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:42:20,737 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-14 01:42:20,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:42:20,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:42:21,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1002 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2019-01-14 01:42:21,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:42:21,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2019-01-14 01:42:21,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-14 01:42:21,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-14 01:42:21,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-01-14 01:42:21,037 INFO L87 Difference]: Start difference. First operand 238 states and 256 transitions. Second operand 24 states. [2019-01-14 01:42:21,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:42:21,801 INFO L93 Difference]: Finished difference Result 292 states and 322 transitions. [2019-01-14 01:42:21,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-14 01:42:21,802 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 157 [2019-01-14 01:42:21,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:42:21,805 INFO L225 Difference]: With dead ends: 292 [2019-01-14 01:42:21,806 INFO L226 Difference]: Without dead ends: 251 [2019-01-14 01:42:21,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 146 SyntacticMatches, 9 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-01-14 01:42:21,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-01-14 01:42:21,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 245. [2019-01-14 01:42:21,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-01-14 01:42:21,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 263 transitions. [2019-01-14 01:42:21,823 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 263 transitions. Word has length 157 [2019-01-14 01:42:21,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:42:21,823 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 263 transitions. [2019-01-14 01:42:21,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-14 01:42:21,823 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 263 transitions. [2019-01-14 01:42:21,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-01-14 01:42:21,832 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:42:21,832 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2019-01-14 01:42:21,833 INFO L423 AbstractCegarLoop]: === Iteration 20 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:42:21,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:42:21,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1310449148, now seen corresponding path program 10 times [2019-01-14 01:42:21,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:42:21,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:42:21,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:21,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:42:21,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:21,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:22,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 355 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2019-01-14 01:42:22,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:42:22,590 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:42:22,600 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:42:22,636 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:42:22,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:42:22,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:42:22,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 355 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2019-01-14 01:42:22,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:42:22,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2019-01-14 01:42:22,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-14 01:42:22,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-14 01:42:22,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2019-01-14 01:42:22,979 INFO L87 Difference]: Start difference. First operand 245 states and 263 transitions. Second operand 26 states. [2019-01-14 01:42:23,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:42:23,137 INFO L93 Difference]: Finished difference Result 299 states and 329 transitions. [2019-01-14 01:42:23,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-14 01:42:23,138 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 169 [2019-01-14 01:42:23,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:42:23,140 INFO L225 Difference]: With dead ends: 299 [2019-01-14 01:42:23,141 INFO L226 Difference]: Without dead ends: 258 [2019-01-14 01:42:23,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 157 SyntacticMatches, 10 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2019-01-14 01:42:23,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-01-14 01:42:23,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 252. [2019-01-14 01:42:23,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-14 01:42:23,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 270 transitions. [2019-01-14 01:42:23,152 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 270 transitions. Word has length 169 [2019-01-14 01:42:23,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:42:23,154 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 270 transitions. [2019-01-14 01:42:23,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-14 01:42:23,154 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 270 transitions. [2019-01-14 01:42:23,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-01-14 01:42:23,157 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:42:23,157 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2019-01-14 01:42:23,158 INFO L423 AbstractCegarLoop]: === Iteration 21 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:42:23,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:42:23,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1885455794, now seen corresponding path program 11 times [2019-01-14 01:42:23,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:42:23,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:42:23,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:23,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:42:23,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:24,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1322 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2019-01-14 01:42:24,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:42:24,077 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:42:24,088 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 01:42:24,160 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2019-01-14 01:42:24,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:42:24,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:42:24,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1322 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2019-01-14 01:42:24,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:42:24,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 27 [2019-01-14 01:42:24,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-14 01:42:24,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-14 01:42:24,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-01-14 01:42:24,469 INFO L87 Difference]: Start difference. First operand 252 states and 270 transitions. Second operand 28 states. [2019-01-14 01:42:24,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:42:24,690 INFO L93 Difference]: Finished difference Result 306 states and 336 transitions. [2019-01-14 01:42:24,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-14 01:42:24,691 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 181 [2019-01-14 01:42:24,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:42:24,694 INFO L225 Difference]: With dead ends: 306 [2019-01-14 01:42:24,694 INFO L226 Difference]: Without dead ends: 265 [2019-01-14 01:42:24,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 168 SyntacticMatches, 11 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-01-14 01:42:24,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-01-14 01:42:24,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 259. [2019-01-14 01:42:24,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-01-14 01:42:24,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 277 transitions. [2019-01-14 01:42:24,706 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 277 transitions. Word has length 181 [2019-01-14 01:42:24,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:42:24,707 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 277 transitions. [2019-01-14 01:42:24,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-14 01:42:24,708 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 277 transitions. [2019-01-14 01:42:24,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-01-14 01:42:24,711 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:42:24,711 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1] [2019-01-14 01:42:24,711 INFO L423 AbstractCegarLoop]: === Iteration 22 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:42:24,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:42:24,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1454043767, now seen corresponding path program 12 times [2019-01-14 01:42:24,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:42:24,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:42:24,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:24,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:42:24,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:25,195 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 0 proven. 510 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-01-14 01:42:25,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:42:25,195 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:42:25,204 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 01:42:25,247 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2019-01-14 01:42:25,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:42:25,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:42:25,559 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 0 proven. 510 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-01-14 01:42:25,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:42:25,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2019-01-14 01:42:25,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-14 01:42:25,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-14 01:42:25,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2019-01-14 01:42:25,579 INFO L87 Difference]: Start difference. First operand 259 states and 277 transitions. Second operand 30 states. [2019-01-14 01:42:25,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:42:25,796 INFO L93 Difference]: Finished difference Result 313 states and 343 transitions. [2019-01-14 01:42:25,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-14 01:42:25,800 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 158 [2019-01-14 01:42:25,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:42:25,802 INFO L225 Difference]: With dead ends: 313 [2019-01-14 01:42:25,802 INFO L226 Difference]: Without dead ends: 272 [2019-01-14 01:42:25,802 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-14 01:42:25,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-01-14 01:42:25,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 266. [2019-01-14 01:42:25,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-01-14 01:42:25,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 284 transitions. [2019-01-14 01:42:25,812 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 284 transitions. Word has length 158 [2019-01-14 01:42:25,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:42:25,813 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 284 transitions. [2019-01-14 01:42:25,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-14 01:42:25,813 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 284 transitions. [2019-01-14 01:42:25,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-01-14 01:42:25,814 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:42:25,817 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1] [2019-01-14 01:42:25,818 INFO L423 AbstractCegarLoop]: === Iteration 23 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:42:25,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:42:25,818 INFO L82 PathProgramCache]: Analyzing trace with hash 350954254, now seen corresponding path program 13 times [2019-01-14 01:42:25,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:42:25,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:42:25,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:25,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:42:25,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:26,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1690 backedges. 0 proven. 598 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2019-01-14 01:42:26,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:42:26,471 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:42:26,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:42:26,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:26,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:42:26,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1690 backedges. 0 proven. 598 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2019-01-14 01:42:26,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:42:26,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 31 [2019-01-14 01:42:26,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-14 01:42:26,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-14 01:42:26,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2019-01-14 01:42:26,839 INFO L87 Difference]: Start difference. First operand 266 states and 284 transitions. Second operand 32 states. [2019-01-14 01:42:27,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:42:27,110 INFO L93 Difference]: Finished difference Result 320 states and 350 transitions. [2019-01-14 01:42:27,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-14 01:42:27,112 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 205 [2019-01-14 01:42:27,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:42:27,116 INFO L225 Difference]: With dead ends: 320 [2019-01-14 01:42:27,116 INFO L226 Difference]: Without dead ends: 279 [2019-01-14 01:42:27,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 190 SyntacticMatches, 13 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2019-01-14 01:42:27,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-14 01:42:27,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 273. [2019-01-14 01:42:27,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-01-14 01:42:27,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 291 transitions. [2019-01-14 01:42:27,140 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 291 transitions. Word has length 205 [2019-01-14 01:42:27,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:42:27,142 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 291 transitions. [2019-01-14 01:42:27,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-14 01:42:27,142 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 291 transitions. [2019-01-14 01:42:27,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-01-14 01:42:27,143 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:42:27,143 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1] [2019-01-14 01:42:27,144 INFO L423 AbstractCegarLoop]: === Iteration 24 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:42:27,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:42:27,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1929171383, now seen corresponding path program 14 times [2019-01-14 01:42:27,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:42:27,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:42:27,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:27,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:42:27,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:27,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 0 proven. 693 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2019-01-14 01:42:27,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:42:27,954 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:42:27,964 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:42:28,002 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:42:28,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:42:28,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:42:28,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 0 proven. 693 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2019-01-14 01:42:28,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:42:28,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 33 [2019-01-14 01:42:28,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-14 01:42:28,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-14 01:42:28,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2019-01-14 01:42:28,341 INFO L87 Difference]: Start difference. First operand 273 states and 291 transitions. Second operand 34 states. [2019-01-14 01:42:28,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:42:28,534 INFO L93 Difference]: Finished difference Result 327 states and 357 transitions. [2019-01-14 01:42:28,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-14 01:42:28,535 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 182 [2019-01-14 01:42:28,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:42:28,537 INFO L225 Difference]: With dead ends: 327 [2019-01-14 01:42:28,538 INFO L226 Difference]: Without dead ends: 286 [2019-01-14 01:42:28,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 166 SyntacticMatches, 14 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2019-01-14 01:42:28,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-01-14 01:42:28,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 280. [2019-01-14 01:42:28,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-01-14 01:42:28,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 298 transitions. [2019-01-14 01:42:28,549 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 298 transitions. Word has length 182 [2019-01-14 01:42:28,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:42:28,549 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 298 transitions. [2019-01-14 01:42:28,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-14 01:42:28,550 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 298 transitions. [2019-01-14 01:42:28,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-01-14 01:42:28,554 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:42:28,554 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1] [2019-01-14 01:42:28,554 INFO L423 AbstractCegarLoop]: === Iteration 25 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:42:28,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:42:28,555 INFO L82 PathProgramCache]: Analyzing trace with hash -799687031, now seen corresponding path program 15 times [2019-01-14 01:42:28,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:42:28,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:42:28,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:28,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:42:28,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:29,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1427 backedges. 0 proven. 795 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2019-01-14 01:42:29,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:42:29,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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:42:29,348 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:42:29,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-14 01:42:29,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:42:29,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:42:30,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1427 backedges. 0 proven. 795 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2019-01-14 01:42:30,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:42:30,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 35 [2019-01-14 01:42:30,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-14 01:42:30,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-14 01:42:30,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=919, Unknown=0, NotChecked=0, Total=1260 [2019-01-14 01:42:30,073 INFO L87 Difference]: Start difference. First operand 280 states and 298 transitions. Second operand 36 states. [2019-01-14 01:42:30,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:42:30,308 INFO L93 Difference]: Finished difference Result 334 states and 364 transitions. [2019-01-14 01:42:30,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-14 01:42:30,309 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 194 [2019-01-14 01:42:30,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:42:30,311 INFO L225 Difference]: With dead ends: 334 [2019-01-14 01:42:30,312 INFO L226 Difference]: Without dead ends: 293 [2019-01-14 01:42:30,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 177 SyntacticMatches, 15 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=341, Invalid=919, Unknown=0, NotChecked=0, Total=1260 [2019-01-14 01:42:30,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-01-14 01:42:30,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 287. [2019-01-14 01:42:30,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-01-14 01:42:30,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 305 transitions. [2019-01-14 01:42:30,322 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 305 transitions. Word has length 194 [2019-01-14 01:42:30,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:42:30,322 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 305 transitions. [2019-01-14 01:42:30,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-14 01:42:30,323 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 305 transitions. [2019-01-14 01:42:30,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-01-14 01:42:30,326 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:42:30,327 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1] [2019-01-14 01:42:30,327 INFO L423 AbstractCegarLoop]: === Iteration 26 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:42:30,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:42:30,327 INFO L82 PathProgramCache]: Analyzing trace with hash 315334903, now seen corresponding path program 16 times [2019-01-14 01:42:30,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:42:30,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:42:30,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:30,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:42:30,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:30,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 0 proven. 904 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2019-01-14 01:42:30,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:42:30,931 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:42:30,943 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:42:30,989 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:42:30,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:42:30,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:42:31,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 0 proven. 904 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2019-01-14 01:42:31,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:42:31,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 37 [2019-01-14 01:42:31,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-14 01:42:31,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-14 01:42:31,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2019-01-14 01:42:31,418 INFO L87 Difference]: Start difference. First operand 287 states and 305 transitions. Second operand 38 states. [2019-01-14 01:42:31,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:42:31,632 INFO L93 Difference]: Finished difference Result 341 states and 371 transitions. [2019-01-14 01:42:31,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-14 01:42:31,633 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 206 [2019-01-14 01:42:31,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:42:31,636 INFO L225 Difference]: With dead ends: 341 [2019-01-14 01:42:31,636 INFO L226 Difference]: Without dead ends: 300 [2019-01-14 01:42:31,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 188 SyntacticMatches, 16 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2019-01-14 01:42:31,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-01-14 01:42:31,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 294. [2019-01-14 01:42:31,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-01-14 01:42:31,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 312 transitions. [2019-01-14 01:42:31,646 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 312 transitions. Word has length 206 [2019-01-14 01:42:31,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:42:31,647 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 312 transitions. [2019-01-14 01:42:31,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-14 01:42:31,648 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 312 transitions. [2019-01-14 01:42:31,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-01-14 01:42:31,651 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:42:31,651 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1] [2019-01-14 01:42:31,652 INFO L423 AbstractCegarLoop]: === Iteration 27 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:42:31,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:42:31,653 INFO L82 PathProgramCache]: Analyzing trace with hash -843307890, now seen corresponding path program 17 times [2019-01-14 01:42:31,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:42:31,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:42:31,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:31,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:42:31,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:32,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2570 backedges. 0 proven. 1020 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2019-01-14 01:42:32,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:42:32,367 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:42:32,376 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 01:42:32,455 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2019-01-14 01:42:32,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:42:32,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:42:33,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2570 backedges. 0 proven. 1020 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2019-01-14 01:42:33,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:42:33,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 39 [2019-01-14 01:42:33,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-14 01:42:33,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-14 01:42:33,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1141, Unknown=0, NotChecked=0, Total=1560 [2019-01-14 01:42:33,129 INFO L87 Difference]: Start difference. First operand 294 states and 312 transitions. Second operand 40 states. [2019-01-14 01:42:33,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:42:33,604 INFO L93 Difference]: Finished difference Result 348 states and 378 transitions. [2019-01-14 01:42:33,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-14 01:42:33,606 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 253 [2019-01-14 01:42:33,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:42:33,609 INFO L225 Difference]: With dead ends: 348 [2019-01-14 01:42:33,610 INFO L226 Difference]: Without dead ends: 307 [2019-01-14 01:42:33,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 234 SyntacticMatches, 17 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=419, Invalid=1141, Unknown=0, NotChecked=0, Total=1560 [2019-01-14 01:42:33,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-01-14 01:42:33,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 301. [2019-01-14 01:42:33,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-01-14 01:42:33,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 319 transitions. [2019-01-14 01:42:33,622 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 319 transitions. Word has length 253 [2019-01-14 01:42:33,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:42:33,623 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 319 transitions. [2019-01-14 01:42:33,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-14 01:42:33,623 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 319 transitions. [2019-01-14 01:42:33,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-01-14 01:42:33,626 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:42:33,627 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1] [2019-01-14 01:42:33,627 INFO L423 AbstractCegarLoop]: === Iteration 28 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:42:33,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:42:33,627 INFO L82 PathProgramCache]: Analyzing trace with hash 349397047, now seen corresponding path program 18 times [2019-01-14 01:42:33,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:42:33,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:42:33,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:33,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:42:33,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:34,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2036 backedges. 0 proven. 1143 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2019-01-14 01:42:34,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:42:34,828 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:42:34,838 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 01:42:34,924 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2019-01-14 01:42:34,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:42:34,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:42:35,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2036 backedges. 0 proven. 1143 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2019-01-14 01:42:35,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:42:35,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 41 [2019-01-14 01:42:35,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-14 01:42:35,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-14 01:42:35,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1261, Unknown=0, NotChecked=0, Total=1722 [2019-01-14 01:42:35,519 INFO L87 Difference]: Start difference. First operand 301 states and 319 transitions. Second operand 42 states. [2019-01-14 01:42:36,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:42:36,824 INFO L93 Difference]: Finished difference Result 355 states and 385 transitions. [2019-01-14 01:42:36,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-14 01:42:36,826 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 230 [2019-01-14 01:42:36,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:42:36,828 INFO L225 Difference]: With dead ends: 355 [2019-01-14 01:42:36,829 INFO L226 Difference]: Without dead ends: 314 [2019-01-14 01:42:36,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 210 SyntacticMatches, 18 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 977 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=461, Invalid=1261, Unknown=0, NotChecked=0, Total=1722 [2019-01-14 01:42:36,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-01-14 01:42:36,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 308. [2019-01-14 01:42:36,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-01-14 01:42:36,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 326 transitions. [2019-01-14 01:42:36,839 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 326 transitions. Word has length 230 [2019-01-14 01:42:36,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:42:36,841 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 326 transitions. [2019-01-14 01:42:36,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-14 01:42:36,842 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 326 transitions. [2019-01-14 01:42:36,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-01-14 01:42:36,844 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:42:36,844 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1] [2019-01-14 01:42:36,846 INFO L423 AbstractCegarLoop]: === Iteration 29 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:42:36,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:42:36,847 INFO L82 PathProgramCache]: Analyzing trace with hash 420240905, now seen corresponding path program 19 times [2019-01-14 01:42:36,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:42:36,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:42:36,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:36,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:42:36,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:37,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2263 backedges. 0 proven. 1273 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-14 01:42:37,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:42:37,707 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:42:37,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:42:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:37,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:42:38,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2263 backedges. 0 proven. 1273 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-14 01:42:38,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:42:38,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 43 [2019-01-14 01:42:38,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-14 01:42:38,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-14 01:42:38,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2019-01-14 01:42:38,450 INFO L87 Difference]: Start difference. First operand 308 states and 326 transitions. Second operand 44 states. [2019-01-14 01:42:38,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:42:38,876 INFO L93 Difference]: Finished difference Result 362 states and 392 transitions. [2019-01-14 01:42:38,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-14 01:42:38,878 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 242 [2019-01-14 01:42:38,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:42:38,881 INFO L225 Difference]: With dead ends: 362 [2019-01-14 01:42:38,881 INFO L226 Difference]: Without dead ends: 321 [2019-01-14 01:42:38,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 221 SyntacticMatches, 19 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2019-01-14 01:42:38,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-01-14 01:42:38,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 315. [2019-01-14 01:42:38,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-01-14 01:42:38,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 333 transitions. [2019-01-14 01:42:38,895 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 333 transitions. Word has length 242 [2019-01-14 01:42:38,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:42:38,895 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 333 transitions. [2019-01-14 01:42:38,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-14 01:42:38,896 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 333 transitions. [2019-01-14 01:42:38,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-01-14 01:42:38,901 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:42:38,902 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 21, 21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1] [2019-01-14 01:42:38,902 INFO L423 AbstractCegarLoop]: === Iteration 30 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:42:38,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:42:38,903 INFO L82 PathProgramCache]: Analyzing trace with hash -2063192260, now seen corresponding path program 20 times [2019-01-14 01:42:38,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:42:38,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:42:38,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:38,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:42:38,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:39,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3356 backedges. 0 proven. 1410 refuted. 0 times theorem prover too weak. 1946 trivial. 0 not checked. [2019-01-14 01:42:39,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:42:39,990 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:42:40,002 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:42:40,080 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:42:40,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:42:40,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:42:40,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3356 backedges. 0 proven. 1410 refuted. 0 times theorem prover too weak. 1946 trivial. 0 not checked. [2019-01-14 01:42:40,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:42:40,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 45 [2019-01-14 01:42:40,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-14 01:42:40,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-14 01:42:40,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2019-01-14 01:42:40,918 INFO L87 Difference]: Start difference. First operand 315 states and 333 transitions. Second operand 46 states. [2019-01-14 01:42:41,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:42:41,215 INFO L93 Difference]: Finished difference Result 369 states and 399 transitions. [2019-01-14 01:42:41,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-14 01:42:41,217 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 289 [2019-01-14 01:42:41,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:42:41,220 INFO L225 Difference]: With dead ends: 369 [2019-01-14 01:42:41,220 INFO L226 Difference]: Without dead ends: 328 [2019-01-14 01:42:41,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 267 SyntacticMatches, 20 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1186 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2019-01-14 01:42:41,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-01-14 01:42:41,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 322. [2019-01-14 01:42:41,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-01-14 01:42:41,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 340 transitions. [2019-01-14 01:42:41,232 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 340 transitions. Word has length 289 [2019-01-14 01:42:41,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:42:41,233 INFO L480 AbstractCegarLoop]: Abstraction has 322 states and 340 transitions. [2019-01-14 01:42:41,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-14 01:42:41,233 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 340 transitions. [2019-01-14 01:42:41,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-01-14 01:42:41,237 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:42:41,237 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 22, 22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1] [2019-01-14 01:42:41,238 INFO L423 AbstractCegarLoop]: === Iteration 31 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:42:41,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:42:41,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1626433038, now seen corresponding path program 21 times [2019-01-14 01:42:41,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:42:41,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:42:41,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:41,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:42:41,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:42,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3642 backedges. 0 proven. 1554 refuted. 0 times theorem prover too weak. 2088 trivial. 0 not checked. [2019-01-14 01:42:42,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:42:42,088 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:42:42,098 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:42:42,168 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-14 01:42:42,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:42:42,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:42:44,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3642 backedges. 0 proven. 1554 refuted. 0 times theorem prover too weak. 2088 trivial. 0 not checked. [2019-01-14 01:42:44,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:42:44,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 47 [2019-01-14 01:42:44,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-14 01:42:44,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-14 01:42:44,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2019-01-14 01:42:44,208 INFO L87 Difference]: Start difference. First operand 322 states and 340 transitions. Second operand 48 states. [2019-01-14 01:42:44,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:42:44,436 INFO L93 Difference]: Finished difference Result 376 states and 406 transitions. [2019-01-14 01:42:44,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-14 01:42:44,437 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 301 [2019-01-14 01:42:44,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:42:44,442 INFO L225 Difference]: With dead ends: 376 [2019-01-14 01:42:44,442 INFO L226 Difference]: Without dead ends: 335 [2019-01-14 01:42:44,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 278 SyntacticMatches, 21 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1298 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2019-01-14 01:42:44,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-01-14 01:42:44,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 329. [2019-01-14 01:42:44,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-01-14 01:42:44,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 347 transitions. [2019-01-14 01:42:44,457 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 347 transitions. Word has length 301 [2019-01-14 01:42:44,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:42:44,457 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 347 transitions. [2019-01-14 01:42:44,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-14 01:42:44,458 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 347 transitions. [2019-01-14 01:42:44,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-01-14 01:42:44,463 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:42:44,463 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2019-01-14 01:42:44,465 INFO L423 AbstractCegarLoop]: === Iteration 32 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:42:44,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:42:44,465 INFO L82 PathProgramCache]: Analyzing trace with hash 338825084, now seen corresponding path program 22 times [2019-01-14 01:42:44,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:42:44,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:42:44,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:44,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:42:44,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:45,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3940 backedges. 0 proven. 1705 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2019-01-14 01:42:45,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:42:45,425 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:42:45,434 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:42:45,496 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:42:45,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:42:45,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:42:46,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3940 backedges. 0 proven. 1705 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2019-01-14 01:42:46,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:42:46,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 49 [2019-01-14 01:42:46,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-14 01:42:46,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-14 01:42:46,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=1801, Unknown=0, NotChecked=0, Total=2450 [2019-01-14 01:42:46,226 INFO L87 Difference]: Start difference. First operand 329 states and 347 transitions. Second operand 50 states. [2019-01-14 01:42:46,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:42:46,518 INFO L93 Difference]: Finished difference Result 383 states and 413 transitions. [2019-01-14 01:42:46,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-14 01:42:46,520 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 313 [2019-01-14 01:42:46,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:42:46,523 INFO L225 Difference]: With dead ends: 383 [2019-01-14 01:42:46,523 INFO L226 Difference]: Without dead ends: 342 [2019-01-14 01:42:46,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 289 SyntacticMatches, 22 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1415 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=649, Invalid=1801, Unknown=0, NotChecked=0, Total=2450 [2019-01-14 01:42:46,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-01-14 01:42:46,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 336. [2019-01-14 01:42:46,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-01-14 01:42:46,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 354 transitions. [2019-01-14 01:42:46,533 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 354 transitions. Word has length 313 [2019-01-14 01:42:46,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:42:46,533 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 354 transitions. [2019-01-14 01:42:46,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-14 01:42:46,534 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 354 transitions. [2019-01-14 01:42:46,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-01-14 01:42:46,536 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:42:46,536 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1] [2019-01-14 01:42:46,536 INFO L423 AbstractCegarLoop]: === Iteration 33 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:42:46,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:42:46,537 INFO L82 PathProgramCache]: Analyzing trace with hash 117652873, now seen corresponding path program 23 times [2019-01-14 01:42:46,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:42:46,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:42:46,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:46,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:42:46,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:47,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3291 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2019-01-14 01:42:47,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:42:47,457 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:42:47,469 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 01:42:47,540 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2019-01-14 01:42:47,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:42:47,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:42:49,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3291 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2019-01-14 01:42:49,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:42:49,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 51 [2019-01-14 01:42:49,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-14 01:42:49,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-14 01:42:49,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=701, Invalid=1951, Unknown=0, NotChecked=0, Total=2652 [2019-01-14 01:42:49,232 INFO L87 Difference]: Start difference. First operand 336 states and 354 transitions. Second operand 52 states. [2019-01-14 01:42:49,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:42:49,536 INFO L93 Difference]: Finished difference Result 390 states and 420 transitions. [2019-01-14 01:42:49,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-14 01:42:49,538 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 290 [2019-01-14 01:42:49,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:42:49,540 INFO L225 Difference]: With dead ends: 390 [2019-01-14 01:42:49,541 INFO L226 Difference]: Without dead ends: 349 [2019-01-14 01:42:49,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 265 SyntacticMatches, 23 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1537 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=701, Invalid=1951, Unknown=0, NotChecked=0, Total=2652 [2019-01-14 01:42:49,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-01-14 01:42:49,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 343. [2019-01-14 01:42:49,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-01-14 01:42:49,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 361 transitions. [2019-01-14 01:42:49,551 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 361 transitions. Word has length 290 [2019-01-14 01:42:49,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:42:49,551 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 361 transitions. [2019-01-14 01:42:49,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-14 01:42:49,552 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 361 transitions. [2019-01-14 01:42:49,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-01-14 01:42:49,557 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:42:49,558 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 25, 25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1] [2019-01-14 01:42:49,559 INFO L423 AbstractCegarLoop]: === Iteration 34 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:42:49,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:42:49,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1252532292, now seen corresponding path program 24 times [2019-01-14 01:42:49,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:42:49,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:42:49,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:49,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:42:49,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:50,556 INFO L134 CoverageAnalysis]: Checked inductivity of 4572 backedges. 0 proven. 2028 refuted. 0 times theorem prover too weak. 2544 trivial. 0 not checked. [2019-01-14 01:42:50,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:42:50,556 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:42:50,565 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 01:42:50,660 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2019-01-14 01:42:50,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:42:50,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:42:51,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4572 backedges. 0 proven. 2028 refuted. 0 times theorem prover too weak. 2544 trivial. 0 not checked. [2019-01-14 01:42:51,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:42:51,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 53 [2019-01-14 01:42:51,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-14 01:42:51,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-14 01:42:51,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2019-01-14 01:42:51,427 INFO L87 Difference]: Start difference. First operand 343 states and 361 transitions. Second operand 54 states. [2019-01-14 01:42:51,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:42:51,782 INFO L93 Difference]: Finished difference Result 397 states and 427 transitions. [2019-01-14 01:42:51,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-14 01:42:51,783 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 337 [2019-01-14 01:42:51,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:42:51,786 INFO L225 Difference]: With dead ends: 397 [2019-01-14 01:42:51,786 INFO L226 Difference]: Without dead ends: 356 [2019-01-14 01:42:51,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 311 SyntacticMatches, 24 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1664 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2019-01-14 01:42:51,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-01-14 01:42:51,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 350. [2019-01-14 01:42:51,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-01-14 01:42:51,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 368 transitions. [2019-01-14 01:42:51,796 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 368 transitions. Word has length 337 [2019-01-14 01:42:51,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:42:51,796 INFO L480 AbstractCegarLoop]: Abstraction has 350 states and 368 transitions. [2019-01-14 01:42:51,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-14 01:42:51,796 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 368 transitions. [2019-01-14 01:42:51,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-01-14 01:42:51,802 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:42:51,802 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 26, 26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1] [2019-01-14 01:42:51,803 INFO L423 AbstractCegarLoop]: === Iteration 35 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:42:51,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:42:51,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1465194610, now seen corresponding path program 25 times [2019-01-14 01:42:51,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:42:51,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:42:51,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:51,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:42:51,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:42:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:52,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 2200 refuted. 0 times theorem prover too weak. 2706 trivial. 0 not checked. [2019-01-14 01:42:52,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:42:52,815 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:42:52,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:42:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:42:52,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:42:55,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 2340 proven. 1016 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2019-01-14 01:42:55,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:42:55,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 46] total 98 [2019-01-14 01:42:55,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-14 01:42:55,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-14 01:42:55,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=8282, Unknown=0, NotChecked=0, Total=9506 [2019-01-14 01:42:55,477 INFO L87 Difference]: Start difference. First operand 350 states and 368 transitions. Second operand 98 states. [2019-01-14 01:43:13,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:43:13,008 INFO L93 Difference]: Finished difference Result 599 states and 627 transitions. [2019-01-14 01:43:13,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-01-14 01:43:13,009 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 349 [2019-01-14 01:43:13,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:43:13,012 INFO L225 Difference]: With dead ends: 599 [2019-01-14 01:43:13,012 INFO L226 Difference]: Without dead ends: 359 [2019-01-14 01:43:13,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14185 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=8364, Invalid=49958, Unknown=0, NotChecked=0, Total=58322 [2019-01-14 01:43:13,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-01-14 01:43:13,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 350. [2019-01-14 01:43:13,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-01-14 01:43:13,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 359 transitions. [2019-01-14 01:43:13,029 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 359 transitions. Word has length 349 [2019-01-14 01:43:13,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:43:13,029 INFO L480 AbstractCegarLoop]: Abstraction has 350 states and 359 transitions. [2019-01-14 01:43:13,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-14 01:43:13,029 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 359 transitions. [2019-01-14 01:43:13,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-01-14 01:43:13,035 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:43:13,035 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 27, 27, 27, 26, 26, 26, 26, 1, 1, 1, 1, 1] [2019-01-14 01:43:13,036 INFO L423 AbstractCegarLoop]: === Iteration 36 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:43:13,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:43:13,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1553997372, now seen corresponding path program 26 times [2019-01-14 01:43:13,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:43:13,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:43:13,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:43:13,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:43:13,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:43:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:43:14,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4614 backedges. 0 proven. 2379 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2019-01-14 01:43:14,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:43:14,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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:43:14,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:43:14,952 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:43:14,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:43:14,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:43:15,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4614 backedges. 0 proven. 2379 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2019-01-14 01:43:15,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:43:15,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 57 [2019-01-14 01:43:15,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-14 01:43:15,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-14 01:43:15,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=869, Invalid=2437, Unknown=0, NotChecked=0, Total=3306 [2019-01-14 01:43:15,752 INFO L87 Difference]: Start difference. First operand 350 states and 359 transitions. Second operand 58 states. [2019-01-14 01:43:16,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:43:16,042 INFO L93 Difference]: Finished difference Result 375 states and 387 transitions. [2019-01-14 01:43:16,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-14 01:43:16,043 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 341 [2019-01-14 01:43:16,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:43:16,046 INFO L225 Difference]: With dead ends: 375 [2019-01-14 01:43:16,047 INFO L226 Difference]: Without dead ends: 327 [2019-01-14 01:43:16,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 313 SyntacticMatches, 26 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1933 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=869, Invalid=2437, Unknown=0, NotChecked=0, Total=3306 [2019-01-14 01:43:16,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-01-14 01:43:16,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2019-01-14 01:43:16,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-01-14 01:43:16,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 331 transitions. [2019-01-14 01:43:16,058 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 331 transitions. Word has length 341 [2019-01-14 01:43:16,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:43:16,058 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 331 transitions. [2019-01-14 01:43:16,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-14 01:43:16,059 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 331 transitions. [2019-01-14 01:43:16,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-01-14 01:43:16,063 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:43:16,064 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 28, 28, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1] [2019-01-14 01:43:16,065 INFO L423 AbstractCegarLoop]: === Iteration 37 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:43:16,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:43:16,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1412791337, now seen corresponding path program 27 times [2019-01-14 01:43:16,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:43:16,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:43:16,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:43:16,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:43:16,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:43:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:43:17,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4800 backedges. 0 proven. 2565 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2019-01-14 01:43:17,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:43:17,554 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:43:17,571 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:43:17,707 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-14 01:43:17,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:43:17,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:43:19,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4800 backedges. 0 proven. 2565 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2019-01-14 01:43:19,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:43:19,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 59 [2019-01-14 01:43:19,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-14 01:43:19,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-14 01:43:19,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=929, Invalid=2611, Unknown=0, NotChecked=0, Total=3540 [2019-01-14 01:43:19,073 INFO L87 Difference]: Start difference. First operand 325 states and 331 transitions. Second operand 60 states. [2019-01-14 01:43:19,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:43:19,451 INFO L93 Difference]: Finished difference Result 342 states and 349 transitions. [2019-01-14 01:43:19,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-14 01:43:19,452 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 348 [2019-01-14 01:43:19,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:43:19,455 INFO L225 Difference]: With dead ends: 342 [2019-01-14 01:43:19,455 INFO L226 Difference]: Without dead ends: 294 [2019-01-14 01:43:19,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 319 SyntacticMatches, 27 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2075 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=929, Invalid=2611, Unknown=0, NotChecked=0, Total=3540 [2019-01-14 01:43:19,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-01-14 01:43:19,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2019-01-14 01:43:19,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-01-14 01:43:19,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 296 transitions. [2019-01-14 01:43:19,465 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 296 transitions. Word has length 348 [2019-01-14 01:43:19,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:43:19,468 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 296 transitions. [2019-01-14 01:43:19,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-14 01:43:19,471 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 296 transitions. [2019-01-14 01:43:19,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-01-14 01:43:19,474 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:43:19,475 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 29, 29, 29, 28, 28, 28, 28, 1, 1, 1, 1, 1] [2019-01-14 01:43:19,475 INFO L423 AbstractCegarLoop]: === Iteration 38 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:43:19,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:43:19,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1815869028, now seen corresponding path program 28 times [2019-01-14 01:43:19,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:43:19,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:43:19,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:43:19,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:43:19,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:43:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:43:20,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4993 backedges. 0 proven. 2758 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2019-01-14 01:43:20,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:43:20,727 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:43:20,736 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:43:20,814 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:43:20,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:43:20,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:43:21,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4993 backedges. 0 proven. 2758 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2019-01-14 01:43:21,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:43:21,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 61 [2019-01-14 01:43:21,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-14 01:43:21,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-14 01:43:21,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=2791, Unknown=0, NotChecked=0, Total=3782 [2019-01-14 01:43:21,948 INFO L87 Difference]: Start difference. First operand 293 states and 296 transitions. Second operand 62 states. [2019-01-14 01:43:22,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:43:22,370 INFO L93 Difference]: Finished difference Result 302 states and 304 transitions. [2019-01-14 01:43:22,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-14 01:43:22,371 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 355 [2019-01-14 01:43:22,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:43:22,374 INFO L225 Difference]: With dead ends: 302 [2019-01-14 01:43:22,374 INFO L226 Difference]: Without dead ends: 254 [2019-01-14 01:43:22,375 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-14 01:43:22,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-01-14 01:43:22,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2019-01-14 01:43:22,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-01-14 01:43:22,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2019-01-14 01:43:22,382 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 355 [2019-01-14 01:43:22,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:43:22,384 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2019-01-14 01:43:22,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-14 01:43:22,384 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2019-01-14 01:43:22,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-01-14 01:43:22,386 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:43:22,386 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1] [2019-01-14 01:43:22,386 INFO L423 AbstractCegarLoop]: === Iteration 39 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:43:22,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:43:22,390 INFO L82 PathProgramCache]: Analyzing trace with hash 139723977, now seen corresponding path program 29 times [2019-01-14 01:43:22,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:43:22,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:43:22,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:43:22,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:43:22,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:43:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:43:23,643 INFO L134 CoverageAnalysis]: Checked inductivity of 5193 backedges. 0 proven. 2958 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2019-01-14 01:43:23,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:43:23,643 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:43:23,652 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 01:43:23,761 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2019-01-14 01:43:23,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:43:23,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:43:24,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-14 01:43:24,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:43:24,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 63 [2019-01-14 01:43:24,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-14 01:43:24,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-14 01:43:24,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=2977, Unknown=0, NotChecked=0, Total=4032 [2019-01-14 01:43:24,983 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand 64 states. [2019-01-14 01:43:25,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:43:25,483 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2019-01-14 01:43:25,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-14 01:43:25,484 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 362 [2019-01-14 01:43:25,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:43:25,485 INFO L225 Difference]: With dead ends: 254 [2019-01-14 01:43:25,485 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 01:43:25,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 331 SyntacticMatches, 29 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2374 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1055, Invalid=2977, Unknown=0, NotChecked=0, Total=4032 [2019-01-14 01:43:25,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 01:43:25,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 01:43:25,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 01:43:25,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 01:43:25,488 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 362 [2019-01-14 01:43:25,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:43:25,488 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 01:43:25,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-14 01:43:25,488 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 01:43:25,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 01:43:25,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 01:43:25,764 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 20 [2019-01-14 01:43:25,767 INFO L448 ceAbstractionStarter]: For program point hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 01:43:25,767 INFO L448 ceAbstractionStarter]: For program point hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 01:43:25,767 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-01-14 01:43:25,767 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-01-14 01:43:25,768 INFO L444 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (let ((.cse0 (< |hanoi_#in~n| 1))) (and (or (< 30 |hanoi_#in~n|) .cse0 (<= hanoi_~n |hanoi_#in~n|)) (or .cse0 (< 31 |hanoi_#in~n|) (and (<= hanoi_~n 31) (<= 1 hanoi_~n) (not (= 1 hanoi_~n)))))) [2019-01-14 01:43:25,768 INFO L448 ceAbstractionStarter]: For program point hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 01:43:25,768 INFO L448 ceAbstractionStarter]: For program point hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 01:43:25,768 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 19) no Hoare annotation was computed. [2019-01-14 01:43:25,768 INFO L448 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-01-14 01:43:25,768 INFO L448 ceAbstractionStarter]: For program point L20-4(line 20) no Hoare annotation was computed. [2019-01-14 01:43:25,768 INFO L448 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2019-01-14 01:43:25,768 INFO L448 ceAbstractionStarter]: For program point L20-6(line 20) no Hoare annotation was computed. [2019-01-14 01:43:25,768 INFO L448 ceAbstractionStarter]: For program point hanoiEXIT(lines 16 21) no Hoare annotation was computed. [2019-01-14 01:43:25,769 INFO L448 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2019-01-14 01:43:25,769 INFO L451 ceAbstractionStarter]: At program point hanoiENTRY(lines 16 21) the Hoare annotation is: true [2019-01-14 01:43:25,769 INFO L448 ceAbstractionStarter]: For program point hanoiFINAL(lines 16 21) no Hoare annotation was computed. [2019-01-14 01:43:25,769 INFO L448 ceAbstractionStarter]: For program point hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 01:43:25,769 INFO L448 ceAbstractionStarter]: For program point hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 01:43:25,769 INFO L448 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-01-14 01:43:25,769 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 01:43:25,769 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 34) no Hoare annotation was computed. [2019-01-14 01:43:25,769 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 01:43:25,769 INFO L444 ceAbstractionStarter]: At program point L29(line 29) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~n~0) (<= ULTIMATE.start_main_~n~0 31)) [2019-01-14 01:43:25,770 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 01:43:25,770 INFO L448 ceAbstractionStarter]: For program point L29-1(line 29) no Hoare annotation was computed. [2019-01-14 01:43:25,770 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2019-01-14 01:43:25,770 INFO L451 ceAbstractionStarter]: At program point L24(lines 24 35) the Hoare annotation is: true [2019-01-14 01:43:25,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 01:43:25 BoogieIcfgContainer [2019-01-14 01:43:25,781 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 01:43:25,782 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 01:43:25,782 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 01:43:25,782 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 01:43:25,783 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:42:09" (3/4) ... [2019-01-14 01:43:25,786 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 01:43:25,793 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure hanoi [2019-01-14 01:43:25,797 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-14 01:43:25,797 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 01:43:25,844 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 01:43:25,845 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 01:43:25,846 INFO L168 Benchmark]: Toolchain (without parser) took 77031.46 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 615.5 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -184.0 MB). Peak memory consumption was 431.5 MB. Max. memory is 11.5 GB. [2019-01-14 01:43:25,846 INFO L168 Benchmark]: CDTParser took 1.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-14 01:43:25,851 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.84 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 01:43:25,852 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.80 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:43:25,852 INFO L168 Benchmark]: Boogie Preprocessor took 18.57 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:43:25,852 INFO L168 Benchmark]: RCFGBuilder took 384.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.7 MB). Free memory was 941.9 MB in the beginning and 1.2 GB in the end (delta: -213.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-14 01:43:25,855 INFO L168 Benchmark]: TraceAbstraction took 76253.91 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 437.8 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 456.3 MB. Max. memory is 11.5 GB. [2019-01-14 01:43:25,857 INFO L168 Benchmark]: Witness Printer took 62.92 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-14 01:43:25,861 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.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 268.84 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 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 37.80 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.57 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 384.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.7 MB). Free memory was 941.9 MB in the beginning and 1.2 GB in the end (delta: -213.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 76253.91 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 437.8 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 456.3 MB. Max. memory is 11.5 GB. * Witness Printer took 62.92 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. 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, 76.1s OverallTime, 39 OverallIterations, 34 TraceHistogramMax, 29.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 636 SDtfs, 3454 SDslu, 11470 SDs, 0 SdLazy, 22684 SolverSat, 976 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7396 GetRequests, 5701 SyntacticMatches, 414 SemanticMatches, 1281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38009 ImplicationChecksByTransitivity, 44.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=350occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 39 MinimizatonAttempts, 234 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 20 PreInvPairs, 22 NumberOfFragments, 42 HoareAnnotationTreeSize, 20 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 323 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 41.3s InterpolantComputationTime, 12457 NumberOfCodeBlocks, 12352 NumberOfCodeBlocksAsserted, 351 NumberOfCheckSat, 12382 ConstructedInterpolants, 0 QuantifiedInterpolants, 6594160 SizeOfPredicates, 62 NumberOfNonLiveVariables, 10560 ConjunctsInSsa, 1048 ConjunctsInUnsatCore, 75 InterpolantComputations, 4 PerfectInterpolantSequences, 65748/125386 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...