./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted-lit/CookSeeZuleger-TACAS2013-Fig8a-modified_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/termination-crafted-lit/CookSeeZuleger-TACAS2013-Fig8a-modified_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 9a661b9ed427d2e9174ef6e6cb1f5d6d0ab8d9e2 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 21:39:27,590 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 21:39:27,594 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 21:39:27,610 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 21:39:27,610 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 21:39:27,612 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 21:39:27,614 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 21:39:27,618 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 21:39:27,619 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 21:39:27,622 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 21:39:27,625 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 21:39:27,626 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 21:39:27,626 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 21:39:27,628 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 21:39:27,630 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 21:39:27,630 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 21:39:27,631 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 21:39:27,633 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 21:39:27,635 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 21:39:27,636 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 21:39:27,637 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 21:39:27,638 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 21:39:27,641 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 21:39:27,641 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 21:39:27,641 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 21:39:27,642 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 21:39:27,643 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 21:39:27,644 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 21:39:27,645 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 21:39:27,646 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 21:39:27,646 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 21:39:27,647 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 21:39:27,647 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 21:39:27,647 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 21:39:27,649 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 21:39:27,650 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 21:39:27,650 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-14 21:39:27,669 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 21:39:27,669 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 21:39:27,670 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 21:39:27,671 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 21:39:27,671 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 21:39:27,671 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 21:39:27,672 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 21:39:27,672 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 21:39:27,672 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 21:39:27,672 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 21:39:27,672 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 21:39:27,672 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 21:39:27,673 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-14 21:39:27,673 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 21:39:27,673 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 21:39:27,673 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 21:39:27,673 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 21:39:27,673 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 21:39:27,674 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 21:39:27,675 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 21:39:27,676 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 21:39:27,676 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 21:39:27,676 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 21:39:27,676 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 21:39:27,677 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 21:39:27,677 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 21:39:27,677 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 -> 9a661b9ed427d2e9174ef6e6cb1f5d6d0ab8d9e2 [2019-01-14 21:39:27,731 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 21:39:27,748 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 21:39:27,752 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 21:39:27,754 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 21:39:27,754 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 21:39:27,755 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/CookSeeZuleger-TACAS2013-Fig8a-modified_true-termination_true-no-overflow.c [2019-01-14 21:39:27,820 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc4c541fa/3c45a56da2634003b154ff177e26271b/FLAGdbabb0ac8 [2019-01-14 21:39:28,229 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 21:39:28,229 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/CookSeeZuleger-TACAS2013-Fig8a-modified_true-termination_true-no-overflow.c [2019-01-14 21:39:28,236 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc4c541fa/3c45a56da2634003b154ff177e26271b/FLAGdbabb0ac8 [2019-01-14 21:39:28,622 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc4c541fa/3c45a56da2634003b154ff177e26271b [2019-01-14 21:39:28,626 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 21:39:28,627 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 21:39:28,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 21:39:28,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 21:39:28,633 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 21:39:28,634 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 09:39:28" (1/1) ... [2019-01-14 21:39:28,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c850f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:39:28, skipping insertion in model container [2019-01-14 21:39:28,637 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 09:39:28" (1/1) ... [2019-01-14 21:39:28,645 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 21:39:28,666 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 21:39:28,891 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 21:39:28,896 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 21:39:28,915 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 21:39:28,932 INFO L195 MainTranslator]: Completed translation [2019-01-14 21:39:28,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:39:28 WrapperNode [2019-01-14 21:39:28,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 21:39:28,934 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 21:39:28,934 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 21:39:28,934 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 21:39:28,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:39:28" (1/1) ... [2019-01-14 21:39:28,950 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:39:28" (1/1) ... [2019-01-14 21:39:28,976 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 21:39:28,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 21:39:28,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 21:39:28,978 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 21:39:28,989 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:39:28" (1/1) ... [2019-01-14 21:39:28,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:39:28" (1/1) ... [2019-01-14 21:39:28,989 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:39:28" (1/1) ... [2019-01-14 21:39:28,990 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:39:28" (1/1) ... [2019-01-14 21:39:28,992 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:39:28" (1/1) ... [2019-01-14 21:39:28,997 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:39:28" (1/1) ... [2019-01-14 21:39:28,998 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:39:28" (1/1) ... [2019-01-14 21:39:29,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 21:39:29,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 21:39:29,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 21:39:29,000 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 21:39:29,001 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:39:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 21:39:29,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 21:39:29,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 21:39:29,314 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 21:39:29,314 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 21:39:29,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:39:29 BoogieIcfgContainer [2019-01-14 21:39:29,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 21:39:29,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 21:39:29,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 21:39:29,320 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 21:39:29,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 09:39:28" (1/3) ... [2019-01-14 21:39:29,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67bafeca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 09:39:29, skipping insertion in model container [2019-01-14 21:39:29,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:39:28" (2/3) ... [2019-01-14 21:39:29,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67bafeca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 09:39:29, skipping insertion in model container [2019-01-14 21:39:29,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:39:29" (3/3) ... [2019-01-14 21:39:29,323 INFO L112 eAbstractionObserver]: Analyzing ICFG CookSeeZuleger-TACAS2013-Fig8a-modified_true-termination_true-no-overflow.c [2019-01-14 21:39:29,333 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 21:39:29,340 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-14 21:39:29,357 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-14 21:39:29,386 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 21:39:29,387 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 21:39:29,387 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 21:39:29,388 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 21:39:29,388 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 21:39:29,388 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 21:39:29,388 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 21:39:29,388 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 21:39:29,388 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 21:39:29,403 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-01-14 21:39:29,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-14 21:39:29,409 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:39:29,410 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-14 21:39:29,412 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:39:29,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:39:29,418 INFO L82 PathProgramCache]: Analyzing trace with hash 963531, now seen corresponding path program 1 times [2019-01-14 21:39:29,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:39:29,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:39:29,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:39:29,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:39:29,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:39:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:39:29,694 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 21:39:29,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:39:29,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:39:29,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 21:39:29,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 21:39:29,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 21:39:29,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:39:29,792 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 5 states. [2019-01-14 21:39:29,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:39:29,907 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-01-14 21:39:29,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 21:39:29,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-01-14 21:39:29,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:39:29,918 INFO L225 Difference]: With dead ends: 23 [2019-01-14 21:39:29,919 INFO L226 Difference]: Without dead ends: 14 [2019-01-14 21:39:29,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:39:29,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-14 21:39:29,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-14 21:39:29,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-14 21:39:29,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-01-14 21:39:29,953 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 4 [2019-01-14 21:39:29,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:39:29,953 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-01-14 21:39:29,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 21:39:29,954 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-01-14 21:39:29,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-14 21:39:29,954 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:39:29,954 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-14 21:39:29,955 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:39:29,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:39:29,955 INFO L82 PathProgramCache]: Analyzing trace with hash 963339, now seen corresponding path program 1 times [2019-01-14 21:39:29,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:39:29,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:39:29,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:39:29,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:39:29,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:39:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:39:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:39:29,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:39:29,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 21:39:29,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 21:39:29,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 21:39:29,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:39:29,990 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 3 states. [2019-01-14 21:39:30,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:39:30,121 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2019-01-14 21:39:30,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 21:39:30,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-14 21:39:30,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:39:30,122 INFO L225 Difference]: With dead ends: 20 [2019-01-14 21:39:30,123 INFO L226 Difference]: Without dead ends: 19 [2019-01-14 21:39:30,124 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-14 21:39:30,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-14 21:39:30,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-01-14 21:39:30,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 21:39:30,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-01-14 21:39:30,128 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 4 [2019-01-14 21:39:30,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:39:30,129 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-01-14 21:39:30,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 21:39:30,129 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2019-01-14 21:39:30,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-14 21:39:30,129 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:39:30,129 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-14 21:39:30,130 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:39:30,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:39:30,130 INFO L82 PathProgramCache]: Analyzing trace with hash 29869514, now seen corresponding path program 1 times [2019-01-14 21:39:30,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:39:30,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:39:30,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:39:30,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:39:30,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:39:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:39:30,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:39:30,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:39:30,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 21:39:30,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 21:39:30,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 21:39:30,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:39:30,216 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 3 states. [2019-01-14 21:39:30,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:39:30,273 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2019-01-14 21:39:30,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 21:39:30,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-14 21:39:30,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:39:30,274 INFO L225 Difference]: With dead ends: 18 [2019-01-14 21:39:30,274 INFO L226 Difference]: Without dead ends: 17 [2019-01-14 21:39:30,275 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-14 21:39:30,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-14 21:39:30,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-14 21:39:30,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 21:39:30,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-01-14 21:39:30,279 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 5 [2019-01-14 21:39:30,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:39:30,280 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-01-14 21:39:30,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 21:39:30,280 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-01-14 21:39:30,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-14 21:39:30,280 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:39:30,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-14 21:39:30,281 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:39:30,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:39:30,281 INFO L82 PathProgramCache]: Analyzing trace with hash 29863556, now seen corresponding path program 1 times [2019-01-14 21:39:30,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:39:30,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:39:30,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:39:30,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:39:30,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:39:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:39:30,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:39:30,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:39:30,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 21:39:30,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 21:39:30,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 21:39:30,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 21:39:30,416 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 4 states. [2019-01-14 21:39:30,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:39:30,525 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-01-14 21:39:30,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 21:39:30,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-14 21:39:30,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:39:30,526 INFO L225 Difference]: With dead ends: 17 [2019-01-14 21:39:30,526 INFO L226 Difference]: Without dead ends: 16 [2019-01-14 21:39:30,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:39:30,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-14 21:39:30,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-14 21:39:30,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-14 21:39:30,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-01-14 21:39:30,531 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 5 [2019-01-14 21:39:30,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:39:30,531 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-01-14 21:39:30,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 21:39:30,531 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2019-01-14 21:39:30,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 21:39:30,532 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:39:30,532 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-01-14 21:39:30,533 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:39:30,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:39:30,533 INFO L82 PathProgramCache]: Analyzing trace with hash 784501312, now seen corresponding path program 1 times [2019-01-14 21:39:30,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:39:30,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:39:30,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:39:30,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:39:30,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:39:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:39:30,673 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-14 21:39:30,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:39:30,673 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:39:30,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:39:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:39:30,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:39:30,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 21:39:30,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:39:30,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 5 [2019-01-14 21:39:30,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 21:39:30,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 21:39:30,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-14 21:39:30,786 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 7 states. [2019-01-14 21:39:30,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:39:30,935 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-01-14 21:39:30,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 21:39:30,939 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-01-14 21:39:30,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:39:30,940 INFO L225 Difference]: With dead ends: 16 [2019-01-14 21:39:30,940 INFO L226 Difference]: Without dead ends: 15 [2019-01-14 21:39:30,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-14 21:39:30,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-14 21:39:30,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2019-01-14 21:39:30,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 21:39:30,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-01-14 21:39:30,945 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 8 [2019-01-14 21:39:30,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:39:30,945 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-01-14 21:39:30,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 21:39:30,946 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-01-14 21:39:30,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 21:39:30,946 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:39:30,946 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-14 21:39:30,947 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:39:30,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:39:30,947 INFO L82 PathProgramCache]: Analyzing trace with hash 784501120, now seen corresponding path program 1 times [2019-01-14 21:39:30,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:39:30,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:39:30,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:39:30,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:39:30,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:39:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:39:30,984 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-14 21:39:30,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:39:30,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 21:39:30,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 21:39:30,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 21:39:30,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 21:39:30,987 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 4 states. [2019-01-14 21:39:31,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:39:31,060 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2019-01-14 21:39:31,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 21:39:31,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-01-14 21:39:31,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:39:31,061 INFO L225 Difference]: With dead ends: 21 [2019-01-14 21:39:31,062 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 21:39:31,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 21:39:31,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 21:39:31,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 21:39:31,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 21:39:31,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 21:39:31,064 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2019-01-14 21:39:31,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:39:31,064 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 21:39:31,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 21:39:31,064 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 21:39:31,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 21:39:31,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 21:39:31,383 WARN L181 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2019-01-14 21:39:31,397 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 21:39:31,397 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 21) no Hoare annotation was computed. [2019-01-14 21:39:31,397 INFO L448 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2019-01-14 21:39:31,397 INFO L448 ceAbstractionStarter]: For program point L21-1(line 21) no Hoare annotation was computed. [2019-01-14 21:39:31,397 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2019-01-14 21:39:31,397 INFO L448 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. [2019-01-14 21:39:31,398 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2019-01-14 21:39:31,398 INFO L448 ceAbstractionStarter]: For program point L17-2(lines 17 23) no Hoare annotation was computed. [2019-01-14 21:39:31,398 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 21:39:31,398 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 21:39:31,398 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 21) no Hoare annotation was computed. [2019-01-14 21:39:31,399 INFO L444 ceAbstractionStarter]: At program point L24(lines 13 25) the Hoare annotation is: (or (<= (+ ULTIMATE.start_main_~K~0 1) ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~K~0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2147483646)) [2019-01-14 21:39:31,399 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 22) no Hoare annotation was computed. [2019-01-14 21:39:31,399 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2019-01-14 21:39:31,399 INFO L444 ceAbstractionStarter]: At program point L18-2(lines 17 23) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 2147483647) (<= 0 (+ ULTIMATE.start_main_~x~0 2147483648)) (<= ULTIMATE.start_main_~K~0 2147483647) (<= 0 (+ ULTIMATE.start_main_~K~0 2147483648))) [2019-01-14 21:39:31,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 09:39:31 BoogieIcfgContainer [2019-01-14 21:39:31,414 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 21:39:31,414 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 21:39:31,415 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 21:39:31,415 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 21:39:31,415 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:39:29" (3/4) ... [2019-01-14 21:39:31,420 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 21:39:31,432 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-14 21:39:31,432 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 21:39:31,474 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 21:39:31,474 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 21:39:31,476 INFO L168 Benchmark]: Toolchain (without parser) took 2849.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -72.0 MB). Peak memory consumption was 62.2 MB. Max. memory is 11.5 GB. [2019-01-14 21:39:31,477 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:39:31,478 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.06 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-14 21:39:31,479 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.97 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-14 21:39:31,479 INFO L168 Benchmark]: Boogie Preprocessor took 22.53 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-14 21:39:31,479 INFO L168 Benchmark]: RCFGBuilder took 315.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -169.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-14 21:39:31,480 INFO L168 Benchmark]: TraceAbstraction took 2097.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 79.6 MB). Peak memory consumption was 79.6 MB. Max. memory is 11.5 GB. [2019-01-14 21:39:31,482 INFO L168 Benchmark]: Witness Printer took 59.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-14 21:39:31,487 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.20 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 305.06 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 42.97 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 22.53 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 315.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -169.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2097.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 79.6 MB). Peak memory consumption was 79.6 MB. Max. memory is 11.5 GB. * Witness Printer took 59.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * 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: 21]: 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 - PositiveResult [Line: 21]: 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 Derived loop invariant: ((x <= 2147483647 && 0 <= x + 2147483648) && K <= 2147483647) && 0 <= K + 2147483648 - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: (K + 1 <= x || K == x) || x <= 2147483646 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 4 error locations. SAFE Result, 2.0s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 15 SDtfs, 53 SDslu, 3 SDs, 0 SdLazy, 101 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=2, 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, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 6 NumberOfFragments, 29 HoareAnnotationTreeSize, 2 FomulaSimplifications, 115 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 18 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 42 NumberOfCodeBlocks, 42 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 784 SizeOfPredicates, 1 NumberOfNonLiveVariables, 19 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 4/8 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...