./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/recursive/recHanoi03_true-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/recursive/recHanoi03_true-unreach-call_true-no-overflow_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 887ada769b510ae5d273618525924110908f2b5f .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:13:53,419 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:13:53,421 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:13:53,434 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:13:53,434 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:13:53,435 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:13:53,437 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:13:53,439 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:13:53,444 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:13:53,445 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:13:53,447 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:13:53,447 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:13:53,448 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:13:53,454 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:13:53,455 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:13:53,456 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:13:53,461 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:13:53,467 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:13:53,472 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:13:53,474 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:13:53,478 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:13:53,479 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:13:53,485 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:13:53,488 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:13:53,488 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:13:53,489 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:13:53,490 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:13:53,493 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:13:53,495 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:13:53,499 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:13:53,500 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:13:53,500 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:13:53,501 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:13:53,501 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:13:53,504 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:13:53,505 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:13:53,505 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-01-01 21:13:53,529 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:13:53,529 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:13:53,534 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:13:53,534 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:13:53,534 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:13:53,534 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:13:53,535 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 21:13:53,536 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:13:53,536 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:13:53,536 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 21:13:53,536 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:13:53,536 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 21:13:53,537 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 21:13:53,537 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 21:13:53,537 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-01 21:13:53,537 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 21:13:53,537 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:13:53,537 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:13:53,539 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 21:13:53,539 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:13:53,539 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:13:53,539 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 21:13:53,540 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 21:13:53,540 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 21:13:53,540 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:13:53,540 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 21:13:53,540 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 21:13:53,540 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:13:53,541 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 21:13:53,541 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 21:13:53,541 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 887ada769b510ae5d273618525924110908f2b5f [2019-01-01 21:13:53,600 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:13:53,616 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:13:53,623 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:13:53,625 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:13:53,625 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:13:53,626 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive/recHanoi03_true-unreach-call_true-no-overflow_true-termination.c [2019-01-01 21:13:53,704 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a2b19d2f/27ae301c990a4ec68deb1386b29c0f59/FLAG4b4ab23e4 [2019-01-01 21:13:54,184 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:13:54,185 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive/recHanoi03_true-unreach-call_true-no-overflow_true-termination.c [2019-01-01 21:13:54,191 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a2b19d2f/27ae301c990a4ec68deb1386b29c0f59/FLAG4b4ab23e4 [2019-01-01 21:13:54,569 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a2b19d2f/27ae301c990a4ec68deb1386b29c0f59 [2019-01-01 21:13:54,572 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:13:54,574 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:13:54,575 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:13:54,575 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:13:54,579 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:13:54,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:13:54" (1/1) ... [2019-01-01 21:13:54,583 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@774878b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:13:54, skipping insertion in model container [2019-01-01 21:13:54,583 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:13:54" (1/1) ... [2019-01-01 21:13:54,591 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:13:54,610 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:13:54,798 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:13:54,802 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:13:54,817 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:13:54,833 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:13:54,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:13:54 WrapperNode [2019-01-01 21:13:54,834 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:13:54,835 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:13:54,835 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:13:54,835 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:13:54,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:13:54" (1/1) ... [2019-01-01 21:13:54,847 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:13:54" (1/1) ... [2019-01-01 21:13:54,868 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:13:54,869 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:13:54,869 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:13:54,869 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:13:54,878 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:13:54" (1/1) ... [2019-01-01 21:13:54,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:13:54" (1/1) ... [2019-01-01 21:13:54,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:13:54" (1/1) ... [2019-01-01 21:13:54,879 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:13:54" (1/1) ... [2019-01-01 21:13:54,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:13:54" (1/1) ... [2019-01-01 21:13:54,884 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:13:54" (1/1) ... [2019-01-01 21:13:54,885 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:13:54" (1/1) ... [2019-01-01 21:13:54,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:13:54,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:13:54,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:13:54,887 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:13:54,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:13:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 21:13:55,025 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2019-01-01 21:13:55,025 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2019-01-01 21:13:55,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:13:55,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:13:55,297 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:13:55,298 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-01 21:13:55,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:13:55 BoogieIcfgContainer [2019-01-01 21:13:55,299 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:13:55,300 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 21:13:55,300 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 21:13:55,303 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 21:13:55,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 09:13:54" (1/3) ... [2019-01-01 21:13:55,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd342d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 09:13:55, skipping insertion in model container [2019-01-01 21:13:55,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:13:54" (2/3) ... [2019-01-01 21:13:55,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd342d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 09:13:55, skipping insertion in model container [2019-01-01 21:13:55,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:13:55" (3/3) ... [2019-01-01 21:13:55,308 INFO L112 eAbstractionObserver]: Analyzing ICFG recHanoi03_true-unreach-call_true-no-overflow_true-termination.c [2019-01-01 21:13:55,319 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 21:13:55,328 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-01 21:13:55,347 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-01 21:13:55,380 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:13:55,381 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 21:13:55,382 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 21:13:55,382 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 21:13:55,382 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:13:55,382 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:13:55,382 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 21:13:55,383 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:13:55,383 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 21:13:55,402 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-01-01 21:13:55,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-01 21:13:55,408 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:13:55,409 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:13:55,411 INFO L423 AbstractCegarLoop]: === Iteration 1 === [hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:13:55,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:13:55,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1513948958, now seen corresponding path program 1 times [2019-01-01 21:13:55,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:13:55,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:13:55,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:13:55,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:13:55,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:13:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:13:55,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:13:55,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:13:55,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 21:13:55,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 21:13:55,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:13:55,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:13:55,773 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2019-01-01 21:13:55,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:13:55,918 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-01-01 21:13:55,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 21:13:55,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-01-01 21:13:55,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:13:55,931 INFO L225 Difference]: With dead ends: 33 [2019-01-01 21:13:55,931 INFO L226 Difference]: Without dead ends: 20 [2019-01-01 21:13:55,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 21:13:55,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-01 21:13:55,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-01 21:13:55,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-01 21:13:55,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-01-01 21:13:55,971 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 6 [2019-01-01 21:13:55,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:13:55,972 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-01-01 21:13:55,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 21:13:55,972 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-01-01 21:13:55,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-01 21:13:55,972 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:13:55,972 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:13:55,973 INFO L423 AbstractCegarLoop]: === Iteration 2 === [hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:13:55,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:13:55,974 INFO L82 PathProgramCache]: Analyzing trace with hash -312222520, now seen corresponding path program 1 times [2019-01-01 21:13:55,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:13:55,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:13:55,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:13:55,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:13:55,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:13:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:13:56,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:13:56,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:13:56,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 21:13:56,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 21:13:56,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:13:56,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:13:56,241 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2019-01-01 21:13:56,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:13:56,578 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-01-01 21:13:56,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 21:13:56,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-01 21:13:56,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:13:56,583 INFO L225 Difference]: With dead ends: 39 [2019-01-01 21:13:56,583 INFO L226 Difference]: Without dead ends: 36 [2019-01-01 21:13:56,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 21:13:56,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-01 21:13:56,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2019-01-01 21:13:56,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-01 21:13:56,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-01-01 21:13:56,598 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 7 [2019-01-01 21:13:56,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:13:56,598 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-01-01 21:13:56,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 21:13:56,598 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-01-01 21:13:56,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-01 21:13:56,601 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:13:56,601 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 21:13:56,602 INFO L423 AbstractCegarLoop]: === Iteration 3 === [hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:13:56,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:13:56,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1144431293, now seen corresponding path program 1 times [2019-01-01 21:13:56,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:13:56,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:13:56,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:13:56,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:13:56,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:13:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:13:56,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:13:56,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:13:56,771 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:13:56,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:13:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:13:56,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:13:56,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:13:56,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:13:56,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-01 21:13:56,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 21:13:56,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 21:13:56,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 21:13:56,859 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 7 states. [2019-01-01 21:13:57,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:13:57,187 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-01-01 21:13:57,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 21:13:57,189 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-01 21:13:57,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:13:57,190 INFO L225 Difference]: With dead ends: 55 [2019-01-01 21:13:57,190 INFO L226 Difference]: Without dead ends: 54 [2019-01-01 21:13:57,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-01 21:13:57,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-01 21:13:57,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 42. [2019-01-01 21:13:57,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-01 21:13:57,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2019-01-01 21:13:57,203 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 12 [2019-01-01 21:13:57,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:13:57,203 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-01-01 21:13:57,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 21:13:57,203 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2019-01-01 21:13:57,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-01 21:13:57,204 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:13:57,204 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:13:57,205 INFO L423 AbstractCegarLoop]: === Iteration 4 === [hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:13:57,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:13:57,205 INFO L82 PathProgramCache]: Analyzing trace with hash -287349001, now seen corresponding path program 1 times [2019-01-01 21:13:57,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:13:57,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:13:57,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:13:57,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:13:57,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:13:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:13:57,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 21:13:57,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:13:57,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 21:13:57,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 21:13:57,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 21:13:57,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 21:13:57,304 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand 4 states. [2019-01-01 21:13:57,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:13:57,362 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2019-01-01 21:13:57,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 21:13:57,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-01-01 21:13:57,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:13:57,366 INFO L225 Difference]: With dead ends: 63 [2019-01-01 21:13:57,366 INFO L226 Difference]: Without dead ends: 61 [2019-01-01 21:13:57,367 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-01 21:13:57,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-01 21:13:57,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2019-01-01 21:13:57,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-01 21:13:57,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2019-01-01 21:13:57,380 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 14 [2019-01-01 21:13:57,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:13:57,380 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2019-01-01 21:13:57,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 21:13:57,380 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2019-01-01 21:13:57,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-01 21:13:57,381 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:13:57,381 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:13:57,382 INFO L423 AbstractCegarLoop]: === Iteration 5 === [hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:13:57,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:13:57,382 INFO L82 PathProgramCache]: Analyzing trace with hash -317884395, now seen corresponding path program 1 times [2019-01-01 21:13:57,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:13:57,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:13:57,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:13:57,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:13:57,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:13:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:13:57,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 21:13:57,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:13:57,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 21:13:57,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 21:13:57,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 21:13:57,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 21:13:57,475 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand 4 states. [2019-01-01 21:13:57,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:13:57,527 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2019-01-01 21:13:57,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 21:13:57,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-01-01 21:13:57,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:13:57,531 INFO L225 Difference]: With dead ends: 58 [2019-01-01 21:13:57,532 INFO L226 Difference]: Without dead ends: 49 [2019-01-01 21:13:57,532 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-01 21:13:57,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-01 21:13:57,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-01 21:13:57,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-01 21:13:57,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2019-01-01 21:13:57,549 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 15 [2019-01-01 21:13:57,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:13:57,549 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2019-01-01 21:13:57,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 21:13:57,549 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2019-01-01 21:13:57,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-01 21:13:57,550 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:13:57,550 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1] [2019-01-01 21:13:57,551 INFO L423 AbstractCegarLoop]: === Iteration 6 === [hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:13:57,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:13:57,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1656222120, now seen corresponding path program 2 times [2019-01-01 21:13:57,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:13:57,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:13:57,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:13:57,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:13:57,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:13:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:13:57,702 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:13:57,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:13:57,703 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:13:57,713 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:13:57,726 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:13:57,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:13:57,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:13:57,737 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:13:57,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:13:57,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-01 21:13:57,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 21:13:57,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 21:13:57,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-01 21:13:57,767 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 9 states. [2019-01-01 21:13:58,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:13:58,286 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2019-01-01 21:13:58,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 21:13:58,292 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-01-01 21:13:58,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:13:58,293 INFO L225 Difference]: With dead ends: 74 [2019-01-01 21:13:58,294 INFO L226 Difference]: Without dead ends: 73 [2019-01-01 21:13:58,294 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-01 21:13:58,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-01 21:13:58,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2019-01-01 21:13:58,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-01 21:13:58,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2019-01-01 21:13:58,308 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 17 [2019-01-01 21:13:58,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:13:58,308 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2019-01-01 21:13:58,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 21:13:58,308 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2019-01-01 21:13:58,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-01 21:13:58,309 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:13:58,310 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1] [2019-01-01 21:13:58,310 INFO L423 AbstractCegarLoop]: === Iteration 7 === [hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:13:58,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:13:58,311 INFO L82 PathProgramCache]: Analyzing trace with hash 438260835, now seen corresponding path program 3 times [2019-01-01 21:13:58,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:13:58,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:13:58,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:13:58,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:13:58,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:13:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:13:58,549 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:13:58,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:13:58,550 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:13:58,563 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 21:13:58,584 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-01 21:13:58,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:13:58,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:13:58,596 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:13:58,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:13:58,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-01 21:13:58,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 21:13:58,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 21:13:58,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-01-01 21:13:58,625 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand 11 states. [2019-01-01 21:13:59,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:13:59,331 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2019-01-01 21:13:59,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 21:13:59,332 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-01-01 21:13:59,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:13:59,335 INFO L225 Difference]: With dead ends: 94 [2019-01-01 21:13:59,335 INFO L226 Difference]: Without dead ends: 93 [2019-01-01 21:13:59,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-01-01 21:13:59,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-01 21:13:59,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2019-01-01 21:13:59,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-01 21:13:59,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2019-01-01 21:13:59,353 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 22 [2019-01-01 21:13:59,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:13:59,353 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2019-01-01 21:13:59,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 21:13:59,353 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2019-01-01 21:13:59,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-01 21:13:59,355 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:13:59,355 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1] [2019-01-01 21:13:59,355 INFO L423 AbstractCegarLoop]: === Iteration 8 === [hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:13:59,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:13:59,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1696558728, now seen corresponding path program 4 times [2019-01-01 21:13:59,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:13:59,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:13:59,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:13:59,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:13:59,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:13:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:13:59,589 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:13:59,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:13:59,589 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:13:59,606 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 21:13:59,618 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 21:13:59,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:13:59,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:13:59,635 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:13:59,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:13:59,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-01-01 21:13:59,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 21:13:59,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 21:13:59,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-01-01 21:13:59,663 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand 13 states. [2019-01-01 21:13:59,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:13:59,988 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2019-01-01 21:13:59,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-01 21:13:59,989 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2019-01-01 21:13:59,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:13:59,990 INFO L225 Difference]: With dead ends: 114 [2019-01-01 21:13:59,990 INFO L226 Difference]: Without dead ends: 113 [2019-01-01 21:13:59,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2019-01-01 21:13:59,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-01 21:14:00,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2019-01-01 21:14:00,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-01 21:14:00,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2019-01-01 21:14:00,005 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 27 [2019-01-01 21:14:00,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:14:00,005 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2019-01-01 21:14:00,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 21:14:00,006 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2019-01-01 21:14:00,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-01 21:14:00,008 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:14:00,008 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:14:00,010 INFO L423 AbstractCegarLoop]: === Iteration 9 === [hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:14:00,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:14:00,011 INFO L82 PathProgramCache]: Analyzing trace with hash -563967927, now seen corresponding path program 1 times [2019-01-01 21:14:00,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:14:00,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:14:00,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:00,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:14:00,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:00,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:00,153 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-01 21:14:00,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:14:00,154 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:14:00,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:14:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:00,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:14:00,218 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-01 21:14:00,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:14:00,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-01 21:14:00,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 21:14:00,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 21:14:00,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 21:14:00,240 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand 6 states. [2019-01-01 21:14:00,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:14:00,312 INFO L93 Difference]: Finished difference Result 149 states and 174 transitions. [2019-01-01 21:14:00,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 21:14:00,320 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-01-01 21:14:00,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:14:00,322 INFO L225 Difference]: With dead ends: 149 [2019-01-01 21:14:00,322 INFO L226 Difference]: Without dead ends: 134 [2019-01-01 21:14:00,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 21:14:00,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-01-01 21:14:00,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 129. [2019-01-01 21:14:00,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-01 21:14:00,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 144 transitions. [2019-01-01 21:14:00,348 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 144 transitions. Word has length 26 [2019-01-01 21:14:00,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:14:00,348 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 144 transitions. [2019-01-01 21:14:00,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 21:14:00,348 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 144 transitions. [2019-01-01 21:14:00,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-01 21:14:00,349 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:14:00,352 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1] [2019-01-01 21:14:00,353 INFO L423 AbstractCegarLoop]: === Iteration 10 === [hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:14:00,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:14:00,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1757224061, now seen corresponding path program 5 times [2019-01-01 21:14:00,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:14:00,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:14:00,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:00,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:14:00,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:00,570 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:14:00,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:14:00,570 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:14:00,588 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 21:14:00,683 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-01 21:14:00,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:14:00,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:14:00,704 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:14:00,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:14:00,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-01-01 21:14:00,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-01 21:14:00,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-01 21:14:00,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-01-01 21:14:00,736 INFO L87 Difference]: Start difference. First operand 129 states and 144 transitions. Second operand 15 states. [2019-01-01 21:14:01,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:14:01,200 INFO L93 Difference]: Finished difference Result 167 states and 173 transitions. [2019-01-01 21:14:01,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-01 21:14:01,201 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2019-01-01 21:14:01,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:14:01,203 INFO L225 Difference]: With dead ends: 167 [2019-01-01 21:14:01,203 INFO L226 Difference]: Without dead ends: 166 [2019-01-01 21:14:01,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2019-01-01 21:14:01,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-01 21:14:01,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 154. [2019-01-01 21:14:01,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-01-01 21:14:01,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 172 transitions. [2019-01-01 21:14:01,219 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 172 transitions. Word has length 32 [2019-01-01 21:14:01,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:14:01,219 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 172 transitions. [2019-01-01 21:14:01,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-01 21:14:01,219 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 172 transitions. [2019-01-01 21:14:01,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-01 21:14:01,223 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:14:01,223 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1] [2019-01-01 21:14:01,224 INFO L423 AbstractCegarLoop]: === Iteration 11 === [hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:14:01,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:14:01,224 INFO L82 PathProgramCache]: Analyzing trace with hash -512208024, now seen corresponding path program 6 times [2019-01-01 21:14:01,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:14:01,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:14:01,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:01,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:14:01,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:01,771 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:14:01,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:14:01,771 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:14:01,786 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 21:14:01,813 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-01 21:14:01,813 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:14:01,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:14:01,891 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-01 21:14:01,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:14:01,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 17 [2019-01-01 21:14:01,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-01 21:14:01,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-01 21:14:01,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-01-01 21:14:01,920 INFO L87 Difference]: Start difference. First operand 154 states and 172 transitions. Second operand 18 states. [2019-01-01 21:14:01,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:14:01,975 INFO L93 Difference]: Finished difference Result 154 states and 172 transitions. [2019-01-01 21:14:01,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 21:14:01,976 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2019-01-01 21:14:01,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:14:01,978 INFO L225 Difference]: With dead ends: 154 [2019-01-01 21:14:01,978 INFO L226 Difference]: Without dead ends: 153 [2019-01-01 21:14:01,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-01-01 21:14:01,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-01-01 21:14:01,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-01-01 21:14:01,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-01-01 21:14:01,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 171 transitions. [2019-01-01 21:14:01,988 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 171 transitions. Word has length 37 [2019-01-01 21:14:01,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:14:01,989 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 171 transitions. [2019-01-01 21:14:01,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-01 21:14:01,989 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 171 transitions. [2019-01-01 21:14:01,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-01 21:14:01,991 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:14:01,991 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-01 21:14:01,991 INFO L423 AbstractCegarLoop]: === Iteration 12 === [hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:14:01,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:14:01,991 INFO L82 PathProgramCache]: Analyzing trace with hash 867149367, now seen corresponding path program 2 times [2019-01-01 21:14:01,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:14:01,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:14:01,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:01,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:14:01,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:02,117 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-01 21:14:02,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:14:02,118 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:14:02,129 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:14:02,140 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:14:02,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:14:02,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:14:02,188 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-01 21:14:02,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:14:02,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-01 21:14:02,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 21:14:02,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 21:14:02,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-01 21:14:02,212 INFO L87 Difference]: Start difference. First operand 153 states and 171 transitions. Second operand 8 states. [2019-01-01 21:14:02,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:14:02,283 INFO L93 Difference]: Finished difference Result 207 states and 237 transitions. [2019-01-01 21:14:02,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 21:14:02,288 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2019-01-01 21:14:02,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:14:02,290 INFO L225 Difference]: With dead ends: 207 [2019-01-01 21:14:02,290 INFO L226 Difference]: Without dead ends: 185 [2019-01-01 21:14:02,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-01 21:14:02,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-01-01 21:14:02,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 179. [2019-01-01 21:14:02,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-01-01 21:14:02,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 197 transitions. [2019-01-01 21:14:02,305 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 197 transitions. Word has length 38 [2019-01-01 21:14:02,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:14:02,307 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 197 transitions. [2019-01-01 21:14:02,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 21:14:02,307 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 197 transitions. [2019-01-01 21:14:02,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-01 21:14:02,310 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:14:02,310 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2019-01-01 21:14:02,310 INFO L423 AbstractCegarLoop]: === Iteration 13 === [hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:14:02,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:14:02,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1066180599, now seen corresponding path program 3 times [2019-01-01 21:14:02,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:14:02,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:14:02,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:02,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:14:02,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:02,463 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-01-01 21:14:02,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:14:02,464 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:14:02,474 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 21:14:02,509 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-01 21:14:02,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:14:02,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:14:02,579 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-01-01 21:14:02,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:14:02,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-01 21:14:02,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 21:14:02,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 21:14:02,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-01 21:14:02,601 INFO L87 Difference]: Start difference. First operand 179 states and 197 transitions. Second operand 10 states. [2019-01-01 21:14:02,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:14:02,739 INFO L93 Difference]: Finished difference Result 233 states and 263 transitions. [2019-01-01 21:14:02,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 21:14:02,742 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-01-01 21:14:02,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:14:02,743 INFO L225 Difference]: With dead ends: 233 [2019-01-01 21:14:02,743 INFO L226 Difference]: Without dead ends: 204 [2019-01-01 21:14:02,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-01 21:14:02,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-01-01 21:14:02,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 198. [2019-01-01 21:14:02,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-01-01 21:14:02,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 216 transitions. [2019-01-01 21:14:02,756 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 216 transitions. Word has length 50 [2019-01-01 21:14:02,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:14:02,757 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 216 transitions. [2019-01-01 21:14:02,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 21:14:02,757 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 216 transitions. [2019-01-01 21:14:02,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-01 21:14:02,760 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:14:02,760 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2019-01-01 21:14:02,760 INFO L423 AbstractCegarLoop]: === Iteration 14 === [hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:14:02,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:14:02,761 INFO L82 PathProgramCache]: Analyzing trace with hash -158018185, now seen corresponding path program 4 times [2019-01-01 21:14:02,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:14:02,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:14:02,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:02,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:14:02,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:02,906 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-01-01 21:14:02,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:14:02,907 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:14:02,917 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 21:14:02,962 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 21:14:02,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:14:02,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:14:03,276 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-01-01 21:14:03,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:14:03,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-01-01 21:14:03,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 21:14:03,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 21:14:03,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-01-01 21:14:03,299 INFO L87 Difference]: Start difference. First operand 198 states and 216 transitions. Second operand 12 states. [2019-01-01 21:14:03,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:14:03,372 INFO L93 Difference]: Finished difference Result 252 states and 282 transitions. [2019-01-01 21:14:03,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 21:14:03,378 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2019-01-01 21:14:03,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:14:03,380 INFO L225 Difference]: With dead ends: 252 [2019-01-01 21:14:03,380 INFO L226 Difference]: Without dead ends: 216 [2019-01-01 21:14:03,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-01-01 21:14:03,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-01-01 21:14:03,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 210. [2019-01-01 21:14:03,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-01 21:14:03,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 228 transitions. [2019-01-01 21:14:03,392 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 228 transitions. Word has length 62 [2019-01-01 21:14:03,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:14:03,392 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 228 transitions. [2019-01-01 21:14:03,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 21:14:03,393 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 228 transitions. [2019-01-01 21:14:03,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-01 21:14:03,394 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:14:03,395 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2019-01-01 21:14:03,395 INFO L423 AbstractCegarLoop]: === Iteration 15 === [hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:14:03,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:14:03,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1955313719, now seen corresponding path program 5 times [2019-01-01 21:14:03,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:14:03,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:14:03,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:03,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:14:03,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:03,581 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-01-01 21:14:03,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:14:03,582 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:14:03,591 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 21:14:03,621 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-01-01 21:14:03,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:14:03,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:14:04,065 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-01-01 21:14:04,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:14:04,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-01-01 21:14:04,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-01 21:14:04,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-01 21:14:04,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-01-01 21:14:04,088 INFO L87 Difference]: Start difference. First operand 210 states and 228 transitions. Second operand 14 states. [2019-01-01 21:14:04,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:14:04,218 INFO L93 Difference]: Finished difference Result 264 states and 294 transitions. [2019-01-01 21:14:04,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 21:14:04,219 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2019-01-01 21:14:04,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:14:04,221 INFO L225 Difference]: With dead ends: 264 [2019-01-01 21:14:04,221 INFO L226 Difference]: Without dead ends: 223 [2019-01-01 21:14:04,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 69 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-01-01 21:14:04,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-01-01 21:14:04,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 217. [2019-01-01 21:14:04,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-01 21:14:04,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 235 transitions. [2019-01-01 21:14:04,232 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 235 transitions. Word has length 74 [2019-01-01 21:14:04,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:14:04,233 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 235 transitions. [2019-01-01 21:14:04,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-01 21:14:04,233 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 235 transitions. [2019-01-01 21:14:04,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-01 21:14:04,234 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:14:04,235 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2019-01-01 21:14:04,235 INFO L423 AbstractCegarLoop]: === Iteration 16 === [hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:14:04,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:14:04,235 INFO L82 PathProgramCache]: Analyzing trace with hash -330632009, now seen corresponding path program 6 times [2019-01-01 21:14:04,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:14:04,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:14:04,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:04,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:14:04,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:04,555 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-01-01 21:14:04,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:14:04,555 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:14:04,571 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 21:14:04,629 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-01-01 21:14:04,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:14:04,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:14:04,755 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-01-01 21:14:04,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:14:04,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-01-01 21:14:04,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-01 21:14:04,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-01 21:14:04,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-01-01 21:14:04,775 INFO L87 Difference]: Start difference. First operand 217 states and 235 transitions. Second operand 16 states. [2019-01-01 21:14:04,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:14:04,993 INFO L93 Difference]: Finished difference Result 271 states and 301 transitions. [2019-01-01 21:14:04,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-01 21:14:04,994 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 86 [2019-01-01 21:14:04,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:14:04,996 INFO L225 Difference]: With dead ends: 271 [2019-01-01 21:14:04,996 INFO L226 Difference]: Without dead ends: 230 [2019-01-01 21:14:04,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 80 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-01-01 21:14:04,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-01-01 21:14:05,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 224. [2019-01-01 21:14:05,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-01-01 21:14:05,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 242 transitions. [2019-01-01 21:14:05,008 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 242 transitions. Word has length 86 [2019-01-01 21:14:05,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:14:05,009 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 242 transitions. [2019-01-01 21:14:05,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-01 21:14:05,009 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 242 transitions. [2019-01-01 21:14:05,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-01 21:14:05,013 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:14:05,013 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2019-01-01 21:14:05,013 INFO L423 AbstractCegarLoop]: === Iteration 17 === [hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:14:05,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:14:05,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1775681655, now seen corresponding path program 7 times [2019-01-01 21:14:05,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:14:05,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:14:05,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:05,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:14:05,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:05,271 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-01-01 21:14:05,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:14:05,271 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:14:05,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:14:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:05,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:14:05,483 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-01-01 21:14:05,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:14:05,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-01-01 21:14:05,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-01 21:14:05,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-01 21:14:05,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-01-01 21:14:05,503 INFO L87 Difference]: Start difference. First operand 224 states and 242 transitions. Second operand 18 states. [2019-01-01 21:14:06,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:14:06,038 INFO L93 Difference]: Finished difference Result 278 states and 308 transitions. [2019-01-01 21:14:06,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-01 21:14:06,039 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2019-01-01 21:14:06,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:14:06,043 INFO L225 Difference]: With dead ends: 278 [2019-01-01 21:14:06,043 INFO L226 Difference]: Without dead ends: 237 [2019-01-01 21:14:06,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 91 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-01-01 21:14:06,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-01-01 21:14:06,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 231. [2019-01-01 21:14:06,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-01 21:14:06,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 249 transitions. [2019-01-01 21:14:06,067 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 249 transitions. Word has length 98 [2019-01-01 21:14:06,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:14:06,067 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 249 transitions. [2019-01-01 21:14:06,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-01 21:14:06,068 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 249 transitions. [2019-01-01 21:14:06,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-01 21:14:06,069 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:14:06,071 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2019-01-01 21:14:06,072 INFO L423 AbstractCegarLoop]: === Iteration 18 === [hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:14:06,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:14:06,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1888355319, now seen corresponding path program 8 times [2019-01-01 21:14:06,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:14:06,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:14:06,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:06,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:14:06,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:06,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:06,693 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-01-01 21:14:06,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:14:06,694 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:14:06,704 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:14:06,742 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:14:06,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:14:06,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:14:06,929 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-01-01 21:14:06,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:14:06,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2019-01-01 21:14:06,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-01 21:14:06,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-01 21:14:06,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-01-01 21:14:06,949 INFO L87 Difference]: Start difference. First operand 231 states and 249 transitions. Second operand 20 states. [2019-01-01 21:14:07,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:14:07,081 INFO L93 Difference]: Finished difference Result 285 states and 315 transitions. [2019-01-01 21:14:07,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-01 21:14:07,082 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 110 [2019-01-01 21:14:07,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:14:07,085 INFO L225 Difference]: With dead ends: 285 [2019-01-01 21:14:07,085 INFO L226 Difference]: Without dead ends: 244 [2019-01-01 21:14:07,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 102 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-01-01 21:14:07,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-01-01 21:14:07,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 238. [2019-01-01 21:14:07,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-01-01 21:14:07,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 256 transitions. [2019-01-01 21:14:07,096 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 256 transitions. Word has length 110 [2019-01-01 21:14:07,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:14:07,096 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 256 transitions. [2019-01-01 21:14:07,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-01 21:14:07,096 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 256 transitions. [2019-01-01 21:14:07,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-01-01 21:14:07,098 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:14:07,099 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2019-01-01 21:14:07,099 INFO L423 AbstractCegarLoop]: === Iteration 19 === [hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:14:07,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:14:07,099 INFO L82 PathProgramCache]: Analyzing trace with hash -329358962, now seen corresponding path program 9 times [2019-01-01 21:14:07,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:14:07,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:14:07,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:07,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:14:07,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:07,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:07,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1002 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2019-01-01 21:14:07,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:14:07,484 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:14:07,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 21:14:07,590 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-01 21:14:07,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:14:07,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:14:07,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1002 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2019-01-01 21:14:07,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:14:07,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2019-01-01 21:14:07,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-01 21:14:07,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-01 21:14:07,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-01-01 21:14:07,829 INFO L87 Difference]: Start difference. First operand 238 states and 256 transitions. Second operand 22 states. [2019-01-01 21:14:08,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:14:08,223 INFO L93 Difference]: Finished difference Result 292 states and 322 transitions. [2019-01-01 21:14:08,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-01 21:14:08,223 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 157 [2019-01-01 21:14:08,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:14:08,225 INFO L225 Difference]: With dead ends: 292 [2019-01-01 21:14:08,225 INFO L226 Difference]: Without dead ends: 251 [2019-01-01 21:14:08,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 148 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-01-01 21:14:08,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-01-01 21:14:08,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 245. [2019-01-01 21:14:08,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-01-01 21:14:08,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 263 transitions. [2019-01-01 21:14:08,236 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 263 transitions. Word has length 157 [2019-01-01 21:14:08,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:14:08,237 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 263 transitions. [2019-01-01 21:14:08,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-01 21:14:08,237 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 263 transitions. [2019-01-01 21:14:08,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-01-01 21:14:08,239 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:14:08,239 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2019-01-01 21:14:08,239 INFO L423 AbstractCegarLoop]: === Iteration 20 === [hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:14:08,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:14:08,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1310449148, now seen corresponding path program 10 times [2019-01-01 21:14:08,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:14:08,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:14:08,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:08,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:14:08,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:08,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:08,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 355 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2019-01-01 21:14:08,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:14:08,718 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:14:08,728 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 21:14:08,768 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 21:14:08,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:14:08,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:14:09,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 355 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2019-01-01 21:14:09,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:14:09,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2019-01-01 21:14:09,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-01 21:14:09,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-01 21:14:09,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-01-01 21:14:09,241 INFO L87 Difference]: Start difference. First operand 245 states and 263 transitions. Second operand 24 states. [2019-01-01 21:14:09,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:14:09,436 INFO L93 Difference]: Finished difference Result 299 states and 329 transitions. [2019-01-01 21:14:09,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-01 21:14:09,437 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 169 [2019-01-01 21:14:09,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:14:09,441 INFO L225 Difference]: With dead ends: 299 [2019-01-01 21:14:09,441 INFO L226 Difference]: Without dead ends: 258 [2019-01-01 21:14:09,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 159 SyntacticMatches, 10 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-01-01 21:14:09,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-01-01 21:14:09,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 252. [2019-01-01 21:14:09,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-01 21:14:09,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 270 transitions. [2019-01-01 21:14:09,455 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 270 transitions. Word has length 169 [2019-01-01 21:14:09,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:14:09,457 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 270 transitions. [2019-01-01 21:14:09,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-01 21:14:09,457 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 270 transitions. [2019-01-01 21:14:09,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-01-01 21:14:09,461 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:14:09,461 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2019-01-01 21:14:09,462 INFO L423 AbstractCegarLoop]: === Iteration 21 === [hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:14:09,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:14:09,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1656708873, now seen corresponding path program 11 times [2019-01-01 21:14:09,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:14:09,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:14:09,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:09,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:14:09,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:10,121 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2019-01-01 21:14:10,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:14:10,121 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:14:10,132 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 21:14:10,217 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-01-01 21:14:10,217 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:14:10,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:14:10,462 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2019-01-01 21:14:10,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:14:10,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2019-01-01 21:14:10,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-01 21:14:10,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-01 21:14:10,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2019-01-01 21:14:10,484 INFO L87 Difference]: Start difference. First operand 252 states and 270 transitions. Second operand 26 states. [2019-01-01 21:14:10,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:14:10,837 INFO L93 Difference]: Finished difference Result 306 states and 336 transitions. [2019-01-01 21:14:10,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-01 21:14:10,838 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 146 [2019-01-01 21:14:10,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:14:10,840 INFO L225 Difference]: With dead ends: 306 [2019-01-01 21:14:10,840 INFO L226 Difference]: Without dead ends: 265 [2019-01-01 21:14:10,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 135 SyntacticMatches, 11 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2019-01-01 21:14:10,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-01-01 21:14:10,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 259. [2019-01-01 21:14:10,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-01-01 21:14:10,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 277 transitions. [2019-01-01 21:14:10,859 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 277 transitions. Word has length 146 [2019-01-01 21:14:10,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:14:10,861 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 277 transitions. [2019-01-01 21:14:10,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-01 21:14:10,862 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 277 transitions. [2019-01-01 21:14:10,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-01-01 21:14:10,865 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:14:10,866 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1] [2019-01-01 21:14:10,867 INFO L423 AbstractCegarLoop]: === Iteration 22 === [hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:14:10,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:14:10,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1454043767, now seen corresponding path program 12 times [2019-01-01 21:14:10,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:14:10,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:14:10,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:10,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:14:10,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:10,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:12,655 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 0 proven. 510 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-01-01 21:14:12,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:14:12,656 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:14:12,668 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 21:14:12,733 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2019-01-01 21:14:12,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:14:12,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:14:13,011 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 0 proven. 510 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-01-01 21:14:13,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:14:13,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2019-01-01 21:14:13,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-01 21:14:13,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-01 21:14:13,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-01-01 21:14:13,032 INFO L87 Difference]: Start difference. First operand 259 states and 277 transitions. Second operand 28 states. [2019-01-01 21:14:13,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:14:13,208 INFO L93 Difference]: Finished difference Result 313 states and 343 transitions. [2019-01-01 21:14:13,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-01 21:14:13,211 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 158 [2019-01-01 21:14:13,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:14:13,214 INFO L225 Difference]: With dead ends: 313 [2019-01-01 21:14:13,214 INFO L226 Difference]: Without dead ends: 272 [2019-01-01 21:14:13,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 146 SyntacticMatches, 12 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-01-01 21:14:13,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-01-01 21:14:13,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 266. [2019-01-01 21:14:13,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-01-01 21:14:13,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 284 transitions. [2019-01-01 21:14:13,227 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 284 transitions. Word has length 158 [2019-01-01 21:14:13,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:14:13,227 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 284 transitions. [2019-01-01 21:14:13,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-01 21:14:13,227 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 284 transitions. [2019-01-01 21:14:13,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-01-01 21:14:13,232 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:14:13,232 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1] [2019-01-01 21:14:13,232 INFO L423 AbstractCegarLoop]: === Iteration 23 === [hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:14:13,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:14:13,233 INFO L82 PathProgramCache]: Analyzing trace with hash 350954254, now seen corresponding path program 13 times [2019-01-01 21:14:13,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:14:13,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:14:13,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:13,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:14:13,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:13,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:13,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1690 backedges. 0 proven. 598 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2019-01-01 21:14:13,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:14:13,829 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:14:13,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:14:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:13,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:14:14,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1690 backedges. 0 proven. 598 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2019-01-01 21:14:14,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:14:14,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2019-01-01 21:14:14,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-01 21:14:14,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-01 21:14:14,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2019-01-01 21:14:14,404 INFO L87 Difference]: Start difference. First operand 266 states and 284 transitions. Second operand 30 states. [2019-01-01 21:14:14,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:14:14,638 INFO L93 Difference]: Finished difference Result 320 states and 350 transitions. [2019-01-01 21:14:14,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-01 21:14:14,639 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 205 [2019-01-01 21:14:14,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:14:14,646 INFO L225 Difference]: With dead ends: 320 [2019-01-01 21:14:14,647 INFO L226 Difference]: Without dead ends: 279 [2019-01-01 21:14:14,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 192 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2019-01-01 21:14:14,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-01 21:14:14,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 273. [2019-01-01 21:14:14,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-01-01 21:14:14,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 291 transitions. [2019-01-01 21:14:14,665 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 291 transitions. Word has length 205 [2019-01-01 21:14:14,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:14:14,666 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 291 transitions. [2019-01-01 21:14:14,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-01 21:14:14,667 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 291 transitions. [2019-01-01 21:14:14,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-01-01 21:14:14,671 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:14:14,671 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1] [2019-01-01 21:14:14,672 INFO L423 AbstractCegarLoop]: === Iteration 24 === [hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:14:14,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:14:14,674 INFO L82 PathProgramCache]: Analyzing trace with hash -419025284, now seen corresponding path program 14 times [2019-01-01 21:14:14,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:14:14,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:14:14,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:14,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:14:14,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:15,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 693 refuted. 0 times theorem prover too weak. 1199 trivial. 0 not checked. [2019-01-01 21:14:15,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:14:15,385 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:14:15,396 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:14:15,449 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:14:15,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:14:15,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:14:16,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 693 refuted. 0 times theorem prover too weak. 1199 trivial. 0 not checked. [2019-01-01 21:14:16,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:14:16,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2019-01-01 21:14:16,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-01 21:14:16,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-01 21:14:16,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2019-01-01 21:14:16,210 INFO L87 Difference]: Start difference. First operand 273 states and 291 transitions. Second operand 32 states. [2019-01-01 21:14:16,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:14:16,403 INFO L93 Difference]: Finished difference Result 327 states and 357 transitions. [2019-01-01 21:14:16,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-01 21:14:16,405 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 217 [2019-01-01 21:14:16,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:14:16,408 INFO L225 Difference]: With dead ends: 327 [2019-01-01 21:14:16,408 INFO L226 Difference]: Without dead ends: 286 [2019-01-01 21:14:16,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 203 SyntacticMatches, 14 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2019-01-01 21:14:16,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-01-01 21:14:16,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 280. [2019-01-01 21:14:16,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-01-01 21:14:16,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 298 transitions. [2019-01-01 21:14:16,420 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 298 transitions. Word has length 217 [2019-01-01 21:14:16,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:14:16,421 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 298 transitions. [2019-01-01 21:14:16,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-01 21:14:16,423 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 298 transitions. [2019-01-01 21:14:16,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-01-01 21:14:16,428 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:14:16,428 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1] [2019-01-01 21:14:16,428 INFO L423 AbstractCegarLoop]: === Iteration 25 === [hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:14:16,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:14:16,430 INFO L82 PathProgramCache]: Analyzing trace with hash 537467854, now seen corresponding path program 15 times [2019-01-01 21:14:16,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:14:16,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:14:16,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:16,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:14:16,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:17,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2106 backedges. 0 proven. 795 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2019-01-01 21:14:17,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:14:17,254 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:14:17,265 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 21:14:17,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-01 21:14:17,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:14:17,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:14:18,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2106 backedges. 0 proven. 795 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2019-01-01 21:14:18,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:14:18,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2019-01-01 21:14:18,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-01 21:14:18,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-01 21:14:18,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2019-01-01 21:14:18,139 INFO L87 Difference]: Start difference. First operand 280 states and 298 transitions. Second operand 34 states. [2019-01-01 21:14:18,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:14:18,346 INFO L93 Difference]: Finished difference Result 334 states and 364 transitions. [2019-01-01 21:14:18,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-01 21:14:18,347 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 229 [2019-01-01 21:14:18,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:14:18,350 INFO L225 Difference]: With dead ends: 334 [2019-01-01 21:14:18,350 INFO L226 Difference]: Without dead ends: 293 [2019-01-01 21:14:18,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 214 SyntacticMatches, 15 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2019-01-01 21:14:18,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-01-01 21:14:18,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 287. [2019-01-01 21:14:18,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-01-01 21:14:18,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 305 transitions. [2019-01-01 21:14:18,361 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 305 transitions. Word has length 229 [2019-01-01 21:14:18,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:14:18,362 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 305 transitions. [2019-01-01 21:14:18,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-01 21:14:18,363 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 305 transitions. [2019-01-01 21:14:18,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-01-01 21:14:18,368 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:14:18,368 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1] [2019-01-01 21:14:18,369 INFO L423 AbstractCegarLoop]: === Iteration 26 === [hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:14:18,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:14:18,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1353465532, now seen corresponding path program 16 times [2019-01-01 21:14:18,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:14:18,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:14:18,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:18,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:14:18,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:19,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2332 backedges. 0 proven. 904 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2019-01-01 21:14:19,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:14:19,802 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:14:19,813 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 21:14:19,865 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 21:14:19,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:14:19,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:14:20,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2332 backedges. 0 proven. 904 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2019-01-01 21:14:20,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:14:20,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2019-01-01 21:14:20,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-01 21:14:20,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-01 21:14:20,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=919, Unknown=0, NotChecked=0, Total=1260 [2019-01-01 21:14:20,273 INFO L87 Difference]: Start difference. First operand 287 states and 305 transitions. Second operand 36 states. [2019-01-01 21:14:20,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:14:20,495 INFO L93 Difference]: Finished difference Result 341 states and 371 transitions. [2019-01-01 21:14:20,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-01 21:14:20,496 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 241 [2019-01-01 21:14:20,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:14:20,499 INFO L225 Difference]: With dead ends: 341 [2019-01-01 21:14:20,499 INFO L226 Difference]: Without dead ends: 300 [2019-01-01 21:14:20,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 225 SyntacticMatches, 16 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=341, Invalid=919, Unknown=0, NotChecked=0, Total=1260 [2019-01-01 21:14:20,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-01-01 21:14:20,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 294. [2019-01-01 21:14:20,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-01-01 21:14:20,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 312 transitions. [2019-01-01 21:14:20,510 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 312 transitions. Word has length 241 [2019-01-01 21:14:20,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:14:20,512 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 312 transitions. [2019-01-01 21:14:20,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-01 21:14:20,512 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 312 transitions. [2019-01-01 21:14:20,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-01-01 21:14:20,516 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:14:20,516 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1] [2019-01-01 21:14:20,516 INFO L423 AbstractCegarLoop]: === Iteration 27 === [hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:14:20,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:14:20,518 INFO L82 PathProgramCache]: Analyzing trace with hash -843307890, now seen corresponding path program 17 times [2019-01-01 21:14:20,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:14:20,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:14:20,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:20,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:14:20,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:21,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2570 backedges. 0 proven. 1020 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2019-01-01 21:14:21,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:14:21,126 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:14:21,135 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 21:14:21,213 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2019-01-01 21:14:21,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:14:21,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:14:21,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2570 backedges. 0 proven. 1020 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2019-01-01 21:14:21,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:14:21,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2019-01-01 21:14:21,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-01 21:14:21,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-01 21:14:21,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2019-01-01 21:14:21,675 INFO L87 Difference]: Start difference. First operand 294 states and 312 transitions. Second operand 38 states. [2019-01-01 21:14:22,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:14:22,032 INFO L93 Difference]: Finished difference Result 348 states and 378 transitions. [2019-01-01 21:14:22,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-01 21:14:22,033 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 253 [2019-01-01 21:14:22,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:14:22,036 INFO L225 Difference]: With dead ends: 348 [2019-01-01 21:14:22,036 INFO L226 Difference]: Without dead ends: 307 [2019-01-01 21:14:22,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 236 SyntacticMatches, 17 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2019-01-01 21:14:22,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-01-01 21:14:22,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 301. [2019-01-01 21:14:22,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-01-01 21:14:22,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 319 transitions. [2019-01-01 21:14:22,050 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 319 transitions. Word has length 253 [2019-01-01 21:14:22,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:14:22,052 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 319 transitions. [2019-01-01 21:14:22,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-01 21:14:22,052 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 319 transitions. [2019-01-01 21:14:22,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-01-01 21:14:22,055 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:14:22,055 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1] [2019-01-01 21:14:22,057 INFO L423 AbstractCegarLoop]: === Iteration 28 === [hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:14:22,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:14:22,057 INFO L82 PathProgramCache]: Analyzing trace with hash 349397047, now seen corresponding path program 18 times [2019-01-01 21:14:22,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:14:22,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:14:22,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:22,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:14:22,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:23,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2036 backedges. 0 proven. 1143 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2019-01-01 21:14:23,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:14:23,524 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:14:23,534 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 21:14:23,820 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2019-01-01 21:14:23,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:14:23,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:14:24,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2036 backedges. 0 proven. 1143 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2019-01-01 21:14:24,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:14:24,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2019-01-01 21:14:24,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-01 21:14:24,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-01 21:14:24,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1141, Unknown=0, NotChecked=0, Total=1560 [2019-01-01 21:14:24,473 INFO L87 Difference]: Start difference. First operand 301 states and 319 transitions. Second operand 40 states. [2019-01-01 21:14:24,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:14:24,851 INFO L93 Difference]: Finished difference Result 355 states and 385 transitions. [2019-01-01 21:14:24,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-01 21:14:24,852 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 230 [2019-01-01 21:14:24,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:14:24,856 INFO L225 Difference]: With dead ends: 355 [2019-01-01 21:14:24,856 INFO L226 Difference]: Without dead ends: 314 [2019-01-01 21:14:24,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 212 SyntacticMatches, 18 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=419, Invalid=1141, Unknown=0, NotChecked=0, Total=1560 [2019-01-01 21:14:24,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-01-01 21:14:24,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 308. [2019-01-01 21:14:24,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-01-01 21:14:24,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 326 transitions. [2019-01-01 21:14:24,869 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 326 transitions. Word has length 230 [2019-01-01 21:14:24,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:14:24,872 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 326 transitions. [2019-01-01 21:14:24,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-01 21:14:24,872 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 326 transitions. [2019-01-01 21:14:24,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-01-01 21:14:24,876 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:14:24,876 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1] [2019-01-01 21:14:24,876 INFO L423 AbstractCegarLoop]: === Iteration 29 === [hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:14:24,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:14:24,877 INFO L82 PathProgramCache]: Analyzing trace with hash -204980914, now seen corresponding path program 19 times [2019-01-01 21:14:24,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:14:24,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:14:24,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:24,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:14:24,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:26,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3082 backedges. 0 proven. 1273 refuted. 0 times theorem prover too weak. 1809 trivial. 0 not checked. [2019-01-01 21:14:26,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:14:26,339 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:14:26,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:14:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:26,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:14:28,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3082 backedges. 0 proven. 1273 refuted. 0 times theorem prover too weak. 1809 trivial. 0 not checked. [2019-01-01 21:14:28,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:14:28,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2019-01-01 21:14:28,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-01 21:14:28,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-01 21:14:28,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1261, Unknown=0, NotChecked=0, Total=1722 [2019-01-01 21:14:28,172 INFO L87 Difference]: Start difference. First operand 308 states and 326 transitions. Second operand 42 states. [2019-01-01 21:14:28,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:14:28,593 INFO L93 Difference]: Finished difference Result 362 states and 392 transitions. [2019-01-01 21:14:28,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-01 21:14:28,595 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 277 [2019-01-01 21:14:28,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:14:28,598 INFO L225 Difference]: With dead ends: 362 [2019-01-01 21:14:28,598 INFO L226 Difference]: Without dead ends: 321 [2019-01-01 21:14:28,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 258 SyntacticMatches, 19 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=461, Invalid=1261, Unknown=0, NotChecked=0, Total=1722 [2019-01-01 21:14:28,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-01-01 21:14:28,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 315. [2019-01-01 21:14:28,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-01-01 21:14:28,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 333 transitions. [2019-01-01 21:14:28,609 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 333 transitions. Word has length 277 [2019-01-01 21:14:28,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:14:28,610 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 333 transitions. [2019-01-01 21:14:28,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-01 21:14:28,610 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 333 transitions. [2019-01-01 21:14:28,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-01-01 21:14:28,615 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:14:28,615 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 21, 21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1] [2019-01-01 21:14:28,615 INFO L423 AbstractCegarLoop]: === Iteration 30 === [hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:14:28,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:14:28,616 INFO L82 PathProgramCache]: Analyzing trace with hash -2063192260, now seen corresponding path program 20 times [2019-01-01 21:14:28,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:14:28,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:14:28,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:28,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:14:28,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:29,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3356 backedges. 0 proven. 1410 refuted. 0 times theorem prover too weak. 1946 trivial. 0 not checked. [2019-01-01 21:14:29,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:14:29,833 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:14:29,844 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:14:29,922 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:14:29,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:14:29,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:14:30,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3356 backedges. 0 proven. 1410 refuted. 0 times theorem prover too weak. 1946 trivial. 0 not checked. [2019-01-01 21:14:30,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:14:30,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2019-01-01 21:14:30,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-01 21:14:30,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-01 21:14:30,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2019-01-01 21:14:30,640 INFO L87 Difference]: Start difference. First operand 315 states and 333 transitions. Second operand 44 states. [2019-01-01 21:14:30,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:14:30,934 INFO L93 Difference]: Finished difference Result 369 states and 399 transitions. [2019-01-01 21:14:30,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-01 21:14:30,935 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 289 [2019-01-01 21:14:30,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:14:30,938 INFO L225 Difference]: With dead ends: 369 [2019-01-01 21:14:30,938 INFO L226 Difference]: Without dead ends: 328 [2019-01-01 21:14:30,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 269 SyntacticMatches, 20 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2019-01-01 21:14:30,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-01-01 21:14:30,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 322. [2019-01-01 21:14:30,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-01-01 21:14:30,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 340 transitions. [2019-01-01 21:14:30,951 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 340 transitions. Word has length 289 [2019-01-01 21:14:30,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:14:30,952 INFO L480 AbstractCegarLoop]: Abstraction has 322 states and 340 transitions. [2019-01-01 21:14:30,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-01 21:14:30,953 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 340 transitions. [2019-01-01 21:14:30,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-01-01 21:14:30,956 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:14:30,956 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1] [2019-01-01 21:14:30,957 INFO L423 AbstractCegarLoop]: === Iteration 31 === [hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:14:30,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:14:30,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1826765367, now seen corresponding path program 21 times [2019-01-01 21:14:30,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:14:30,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:14:30,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:30,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:14:30,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:31,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2753 backedges. 0 proven. 1554 refuted. 0 times theorem prover too weak. 1199 trivial. 0 not checked. [2019-01-01 21:14:31,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:14:31,893 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:14:31,904 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 21:14:31,974 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-01 21:14:31,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:14:31,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:14:33,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2753 backedges. 0 proven. 1554 refuted. 0 times theorem prover too weak. 1199 trivial. 0 not checked. [2019-01-01 21:14:33,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:14:33,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2019-01-01 21:14:33,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-01 21:14:33,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-01 21:14:33,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2019-01-01 21:14:33,238 INFO L87 Difference]: Start difference. First operand 322 states and 340 transitions. Second operand 46 states. [2019-01-01 21:14:33,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:14:33,589 INFO L93 Difference]: Finished difference Result 376 states and 406 transitions. [2019-01-01 21:14:33,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-01 21:14:33,591 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 266 [2019-01-01 21:14:33,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:14:33,594 INFO L225 Difference]: With dead ends: 376 [2019-01-01 21:14:33,595 INFO L226 Difference]: Without dead ends: 335 [2019-01-01 21:14:33,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 245 SyntacticMatches, 21 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2019-01-01 21:14:33,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-01-01 21:14:33,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 329. [2019-01-01 21:14:33,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-01-01 21:14:33,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 347 transitions. [2019-01-01 21:14:33,609 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 347 transitions. Word has length 266 [2019-01-01 21:14:33,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:14:33,610 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 347 transitions. [2019-01-01 21:14:33,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-01 21:14:33,610 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 347 transitions. [2019-01-01 21:14:33,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-01-01 21:14:33,615 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:14:33,615 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2019-01-01 21:14:33,615 INFO L423 AbstractCegarLoop]: === Iteration 32 === [hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:14:33,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:14:33,616 INFO L82 PathProgramCache]: Analyzing trace with hash 338825084, now seen corresponding path program 22 times [2019-01-01 21:14:33,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:14:33,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:14:33,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:33,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:14:33,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:34,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3940 backedges. 0 proven. 1705 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2019-01-01 21:14:34,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:14:34,559 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:14:34,570 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 21:14:34,638 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 21:14:34,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:14:34,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:14:35,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3940 backedges. 0 proven. 1705 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2019-01-01 21:14:35,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:14:35,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2019-01-01 21:14:35,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-01 21:14:35,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-01 21:14:35,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2019-01-01 21:14:35,391 INFO L87 Difference]: Start difference. First operand 329 states and 347 transitions. Second operand 48 states. [2019-01-01 21:14:35,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:14:35,630 INFO L93 Difference]: Finished difference Result 383 states and 413 transitions. [2019-01-01 21:14:35,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-01 21:14:35,631 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 313 [2019-01-01 21:14:35,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:14:35,634 INFO L225 Difference]: With dead ends: 383 [2019-01-01 21:14:35,634 INFO L226 Difference]: Without dead ends: 342 [2019-01-01 21:14:35,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 291 SyntacticMatches, 22 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1199 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2019-01-01 21:14:35,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-01-01 21:14:35,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 336. [2019-01-01 21:14:35,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-01-01 21:14:35,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 354 transitions. [2019-01-01 21:14:35,648 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 354 transitions. Word has length 313 [2019-01-01 21:14:35,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:14:35,651 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 354 transitions. [2019-01-01 21:14:35,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-01 21:14:35,652 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 354 transitions. [2019-01-01 21:14:35,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-01-01 21:14:35,655 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:14:35,655 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 24, 24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1] [2019-01-01 21:14:35,657 INFO L423 AbstractCegarLoop]: === Iteration 33 === [hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:14:35,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:14:35,658 INFO L82 PathProgramCache]: Analyzing trace with hash 486252238, now seen corresponding path program 23 times [2019-01-01 21:14:35,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:14:35,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:14:35,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:35,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:14:35,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:37,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4250 backedges. 2003 proven. 936 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2019-01-01 21:14:37,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:14:37,712 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:14:37,723 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 21:14:37,814 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2019-01-01 21:14:37,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:14:37,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:17:18,166 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-01 21:17:54,660 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-01 21:18:46,008 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-01 21:19:35,037 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-01 21:19:49,922 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-01-01 21:19:50,123 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:19:50,125 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:934) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 39 more [2019-01-01 21:19:50,130 INFO L168 Benchmark]: Toolchain (without parser) took 355556.78 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 486.5 MB). Free memory was 952.7 MB in the beginning and 1.3 GB in the end (delta: -346.4 MB). Peak memory consumption was 140.2 MB. Max. memory is 11.5 GB. [2019-01-01 21:19:50,131 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:19:50,131 INFO L168 Benchmark]: CACSL2BoogieTranslator took 259.45 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:19:50,133 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.87 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:19:50,133 INFO L168 Benchmark]: Boogie Preprocessor took 17.52 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:19:50,134 INFO L168 Benchmark]: RCFGBuilder took 412.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -133.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-01-01 21:19:50,134 INFO L168 Benchmark]: TraceAbstraction took 354829.11 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 386.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -225.4 MB). Peak memory consumption was 161.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:19:50,151 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 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 259.45 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.87 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.52 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 412.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -133.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 354829.11 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 386.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -225.4 MB). Peak memory consumption was 161.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...