./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/bitvector/gcd_4_true-unreach-call_true-no-overflow_true-termination.i --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/bitvector/gcd_4_true-unreach-call_true-no-overflow_true-termination.i -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 9918b49e0d76e4ce36b6a6760021b33460a8ae9b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:15:38,442 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:15:38,444 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:15:38,457 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:15:38,457 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:15:38,458 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:15:38,460 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:15:38,461 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:15:38,463 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:15:38,464 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:15:38,465 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:15:38,465 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:15:38,466 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:15:38,467 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:15:38,468 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:15:38,469 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:15:38,470 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:15:38,472 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:15:38,474 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:15:38,475 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:15:38,477 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:15:38,478 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:15:38,480 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:15:38,481 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:15:38,481 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:15:38,482 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:15:38,483 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:15:38,484 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:15:38,485 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:15:38,486 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:15:38,486 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:15:38,487 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:15:38,487 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:15:38,487 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:15:38,488 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:15:38,489 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:15:38,489 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:15:38,506 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:15:38,506 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:15:38,508 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:15:38,508 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:15:38,508 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:15:38,508 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:15:38,509 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 21:15:38,509 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:15:38,509 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:15:38,509 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 21:15:38,509 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:15:38,510 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 21:15:38,510 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 21:15:38,510 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 21:15:38,510 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-01 21:15:38,511 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 21:15:38,511 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:15:38,511 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:15:38,511 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 21:15:38,511 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:15:38,512 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:15:38,512 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 21:15:38,512 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 21:15:38,512 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 21:15:38,513 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:15:38,513 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 21:15:38,513 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 21:15:38,513 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:15:38,513 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 21:15:38,514 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 21:15:38,514 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 -> 9918b49e0d76e4ce36b6a6760021b33460a8ae9b [2019-01-01 21:15:38,550 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:15:38,563 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:15:38,567 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:15:38,569 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:15:38,570 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:15:38,570 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/gcd_4_true-unreach-call_true-no-overflow_true-termination.i [2019-01-01 21:15:38,640 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/492e52e4d/d2b090dbc7024a73a7bacac60c8cbeca/FLAGb1d37754f [2019-01-01 21:15:39,116 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:15:39,119 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/gcd_4_true-unreach-call_true-no-overflow_true-termination.i [2019-01-01 21:15:39,127 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/492e52e4d/d2b090dbc7024a73a7bacac60c8cbeca/FLAGb1d37754f [2019-01-01 21:15:39,446 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/492e52e4d/d2b090dbc7024a73a7bacac60c8cbeca [2019-01-01 21:15:39,449 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:15:39,451 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:15:39,452 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:15:39,452 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:15:39,456 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:15:39,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:15:39" (1/1) ... [2019-01-01 21:15:39,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7307a100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:15:39, skipping insertion in model container [2019-01-01 21:15:39,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:15:39" (1/1) ... [2019-01-01 21:15:39,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:15:39,493 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:15:39,723 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:15:39,731 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:15:39,757 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:15:39,778 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:15:39,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:15:39 WrapperNode [2019-01-01 21:15:39,779 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:15:39,781 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:15:39,781 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:15:39,781 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:15:39,792 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:15:39" (1/1) ... [2019-01-01 21:15:39,800 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:15:39" (1/1) ... [2019-01-01 21:15:39,832 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:15:39,834 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:15:39,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:15:39,835 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:15:39,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:15:39" (1/1) ... [2019-01-01 21:15:39,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:15:39" (1/1) ... [2019-01-01 21:15:39,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:15:39" (1/1) ... [2019-01-01 21:15:39,854 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:15:39" (1/1) ... [2019-01-01 21:15:39,858 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:15:39" (1/1) ... [2019-01-01 21:15:39,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:15:39" (1/1) ... [2019-01-01 21:15:39,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:15:39" (1/1) ... [2019-01-01 21:15:39,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:15:39,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:15:39,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:15:39,885 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:15:39,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:15:39" (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:15:40,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:15:40,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:15:40,541 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:15:40,542 INFO L280 CfgBuilder]: Removed 13 assue(true) statements. [2019-01-01 21:15:40,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:15:40 BoogieIcfgContainer [2019-01-01 21:15:40,542 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:15:40,543 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 21:15:40,544 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 21:15:40,547 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 21:15:40,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 09:15:39" (1/3) ... [2019-01-01 21:15:40,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be2e5c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 09:15:40, skipping insertion in model container [2019-01-01 21:15:40,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:15:39" (2/3) ... [2019-01-01 21:15:40,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be2e5c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 09:15:40, skipping insertion in model container [2019-01-01 21:15:40,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:15:40" (3/3) ... [2019-01-01 21:15:40,551 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_4_true-unreach-call_true-no-overflow_true-termination.i [2019-01-01 21:15:40,562 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 21:15:40,570 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-01-01 21:15:40,589 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-01-01 21:15:40,625 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:15:40,625 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 21:15:40,626 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 21:15:40,626 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 21:15:40,626 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:15:40,627 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:15:40,627 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 21:15:40,627 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:15:40,627 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 21:15:40,643 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-01-01 21:15:40,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-01 21:15:40,650 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:15:40,651 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-01 21:15:40,654 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:15:40,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:15:40,661 INFO L82 PathProgramCache]: Analyzing trace with hash 30881, now seen corresponding path program 1 times [2019-01-01 21:15:40,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:15:40,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:15:40,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:40,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:15:40,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:15:40,810 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:15:40,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:15:40,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:15:40,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 21:15:40,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:15:40,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:15:40,832 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2019-01-01 21:15:40,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:15:40,973 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2019-01-01 21:15:40,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:15:40,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-01 21:15:40,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:15:40,986 INFO L225 Difference]: With dead ends: 90 [2019-01-01 21:15:40,986 INFO L226 Difference]: Without dead ends: 28 [2019-01-01 21:15:40,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:15:41,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-01 21:15:41,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2019-01-01 21:15:41,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-01 21:15:41,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-01-01 21:15:41,027 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 3 [2019-01-01 21:15:41,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:15:41,028 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-01-01 21:15:41,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 21:15:41,028 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-01-01 21:15:41,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-01 21:15:41,029 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:15:41,029 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-01 21:15:41,029 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:15:41,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:15:41,030 INFO L82 PathProgramCache]: Analyzing trace with hash 963371, now seen corresponding path program 1 times [2019-01-01 21:15:41,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:15:41,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:15:41,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:41,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:15:41,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:15:41,060 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:15:41,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:15:41,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:15:41,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 21:15:41,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:15:41,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:15:41,063 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 3 states. [2019-01-01 21:15:41,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:15:41,258 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-01-01 21:15:41,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:15:41,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-01 21:15:41,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:15:41,260 INFO L225 Difference]: With dead ends: 39 [2019-01-01 21:15:41,260 INFO L226 Difference]: Without dead ends: 24 [2019-01-01 21:15:41,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:15:41,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-01 21:15:41,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 14. [2019-01-01 21:15:41,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-01 21:15:41,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-01-01 21:15:41,266 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 4 [2019-01-01 21:15:41,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:15:41,266 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-01-01 21:15:41,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 21:15:41,266 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-01-01 21:15:41,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-01 21:15:41,268 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:15:41,268 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:15:41,269 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:15:41,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:15:41,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1359081932, now seen corresponding path program 1 times [2019-01-01 21:15:41,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:15:41,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:15:41,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:41,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:15:41,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:15:41,355 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:15:41,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:15:41,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 21:15:41,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 21:15:41,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:15:41,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:15:41,358 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 3 states. [2019-01-01 21:15:41,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:15:41,550 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2019-01-01 21:15:41,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:15:41,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-01-01 21:15:41,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:15:41,552 INFO L225 Difference]: With dead ends: 28 [2019-01-01 21:15:41,552 INFO L226 Difference]: Without dead ends: 18 [2019-01-01 21:15:41,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:15:41,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-01 21:15:41,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-01 21:15:41,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-01 21:15:41,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-01-01 21:15:41,558 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 7 [2019-01-01 21:15:41,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:15:41,559 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-01-01 21:15:41,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 21:15:41,560 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-01-01 21:15:41,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-01 21:15:41,560 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:15:41,560 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:15:41,561 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:15:41,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:15:41,562 INFO L82 PathProgramCache]: Analyzing trace with hash -934966417, now seen corresponding path program 1 times [2019-01-01 21:15:41,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:15:41,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:15:41,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:41,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:15:41,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:15:41,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:15:41,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:15:41,659 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:15:41,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:15:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:15:41,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:15:41,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:15:41,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 21:15:41,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-01 21:15:41,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 21:15:41,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 21:15:41,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-01 21:15:41,809 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2019-01-01 21:15:42,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:15:42,039 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2019-01-01 21:15:42,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 21:15:42,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-01-01 21:15:42,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:15:42,042 INFO L225 Difference]: With dead ends: 28 [2019-01-01 21:15:42,042 INFO L226 Difference]: Without dead ends: 26 [2019-01-01 21:15:42,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-01 21:15:42,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-01 21:15:42,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-01-01 21:15:42,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-01 21:15:42,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-01-01 21:15:42,047 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 11 [2019-01-01 21:15:42,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:15:42,048 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-01-01 21:15:42,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 21:15:42,048 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-01-01 21:15:42,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-01 21:15:42,049 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:15:42,049 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:15:42,050 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:15:42,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:15:42,050 INFO L82 PathProgramCache]: Analyzing trace with hash -934966225, now seen corresponding path program 1 times [2019-01-01 21:15:42,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:15:42,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:15:42,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:42,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:15:42,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:15:42,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:15:42,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:15:42,128 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:15:42,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:15:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:15:42,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:15:42,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:15:42,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:15:42,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-01-01 21:15:42,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 21:15:42,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 21:15:42,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-01 21:15:42,221 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 6 states. [2019-01-01 21:15:42,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:15:42,348 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2019-01-01 21:15:42,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 21:15:42,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-01-01 21:15:42,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:15:42,350 INFO L225 Difference]: With dead ends: 40 [2019-01-01 21:15:42,350 INFO L226 Difference]: Without dead ends: 28 [2019-01-01 21:15:42,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-01 21:15:42,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-01 21:15:42,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-01 21:15:42,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-01 21:15:42,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-01-01 21:15:42,357 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 11 [2019-01-01 21:15:42,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:15:42,357 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-01-01 21:15:42,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 21:15:42,358 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-01-01 21:15:42,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-01 21:15:42,359 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:15:42,359 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 21:15:42,360 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:15:42,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:15:42,360 INFO L82 PathProgramCache]: Analyzing trace with hash -892996630, now seen corresponding path program 2 times [2019-01-01 21:15:42,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:15:42,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:15:42,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:42,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:15:42,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:15:42,484 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 21:15:42,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:15:42,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 21:15:42,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 21:15:42,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:15:42,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:15:42,486 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2019-01-01 21:15:42,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:15:42,698 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-01-01 21:15:42,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 21:15:42,699 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-01-01 21:15:42,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:15:42,700 INFO L225 Difference]: With dead ends: 30 [2019-01-01 21:15:42,700 INFO L226 Difference]: Without dead ends: 28 [2019-01-01 21:15:42,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:15:42,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-01 21:15:42,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-01-01 21:15:42,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-01 21:15:42,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-01-01 21:15:42,713 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 15 [2019-01-01 21:15:42,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:15:42,713 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-01-01 21:15:42,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 21:15:42,714 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-01-01 21:15:42,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-01 21:15:42,714 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:15:42,715 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:15:42,715 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:15:42,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:15:42,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1301962847, now seen corresponding path program 1 times [2019-01-01 21:15:42,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:15:42,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:15:42,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:42,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:15:42,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:15:42,987 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:15:42,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:15:42,988 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:15:43,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:15:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:15:43,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:15:43,109 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:15:43,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:15:43,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-01-01 21:15:43,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 21:15:43,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 21:15:43,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-01 21:15:43,135 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 8 states. [2019-01-01 21:15:43,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:15:43,339 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2019-01-01 21:15:43,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 21:15:43,339 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-01-01 21:15:43,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:15:43,340 INFO L225 Difference]: With dead ends: 44 [2019-01-01 21:15:43,340 INFO L226 Difference]: Without dead ends: 32 [2019-01-01 21:15:43,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-01 21:15:43,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-01 21:15:43,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-01-01 21:15:43,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-01 21:15:43,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-01-01 21:15:43,347 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 19 [2019-01-01 21:15:43,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:15:43,347 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-01-01 21:15:43,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 21:15:43,348 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-01-01 21:15:43,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-01 21:15:43,348 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:15:43,350 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:15:43,351 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:15:43,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:15:43,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1497309926, now seen corresponding path program 2 times [2019-01-01 21:15:43,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:15:43,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:15:43,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:43,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:15:43,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:15:43,422 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-01 21:15:43,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:15:43,423 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:15:43,432 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:15:43,446 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:15:43,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:15:43,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:15:43,676 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:15:43,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:15:43,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6] total 9 [2019-01-01 21:15:43,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 21:15:43,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 21:15:43,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-01 21:15:43,699 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 10 states. [2019-01-01 21:15:44,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:15:44,060 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2019-01-01 21:15:44,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 21:15:44,061 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-01-01 21:15:44,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:15:44,063 INFO L225 Difference]: With dead ends: 54 [2019-01-01 21:15:44,063 INFO L226 Difference]: Without dead ends: 38 [2019-01-01 21:15:44,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-01-01 21:15:44,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-01 21:15:44,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2019-01-01 21:15:44,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-01 21:15:44,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2019-01-01 21:15:44,069 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 23 [2019-01-01 21:15:44,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:15:44,069 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2019-01-01 21:15:44,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 21:15:44,070 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2019-01-01 21:15:44,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-01 21:15:44,070 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:15:44,071 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:15:44,071 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:15:44,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:15:44,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1497309734, now seen corresponding path program 1 times [2019-01-01 21:15:44,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:15:44,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:15:44,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:44,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:15:44,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:15:44,247 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:15:44,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:15:44,247 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:15:44,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:15:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:15:44,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:15:44,445 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:15:44,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:15:44,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-01-01 21:15:44,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 21:15:44,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 21:15:44,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-01-01 21:15:44,471 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 12 states. [2019-01-01 21:15:44,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:15:44,618 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2019-01-01 21:15:44,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 21:15:44,619 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-01-01 21:15:44,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:15:44,622 INFO L225 Difference]: With dead ends: 44 [2019-01-01 21:15:44,622 INFO L226 Difference]: Without dead ends: 42 [2019-01-01 21:15:44,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-01-01 21:15:44,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-01 21:15:44,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-01-01 21:15:44,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-01 21:15:44,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-01-01 21:15:44,629 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 23 [2019-01-01 21:15:44,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:15:44,629 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-01-01 21:15:44,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 21:15:44,629 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-01-01 21:15:44,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-01 21:15:44,630 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:15:44,630 INFO L402 BasicCegarLoop]: trace histogram [7, 5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-01 21:15:44,631 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:15:44,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:15:44,631 INFO L82 PathProgramCache]: Analyzing trace with hash -906966518, now seen corresponding path program 3 times [2019-01-01 21:15:44,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:15:44,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:15:44,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:44,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:15:44,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:15:44,883 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-01 21:15:44,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:15:44,884 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:15:44,894 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 21:15:44,906 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-01 21:15:44,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:15:44,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:15:44,961 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-01 21:15:44,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 21:15:44,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 10 [2019-01-01 21:15:44,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 21:15:44,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 21:15:44,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-01-01 21:15:44,981 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 11 states. [2019-01-01 21:15:45,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:15:45,257 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-01-01 21:15:45,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 21:15:45,258 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2019-01-01 21:15:45,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:15:45,259 INFO L225 Difference]: With dead ends: 43 [2019-01-01 21:15:45,260 INFO L226 Difference]: Without dead ends: 42 [2019-01-01 21:15:45,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-01-01 21:15:45,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-01 21:15:45,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2019-01-01 21:15:45,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-01 21:15:45,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-01-01 21:15:45,268 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 31 [2019-01-01 21:15:45,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:15:45,269 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-01-01 21:15:45,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 21:15:45,269 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-01-01 21:15:45,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-01 21:15:45,271 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:15:45,271 INFO L402 BasicCegarLoop]: trace histogram [7, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1] [2019-01-01 21:15:45,272 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:15:45,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:15:45,272 INFO L82 PathProgramCache]: Analyzing trace with hash -906966326, now seen corresponding path program 2 times [2019-01-01 21:15:45,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:15:45,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:15:45,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:45,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:15:45,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:15:45,383 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-01 21:15:45,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:15:45,384 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:15:45,407 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:15:45,423 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:15:45,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:15:45,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:15:45,705 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:15:45,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:15:45,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 13 [2019-01-01 21:15:45,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-01 21:15:45,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-01 21:15:45,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-01-01 21:15:45,726 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 14 states. [2019-01-01 21:15:45,848 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 7 [2019-01-01 21:15:46,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:15:46,660 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2019-01-01 21:15:46,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 21:15:46,661 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2019-01-01 21:15:46,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:15:46,662 INFO L225 Difference]: With dead ends: 47 [2019-01-01 21:15:46,663 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 21:15:46,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2019-01-01 21:15:46,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 21:15:46,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 21:15:46,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 21:15:46,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 21:15:46,665 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-01-01 21:15:46,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:15:46,665 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:15:46,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-01 21:15:46,665 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:15:46,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 21:15:46,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-01 21:15:47,002 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-01-01 21:15:47,006 INFO L448 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2019-01-01 21:15:47,007 INFO L448 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2019-01-01 21:15:47,007 INFO L448 ceAbstractionStarter]: For program point L19-2(lines 19 25) no Hoare annotation was computed. [2019-01-01 21:15:47,007 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2019-01-01 21:15:47,007 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 21) no Hoare annotation was computed. [2019-01-01 21:15:47,008 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-01 21:15:47,008 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-01 21:15:47,008 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 24) no Hoare annotation was computed. [2019-01-01 21:15:47,008 INFO L444 ceAbstractionStarter]: At program point L20-2(lines 19 25) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_gcd_test_~b 18))) (or (let ((.cse0 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a))) (and (<= .cse0 63) (<= 63 .cse0) .cse1)) (and (exists ((v_ULTIMATE.start_gcd_test_~b_27 Int) (v_ULTIMATE.start_gcd_test_~a_38 Int)) (and (<= (+ ULTIMATE.start_gcd_test_~b (* 2 v_ULTIMATE.start_gcd_test_~a_38)) v_ULTIMATE.start_gcd_test_~b_27) (<= 63 (+ (* 3 v_ULTIMATE.start_gcd_test_~b_27) v_ULTIMATE.start_gcd_test_~a_38)) (<= v_ULTIMATE.start_gcd_test_~a_38 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)) (<= v_ULTIMATE.start_gcd_test_~b_27 18))) (<= ULTIMATE.start_gcd_test_~a 2147483647) (<= 0 ULTIMATE.start_gcd_test_~b)) (let ((.cse2 (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a))) (and .cse1 (<= 63 .cse2) (<= .cse2 63))) (and (<= 63 ULTIMATE.start_gcd_test_~a) .cse1 (<= ULTIMATE.start_gcd_test_~a 63)) (let ((.cse3 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a))) (and (<= 63 .cse3) .cse1 (<= .cse3 63))) (and (exists ((v_ULTIMATE.start_gcd_test_~b_24 Int)) (and (<= (+ (* 3 v_ULTIMATE.start_gcd_test_~b_24) ULTIMATE.start_gcd_test_~a) 63) (<= 18 v_ULTIMATE.start_gcd_test_~b_24) (<= v_ULTIMATE.start_gcd_test_~b_24 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))) (exists ((v_ULTIMATE.start_gcd_test_~b_25 Int)) (and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) v_ULTIMATE.start_gcd_test_~b_25) (<= v_ULTIMATE.start_gcd_test_~b_25 18) (<= 63 (+ (* 3 v_ULTIMATE.start_gcd_test_~b_25) ULTIMATE.start_gcd_test_~a))))))) [2019-01-01 21:15:47,008 INFO L451 ceAbstractionStarter]: At program point L45(lines 30 46) the Hoare annotation is: true [2019-01-01 21:15:47,009 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2019-01-01 21:15:47,009 INFO L448 ceAbstractionStarter]: For program point L12-1(line 12) no Hoare annotation was computed. [2019-01-01 21:15:47,009 INFO L448 ceAbstractionStarter]: For program point L12-2(line 12) no Hoare annotation was computed. [2019-01-01 21:15:47,009 INFO L448 ceAbstractionStarter]: For program point L12-4(lines 11 27) no Hoare annotation was computed. [2019-01-01 21:15:47,009 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-01 21:15:47,009 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 13) no Hoare annotation was computed. [2019-01-01 21:15:47,009 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 12) no Hoare annotation was computed. [2019-01-01 21:15:47,009 INFO L448 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2019-01-01 21:15:47,009 INFO L448 ceAbstractionStarter]: For program point L21-1(line 21) no Hoare annotation was computed. [2019-01-01 21:15:47,009 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2019-01-01 21:15:47,010 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. [2019-01-01 21:15:47,010 INFO L448 ceAbstractionStarter]: For program point L13-3(lines 11 27) no Hoare annotation was computed. [2019-01-01 21:15:47,010 INFO L448 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2019-01-01 21:15:47,010 INFO L451 ceAbstractionStarter]: At program point L5-2(lines 4 9) the Hoare annotation is: true [2019-01-01 21:15:47,010 INFO L448 ceAbstractionStarter]: For program point L5-3(lines 5 7) no Hoare annotation was computed. [2019-01-01 21:15:47,010 INFO L451 ceAbstractionStarter]: At program point L5-5(lines 4 9) the Hoare annotation is: true [2019-01-01 21:15:47,010 INFO L448 ceAbstractionStarter]: For program point L5-6(lines 5 7) no Hoare annotation was computed. [2019-01-01 21:15:47,010 INFO L451 ceAbstractionStarter]: At program point L5-8(lines 4 9) the Hoare annotation is: true [2019-01-01 21:15:47,010 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 13) no Hoare annotation was computed. [2019-01-01 21:15:47,011 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2019-01-01 21:15:47,011 INFO L451 ceAbstractionStarter]: At program point L26(lines 10 27) the Hoare annotation is: true [2019-01-01 21:15:47,011 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 12) no Hoare annotation was computed. [2019-01-01 21:15:47,011 INFO L448 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2019-01-01 21:15:47,011 INFO L448 ceAbstractionStarter]: For program point L6-1(line 6) no Hoare annotation was computed. [2019-01-01 21:15:47,011 INFO L448 ceAbstractionStarter]: For program point L6-2(line 6) no Hoare annotation was computed. [2019-01-01 21:15:47,011 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 21) no Hoare annotation was computed. [2019-01-01 21:15:47,021 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_38,QUANTIFIED] [2019-01-01 21:15:47,023 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_27,QUANTIFIED] [2019-01-01 21:15:47,023 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_27,QUANTIFIED] [2019-01-01 21:15:47,024 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_38,QUANTIFIED] [2019-01-01 21:15:47,024 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_38,QUANTIFIED] [2019-01-01 21:15:47,024 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_27,QUANTIFIED] [2019-01-01 21:15:47,024 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_24,QUANTIFIED] [2019-01-01 21:15:47,024 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_24,QUANTIFIED] [2019-01-01 21:15:47,025 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_24,QUANTIFIED] [2019-01-01 21:15:47,025 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_25,QUANTIFIED] [2019-01-01 21:15:47,025 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_25,QUANTIFIED] [2019-01-01 21:15:47,025 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_25,QUANTIFIED] [2019-01-01 21:15:47,035 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_38,QUANTIFIED] [2019-01-01 21:15:47,035 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_27,QUANTIFIED] [2019-01-01 21:15:47,035 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_27,QUANTIFIED] [2019-01-01 21:15:47,036 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_38,QUANTIFIED] [2019-01-01 21:15:47,036 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_38,QUANTIFIED] [2019-01-01 21:15:47,036 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_27,QUANTIFIED] [2019-01-01 21:15:47,036 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_24,QUANTIFIED] [2019-01-01 21:15:47,036 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_24,QUANTIFIED] [2019-01-01 21:15:47,037 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_24,QUANTIFIED] [2019-01-01 21:15:47,037 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_25,QUANTIFIED] [2019-01-01 21:15:47,037 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_25,QUANTIFIED] [2019-01-01 21:15:47,037 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_25,QUANTIFIED] [2019-01-01 21:15:47,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 09:15:47 BoogieIcfgContainer [2019-01-01 21:15:47,044 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 21:15:47,044 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:15:47,044 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:15:47,045 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:15:47,047 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:15:40" (3/4) ... [2019-01-01 21:15:47,052 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 21:15:47,065 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-01-01 21:15:47,065 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-01 21:15:47,099 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((2 * b + a <= 63 && 63 <= 2 * b + a) && b == 18) || (((\exists v_ULTIMATE.start_gcd_test_~b_27 : int, v_ULTIMATE.start_gcd_test_~a_38 : int :: ((b + 2 * v_ULTIMATE.start_gcd_test_~a_38 <= v_ULTIMATE.start_gcd_test_~b_27 && 63 <= 3 * v_ULTIMATE.start_gcd_test_~b_27 + v_ULTIMATE.start_gcd_test_~a_38) && v_ULTIMATE.start_gcd_test_~a_38 <= b + a) && v_ULTIMATE.start_gcd_test_~b_27 <= 18) && a <= 2147483647) && 0 <= b)) || ((b == 18 && 63 <= 3 * b + a) && 3 * b + a <= 63)) || ((63 <= a && b == 18) && a <= 63)) || ((63 <= b + a && b == 18) && b + a <= 63)) || ((\exists v_ULTIMATE.start_gcd_test_~b_24 : int :: (3 * v_ULTIMATE.start_gcd_test_~b_24 + a <= 63 && 18 <= v_ULTIMATE.start_gcd_test_~b_24) && v_ULTIMATE.start_gcd_test_~b_24 <= b + a) && (\exists v_ULTIMATE.start_gcd_test_~b_25 : int :: (b + a <= v_ULTIMATE.start_gcd_test_~b_25 && v_ULTIMATE.start_gcd_test_~b_25 <= 18) && 63 <= 3 * v_ULTIMATE.start_gcd_test_~b_25 + a)) [2019-01-01 21:15:47,129 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 21:15:47,129 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:15:47,130 INFO L168 Benchmark]: Toolchain (without parser) took 7680.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.2 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -153.8 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. [2019-01-01 21:15:47,132 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:15:47,133 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.25 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 931.2 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:15:47,133 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.74 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:15:47,134 INFO L168 Benchmark]: Boogie Preprocessor took 50.19 ms. Allocated memory is still 1.0 GB. Free memory was 931.2 MB in the beginning and 925.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:15:47,135 INFO L168 Benchmark]: RCFGBuilder took 657.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -158.7 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-01-01 21:15:47,136 INFO L168 Benchmark]: TraceAbstraction took 6500.44 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -20.0 MB). Peak memory consumption was 52.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:15:47,138 INFO L168 Benchmark]: Witness Printer took 85.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:15:47,143 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 327.25 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 931.2 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 52.74 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.19 ms. Allocated memory is still 1.0 GB. Free memory was 931.2 MB in the beginning and 925.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 657.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -158.7 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6500.44 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -20.0 MB). Peak memory consumption was 52.8 MB. Max. memory is 11.5 GB. * Witness Printer took 85.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_25,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 12]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant [2019-01-01 21:15:47,162 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_38,QUANTIFIED] [2019-01-01 21:15:47,162 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_27,QUANTIFIED] [2019-01-01 21:15:47,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_27,QUANTIFIED] [2019-01-01 21:15:47,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_38,QUANTIFIED] [2019-01-01 21:15:47,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_38,QUANTIFIED] [2019-01-01 21:15:47,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_27,QUANTIFIED] [2019-01-01 21:15:47,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_24,QUANTIFIED] [2019-01-01 21:15:47,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_24,QUANTIFIED] [2019-01-01 21:15:47,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_24,QUANTIFIED] [2019-01-01 21:15:47,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_25,QUANTIFIED] [2019-01-01 21:15:47,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_25,QUANTIFIED] [2019-01-01 21:15:47,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_25,QUANTIFIED] [2019-01-01 21:15:47,165 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_38,QUANTIFIED] [2019-01-01 21:15:47,165 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_27,QUANTIFIED] [2019-01-01 21:15:47,166 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_27,QUANTIFIED] [2019-01-01 21:15:47,166 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_38,QUANTIFIED] [2019-01-01 21:15:47,166 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_38,QUANTIFIED] [2019-01-01 21:15:47,166 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_27,QUANTIFIED] [2019-01-01 21:15:47,166 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_24,QUANTIFIED] [2019-01-01 21:15:47,166 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_24,QUANTIFIED] [2019-01-01 21:15:47,172 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_24,QUANTIFIED] [2019-01-01 21:15:47,172 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_25,QUANTIFIED] [2019-01-01 21:15:47,172 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_25,QUANTIFIED] [2019-01-01 21:15:47,172 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~b_25,QUANTIFIED] Derived loop invariant: ((((((2 * b + a <= 63 && 63 <= 2 * b + a) && b == 18) || (((\exists v_ULTIMATE.start_gcd_test_~b_27 : int, v_ULTIMATE.start_gcd_test_~a_38 : int :: ((b + 2 * v_ULTIMATE.start_gcd_test_~a_38 <= v_ULTIMATE.start_gcd_test_~b_27 && 63 <= 3 * v_ULTIMATE.start_gcd_test_~b_27 + v_ULTIMATE.start_gcd_test_~a_38) && v_ULTIMATE.start_gcd_test_~a_38 <= b + a) && v_ULTIMATE.start_gcd_test_~b_27 <= 18) && a <= 2147483647) && 0 <= b)) || ((b == 18 && 63 <= 3 * b + a) && 3 * b + a <= 63)) || ((63 <= a && b == 18) && a <= 63)) || ((63 <= b + a && b == 18) && b + a <= 63)) || ((\exists v_ULTIMATE.start_gcd_test_~b_24 : int :: (3 * v_ULTIMATE.start_gcd_test_~b_24 + a <= 63 && 18 <= v_ULTIMATE.start_gcd_test_~b_24) && v_ULTIMATE.start_gcd_test_~b_24 <= b + a) && (\exists v_ULTIMATE.start_gcd_test_~b_25 : int :: (b + a <= v_ULTIMATE.start_gcd_test_~b_25 && v_ULTIMATE.start_gcd_test_~b_25 <= 18) && 63 <= 3 * v_ULTIMATE.start_gcd_test_~b_25 + a)) - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 36 locations, 8 error locations. SAFE Result, 6.3s OverallTime, 11 OverallIterations, 7 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 62 SDtfs, 222 SDslu, 14 SDs, 0 SdLazy, 707 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 116 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 40 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 24 NumberOfFragments, 132 HoareAnnotationTreeSize, 6 FomulaSimplifications, 61 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 158 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 327 NumberOfCodeBlocks, 319 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 309 ConstructedInterpolants, 15 QuantifiedInterpolants, 43585 SizeOfPredicates, 30 NumberOfNonLiveVariables, 278 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 166/398 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...