./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted-lit/HeizmannHoenickeLeikePodelski-ATVA2013-Fig1_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/termination-crafted-lit/HeizmannHoenickeLeikePodelski-ATVA2013-Fig1_true-termination_true-no-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0564e568992a96ba006237c1af458e049de52506 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 20:48:19,477 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 20:48:19,479 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 20:48:19,491 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 20:48:19,491 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 20:48:19,493 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 20:48:19,494 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 20:48:19,496 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 20:48:19,498 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 20:48:19,499 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 20:48:19,500 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 20:48:19,500 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 20:48:19,501 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 20:48:19,503 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 20:48:19,504 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 20:48:19,505 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 20:48:19,506 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 20:48:19,508 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 20:48:19,510 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 20:48:19,512 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 20:48:19,514 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 20:48:19,515 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 20:48:19,518 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 20:48:19,518 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 20:48:19,519 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 20:48:19,520 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 20:48:19,521 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 20:48:19,522 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 20:48:19,523 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 20:48:19,524 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 20:48:19,525 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 20:48:19,526 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 20:48:19,526 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 20:48:19,526 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 20:48:19,528 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 20:48:19,528 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 20:48:19,529 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-01 20:48:19,544 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 20:48:19,545 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 20:48:19,546 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 20:48:19,546 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 20:48:19,546 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 20:48:19,547 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 20:48:19,547 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 20:48:19,548 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 20:48:19,548 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 20:48:19,548 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 20:48:19,548 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 20:48:19,548 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 20:48:19,549 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-01 20:48:19,549 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 20:48:19,549 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 20:48:19,549 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 20:48:19,549 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 20:48:19,549 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 20:48:19,550 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 20:48:19,551 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 20:48:19,551 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 20:48:19,552 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 20:48:19,552 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 20:48:19,552 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 20:48:19,552 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 20:48:19,553 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 20:48:19,553 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 20:48:19,553 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0564e568992a96ba006237c1af458e049de52506 [2019-01-01 20:48:19,593 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 20:48:19,608 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 20:48:19,613 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 20:48:19,615 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 20:48:19,615 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 20:48:19,616 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/HeizmannHoenickeLeikePodelski-ATVA2013-Fig1_true-termination_true-no-overflow.c [2019-01-01 20:48:19,678 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e82c889de/1539146519a54b9598b31a408c52d18a/FLAGffec03d46 [2019-01-01 20:48:20,127 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 20:48:20,128 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/HeizmannHoenickeLeikePodelski-ATVA2013-Fig1_true-termination_true-no-overflow.c [2019-01-01 20:48:20,135 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e82c889de/1539146519a54b9598b31a408c52d18a/FLAGffec03d46 [2019-01-01 20:48:20,482 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e82c889de/1539146519a54b9598b31a408c52d18a [2019-01-01 20:48:20,487 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 20:48:20,489 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 20:48:20,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 20:48:20,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 20:48:20,496 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 20:48:20,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:48:20" (1/1) ... [2019-01-01 20:48:20,501 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50004ba6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:48:20, skipping insertion in model container [2019-01-01 20:48:20,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:48:20" (1/1) ... [2019-01-01 20:48:20,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 20:48:20,533 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 20:48:20,761 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:48:20,766 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 20:48:20,789 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:48:20,806 INFO L195 MainTranslator]: Completed translation [2019-01-01 20:48:20,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:48:20 WrapperNode [2019-01-01 20:48:20,807 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 20:48:20,809 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 20:48:20,809 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 20:48:20,809 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 20:48:20,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:48:20" (1/1) ... [2019-01-01 20:48:20,827 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:48:20" (1/1) ... [2019-01-01 20:48:20,853 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 20:48:20,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 20:48:20,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 20:48:20,855 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 20:48:20,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:48:20" (1/1) ... [2019-01-01 20:48:20,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:48:20" (1/1) ... [2019-01-01 20:48:20,866 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:48:20" (1/1) ... [2019-01-01 20:48:20,867 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:48:20" (1/1) ... [2019-01-01 20:48:20,869 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:48:20" (1/1) ... [2019-01-01 20:48:20,875 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:48:20" (1/1) ... [2019-01-01 20:48:20,876 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:48:20" (1/1) ... [2019-01-01 20:48:20,877 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 20:48:20,878 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 20:48:20,878 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 20:48:20,878 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 20:48:20,879 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:48:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 20:48:21,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 20:48:21,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 20:48:21,206 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 20:48:21,206 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 20:48:21,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:48:21 BoogieIcfgContainer [2019-01-01 20:48:21,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 20:48:21,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 20:48:21,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 20:48:21,212 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 20:48:21,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 08:48:20" (1/3) ... [2019-01-01 20:48:21,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f28b3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:48:21, skipping insertion in model container [2019-01-01 20:48:21,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:48:20" (2/3) ... [2019-01-01 20:48:21,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f28b3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:48:21, skipping insertion in model container [2019-01-01 20:48:21,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:48:21" (3/3) ... [2019-01-01 20:48:21,215 INFO L112 eAbstractionObserver]: Analyzing ICFG HeizmannHoenickeLeikePodelski-ATVA2013-Fig1_true-termination_true-no-overflow.c [2019-01-01 20:48:21,226 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 20:48:21,232 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-01 20:48:21,249 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-01 20:48:21,282 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 20:48:21,282 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 20:48:21,283 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 20:48:21,283 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 20:48:21,283 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 20:48:21,283 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 20:48:21,283 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 20:48:21,283 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 20:48:21,283 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 20:48:21,299 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2019-01-01 20:48:21,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-01 20:48:21,306 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:21,307 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-01 20:48:21,309 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:21,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:21,320 INFO L82 PathProgramCache]: Analyzing trace with hash 31073, now seen corresponding path program 1 times [2019-01-01 20:48:21,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:21,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:21,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:21,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:21,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:21,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:21,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:48:21,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 20:48:21,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:48:21,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:48:21,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:48:21,532 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2019-01-01 20:48:21,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:21,734 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-01-01 20:48:21,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:48:21,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-01 20:48:21,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:21,747 INFO L225 Difference]: With dead ends: 26 [2019-01-01 20:48:21,747 INFO L226 Difference]: Without dead ends: 13 [2019-01-01 20:48:21,751 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 20:48:21,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-01 20:48:21,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-01 20:48:21,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-01 20:48:21,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-01 20:48:21,793 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 3 [2019-01-01 20:48:21,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:21,794 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-01 20:48:21,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:48:21,794 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-01 20:48:21,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-01 20:48:21,794 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:21,795 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-01 20:48:21,796 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:21,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:21,796 INFO L82 PathProgramCache]: Analyzing trace with hash 963307, now seen corresponding path program 1 times [2019-01-01 20:48:21,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:21,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:21,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:21,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:21,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:21,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:21,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:48:21,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:48:21,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:48:21,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:48:21,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:48:21,863 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 4 states. [2019-01-01 20:48:21,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:21,974 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-01-01 20:48:21,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 20:48:21,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-01 20:48:21,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:21,976 INFO L225 Difference]: With dead ends: 17 [2019-01-01 20:48:21,976 INFO L226 Difference]: Without dead ends: 15 [2019-01-01 20:48:21,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:48:21,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-01 20:48:21,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-01-01 20:48:21,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-01 20:48:21,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-01-01 20:48:21,982 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 4 [2019-01-01 20:48:21,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:21,982 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-01-01 20:48:21,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:48:21,982 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-01-01 20:48:21,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-01 20:48:21,982 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:21,983 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-01 20:48:21,983 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:21,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:21,984 INFO L82 PathProgramCache]: Analyzing trace with hash 925739501, now seen corresponding path program 1 times [2019-01-01 20:48:21,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:21,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:21,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:21,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:21,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:22,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:22,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:48:22,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 20:48:22,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:48:22,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:48:22,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:48:22,023 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 3 states. [2019-01-01 20:48:22,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:22,072 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-01-01 20:48:22,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:48:22,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-01-01 20:48:22,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:22,074 INFO L225 Difference]: With dead ends: 14 [2019-01-01 20:48:22,074 INFO L226 Difference]: Without dead ends: 13 [2019-01-01 20:48:22,075 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 20:48:22,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-01 20:48:22,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-01 20:48:22,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-01 20:48:22,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-01-01 20:48:22,078 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 6 [2019-01-01 20:48:22,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:22,078 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-01-01 20:48:22,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:48:22,079 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-01-01 20:48:22,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-01 20:48:22,079 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:22,079 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-01 20:48:22,080 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:22,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:22,080 INFO L82 PathProgramCache]: Analyzing trace with hash 577431471, now seen corresponding path program 1 times [2019-01-01 20:48:22,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:22,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:22,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:22,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:22,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:22,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:22,273 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 20:48:22,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:22,274 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:22,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:22,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:22,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:22,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 20:48:22,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 7 [2019-01-01 20:48:22,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 20:48:22,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 20:48:22,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-01-01 20:48:22,587 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 9 states. [2019-01-01 20:48:22,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:22,719 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-01-01 20:48:22,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:48:22,723 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-01 20:48:22,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:22,724 INFO L225 Difference]: With dead ends: 14 [2019-01-01 20:48:22,724 INFO L226 Difference]: Without dead ends: 13 [2019-01-01 20:48:22,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-01 20:48:22,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-01 20:48:22,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-01 20:48:22,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-01 20:48:22,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-01 20:48:22,732 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2019-01-01 20:48:22,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:22,733 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-01 20:48:22,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 20:48:22,733 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-01 20:48:22,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 20:48:22,733 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:22,736 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-01-01 20:48:22,737 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:22,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:22,737 INFO L82 PathProgramCache]: Analyzing trace with hash 720506461, now seen corresponding path program 1 times [2019-01-01 20:48:22,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:22,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:22,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:22,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:22,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:22,795 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 20:48:22,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:22,796 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:22,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:22,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:22,960 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 20:48:22,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 20:48:22,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 7 [2019-01-01 20:48:22,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 20:48:22,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 20:48:22,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:48:22,983 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 8 states. [2019-01-01 20:48:23,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:23,207 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2019-01-01 20:48:23,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 20:48:23,208 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-01-01 20:48:23,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:23,208 INFO L225 Difference]: With dead ends: 23 [2019-01-01 20:48:23,209 INFO L226 Difference]: Without dead ends: 21 [2019-01-01 20:48:23,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-01 20:48:23,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-01 20:48:23,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-01 20:48:23,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-01 20:48:23,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-01-01 20:48:23,216 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 9 [2019-01-01 20:48:23,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:23,216 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-01-01 20:48:23,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 20:48:23,217 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-01-01 20:48:23,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-01 20:48:23,217 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:23,217 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1] [2019-01-01 20:48:23,218 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:23,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:23,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1716869967, now seen corresponding path program 1 times [2019-01-01 20:48:23,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:23,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:23,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:23,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:23,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:23,354 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:23,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:23,355 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:23,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:23,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:23,414 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:23,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:23,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-01 20:48:23,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 20:48:23,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 20:48:23,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:48:23,455 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 6 states. [2019-01-01 20:48:23,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:23,776 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-01-01 20:48:23,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:48:23,777 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-01-01 20:48:23,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:23,778 INFO L225 Difference]: With dead ends: 28 [2019-01-01 20:48:23,778 INFO L226 Difference]: Without dead ends: 27 [2019-01-01 20:48:23,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:48:23,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-01 20:48:23,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-01-01 20:48:23,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-01 20:48:23,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-01-01 20:48:23,789 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 20 [2019-01-01 20:48:23,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:23,790 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-01-01 20:48:23,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 20:48:23,790 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-01-01 20:48:23,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-01 20:48:23,791 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:23,791 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1] [2019-01-01 20:48:23,791 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:23,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:23,794 INFO L82 PathProgramCache]: Analyzing trace with hash -333652957, now seen corresponding path program 2 times [2019-01-01 20:48:23,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:23,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:23,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:23,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:23,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:23,919 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:23,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:23,919 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:23,930 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:48:23,957 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:48:23,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:23,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:23,967 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:23,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:23,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-01 20:48:23,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 20:48:23,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 20:48:23,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:48:23,994 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 7 states. [2019-01-01 20:48:24,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:24,080 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-01-01 20:48:24,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 20:48:24,081 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-01-01 20:48:24,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:24,082 INFO L225 Difference]: With dead ends: 33 [2019-01-01 20:48:24,082 INFO L226 Difference]: Without dead ends: 32 [2019-01-01 20:48:24,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:48:24,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-01 20:48:24,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-01-01 20:48:24,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-01 20:48:24,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-01-01 20:48:24,088 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 25 [2019-01-01 20:48:24,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:24,089 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-01-01 20:48:24,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 20:48:24,089 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-01-01 20:48:24,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-01 20:48:24,090 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:24,090 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1] [2019-01-01 20:48:24,090 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:24,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:24,091 INFO L82 PathProgramCache]: Analyzing trace with hash -302154767, now seen corresponding path program 3 times [2019-01-01 20:48:24,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:24,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:24,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:24,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:24,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:24,306 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:24,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:24,307 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:24,322 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:48:24,353 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-01 20:48:24,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:24,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:24,715 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-01 20:48:24,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:24,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 15 [2019-01-01 20:48:24,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-01 20:48:24,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-01 20:48:24,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-01-01 20:48:24,745 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2019-01-01 20:48:25,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:25,842 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2019-01-01 20:48:25,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-01 20:48:25,843 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-01-01 20:48:25,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:25,844 INFO L225 Difference]: With dead ends: 38 [2019-01-01 20:48:25,844 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 20:48:25,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=366, Invalid=966, Unknown=0, NotChecked=0, Total=1332 [2019-01-01 20:48:25,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 20:48:25,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 20:48:25,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 20:48:25,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 20:48:25,847 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2019-01-01 20:48:25,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:25,847 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 20:48:25,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-01 20:48:25,847 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 20:48:25,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 20:48:25,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-01 20:48:26,107 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2019-01-01 20:48:26,111 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-01 20:48:26,111 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2019-01-01 20:48:26,111 INFO L451 ceAbstractionStarter]: At program point L21(lines 13 22) the Hoare annotation is: true [2019-01-01 20:48:26,112 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2019-01-01 20:48:26,112 INFO L448 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. [2019-01-01 20:48:26,112 INFO L444 ceAbstractionStarter]: At program point L17-2(lines 17 20) the Hoare annotation is: (let ((.cse0 (<= 24 ULTIMATE.start_main_~y~0))) (or (and (<= 23 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 23) (<= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~y~0 2147483624))) (and (exists ((v_ULTIMATE.start_main_~y~0_25 Int)) (and (<= (+ (* 2 v_ULTIMATE.start_main_~y~0_25) ULTIMATE.start_main_~x~0) 2147483648) (<= ULTIMATE.start_main_~y~0 (+ v_ULTIMATE.start_main_~y~0_25 1)))) .cse0 (<= ULTIMATE.start_main_~y~0 2147483647)) (and (<= ULTIMATE.start_main_~x~0 2147483624) .cse0 (<= ULTIMATE.start_main_~y~0 24)))) [2019-01-01 20:48:26,112 INFO L448 ceAbstractionStarter]: For program point L17-3(lines 17 20) no Hoare annotation was computed. [2019-01-01 20:48:26,112 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2019-01-01 20:48:26,112 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-01 20:48:26,112 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-01 20:48:26,112 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2019-01-01 20:48:26,113 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. [2019-01-01 20:48:26,113 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2019-01-01 20:48:26,113 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2019-01-01 20:48:26,118 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_25,QUANTIFIED] [2019-01-01 20:48:26,119 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_25,QUANTIFIED] [2019-01-01 20:48:26,127 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_25,QUANTIFIED] [2019-01-01 20:48:26,128 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_25,QUANTIFIED] [2019-01-01 20:48:26,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 08:48:26 BoogieIcfgContainer [2019-01-01 20:48:26,131 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 20:48:26,132 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 20:48:26,132 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 20:48:26,132 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 20:48:26,133 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:48:21" (3/4) ... [2019-01-01 20:48:26,137 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 20:48:26,148 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-01 20:48:26,148 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-01 20:48:26,177 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((23 <= y && y <= 23) && x <= y + 2147483624) || (((\exists v_ULTIMATE.start_main_~y~0_25 : int :: 2 * v_ULTIMATE.start_main_~y~0_25 + x <= 2147483648 && y <= v_ULTIMATE.start_main_~y~0_25 + 1) && 24 <= y) && y <= 2147483647)) || ((x <= 2147483624 && 24 <= y) && y <= 24) [2019-01-01 20:48:26,192 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 20:48:26,192 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 20:48:26,193 INFO L168 Benchmark]: Toolchain (without parser) took 5705.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 951.4 MB in the beginning and 854.1 MB in the end (delta: 97.2 MB). Peak memory consumption was 235.6 MB. Max. memory is 11.5 GB. [2019-01-01 20:48:26,194 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:48:26,195 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.87 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 20:48:26,196 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.59 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:48:26,196 INFO L168 Benchmark]: Boogie Preprocessor took 23.30 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:48:26,197 INFO L168 Benchmark]: RCFGBuilder took 329.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -172.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-01 20:48:26,198 INFO L168 Benchmark]: TraceAbstraction took 4923.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 854.1 MB in the end (delta: 259.1 MB). Peak memory consumption was 259.1 MB. Max. memory is 11.5 GB. [2019-01-01 20:48:26,198 INFO L168 Benchmark]: Witness Printer took 60.62 ms. Allocated memory is still 1.2 GB. Free memory is still 854.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:48:26,203 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 317.87 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.59 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.30 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 329.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -172.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4923.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 854.1 MB in the end (delta: 259.1 MB). Peak memory consumption was 259.1 MB. Max. memory is 11.5 GB. * Witness Printer took 60.62 ms. Allocated memory is still 1.2 GB. Free memory is still 854.1 MB. There was no memory consumed. 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_main_~y~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_25,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant [2019-01-01 20:48:26,211 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_25,QUANTIFIED] [2019-01-01 20:48:26,211 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_25,QUANTIFIED] [2019-01-01 20:48:26,212 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_25,QUANTIFIED] [2019-01-01 20:48:26,212 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_25,QUANTIFIED] Derived loop invariant: (((23 <= y && y <= 23) && x <= y + 2147483624) || (((\exists v_ULTIMATE.start_main_~y~0_25 : int :: 2 * v_ULTIMATE.start_main_~y~0_25 + x <= 2147483648 && y <= v_ULTIMATE.start_main_~y~0_25 + 1) && 24 <= y) && y <= 2147483647)) || ((x <= 2147483624 && 24 <= y) && y <= 24) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 4 error locations. SAFE Result, 4.8s OverallTime, 8 OverallIterations, 6 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 26 SDtfs, 113 SDslu, 16 SDs, 0 SdLazy, 236 SolverSat, 58 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=7, 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, 8 MinimizatonAttempts, 5 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 11 NumberOfFragments, 45 HoareAnnotationTreeSize, 2 FomulaSimplifications, 132 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 61 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 197 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 184 ConstructedInterpolants, 2 QuantifiedInterpolants, 12284 SizeOfPredicates, 2 NumberOfNonLiveVariables, 180 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 13 InterpolantComputations, 5 PerfectInterpolantSequences, 54/296 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...