./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted-lit/HarrisLalNoriRajamani-SAS2010-Fig2_false-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/HarrisLalNoriRajamani-SAS2010-Fig2_false-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 6ff697c57265298ce2261966fa58c440777fc865 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW) --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 20:36:18,380 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 20:36:18,382 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 20:36:18,394 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 20:36:18,394 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 20:36:18,395 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 20:36:18,397 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 20:36:18,399 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 20:36:18,400 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 20:36:18,401 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 20:36:18,402 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 20:36:18,402 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 20:36:18,403 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 20:36:18,404 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 20:36:18,405 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 20:36:18,406 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 20:36:18,407 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 20:36:18,409 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 20:36:18,411 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 20:36:18,413 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 20:36:18,414 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 20:36:18,415 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 20:36:18,418 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 20:36:18,418 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 20:36:18,419 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 20:36:18,420 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 20:36:18,421 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 20:36:18,421 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 20:36:18,422 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 20:36:18,426 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 20:36:18,426 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 20:36:18,427 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 20:36:18,427 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 20:36:18,427 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 20:36:18,428 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 20:36:18,429 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 20:36:18,429 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:36:18,459 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 20:36:18,459 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 20:36:18,461 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 20:36:18,461 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 20:36:18,462 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 20:36:18,462 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 20:36:18,462 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 20:36:18,462 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 20:36:18,462 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 20:36:18,463 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 20:36:18,463 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 20:36:18,463 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 20:36:18,463 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-01 20:36:18,463 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 20:36:18,463 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 20:36:18,464 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 20:36:18,464 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 20:36:18,464 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 20:36:18,464 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 20:36:18,464 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 20:36:18,464 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 20:36:18,466 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 20:36:18,466 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 20:36:18,466 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 20:36:18,466 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 20:36:18,466 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 20:36:18,467 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 20:36:18,467 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 -> 6ff697c57265298ce2261966fa58c440777fc865 [2019-01-01 20:36:18,521 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 20:36:18,537 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 20:36:18,543 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 20:36:18,545 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 20:36:18,546 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 20:36:18,546 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/HarrisLalNoriRajamani-SAS2010-Fig2_false-no-overflow.c [2019-01-01 20:36:18,615 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c3729bf8/126414c9799e4621b50865156c94f484/FLAG6afb8d2af [2019-01-01 20:36:19,084 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 20:36:19,085 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/HarrisLalNoriRajamani-SAS2010-Fig2_false-no-overflow.c [2019-01-01 20:36:19,092 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c3729bf8/126414c9799e4621b50865156c94f484/FLAG6afb8d2af [2019-01-01 20:36:19,415 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c3729bf8/126414c9799e4621b50865156c94f484 [2019-01-01 20:36:19,419 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 20:36:19,420 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 20:36:19,422 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 20:36:19,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 20:36:19,425 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 20:36:19,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:36:19" (1/1) ... [2019-01-01 20:36:19,429 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5677bf69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:36:19, skipping insertion in model container [2019-01-01 20:36:19,429 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:36:19" (1/1) ... [2019-01-01 20:36:19,437 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 20:36:19,456 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 20:36:19,652 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:36:19,657 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 20:36:19,676 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:36:19,692 INFO L195 MainTranslator]: Completed translation [2019-01-01 20:36:19,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:36:19 WrapperNode [2019-01-01 20:36:19,692 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 20:36:19,693 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 20:36:19,693 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 20:36:19,693 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 20:36:19,703 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:36:19" (1/1) ... [2019-01-01 20:36:19,707 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:36:19" (1/1) ... [2019-01-01 20:36:19,748 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 20:36:19,749 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 20:36:19,749 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 20:36:19,749 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 20:36:19,758 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:36:19" (1/1) ... [2019-01-01 20:36:19,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:36:19" (1/1) ... [2019-01-01 20:36:19,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:36:19" (1/1) ... [2019-01-01 20:36:19,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:36:19" (1/1) ... [2019-01-01 20:36:19,767 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:36:19" (1/1) ... [2019-01-01 20:36:19,774 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:36:19" (1/1) ... [2019-01-01 20:36:19,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:36:19" (1/1) ... [2019-01-01 20:36:19,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 20:36:19,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 20:36:19,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 20:36:19,780 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 20:36:19,780 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:36:19" (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:36:19,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 20:36:19,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 20:36:20,593 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 20:36:20,594 INFO L280 CfgBuilder]: Removed 13 assue(true) statements. [2019-01-01 20:36:20,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:36:20 BoogieIcfgContainer [2019-01-01 20:36:20,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 20:36:20,595 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 20:36:20,595 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 20:36:20,598 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 20:36:20,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 08:36:19" (1/3) ... [2019-01-01 20:36:20,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a1c2d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:36:20, skipping insertion in model container [2019-01-01 20:36:20,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:36:19" (2/3) ... [2019-01-01 20:36:20,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a1c2d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:36:20, skipping insertion in model container [2019-01-01 20:36:20,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:36:20" (3/3) ... [2019-01-01 20:36:20,602 INFO L112 eAbstractionObserver]: Analyzing ICFG HarrisLalNoriRajamani-SAS2010-Fig2_false-no-overflow.c [2019-01-01 20:36:20,610 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 20:36:20,619 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-01 20:36:20,634 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-01 20:36:20,667 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 20:36:20,668 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 20:36:20,668 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 20:36:20,668 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 20:36:20,669 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 20:36:20,669 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 20:36:20,669 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 20:36:20,669 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 20:36:20,669 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 20:36:20,687 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-01-01 20:36:20,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-01 20:36:20,693 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:36:20,694 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-01 20:36:20,698 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:36:20,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:36:20,705 INFO L82 PathProgramCache]: Analyzing trace with hash 30881, now seen corresponding path program 1 times [2019-01-01 20:36:20,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:36:20,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:36:20,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:36:20,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:36:20,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:36:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:36:20,837 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:36:20,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:36:20,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 20:36:20,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:36:20,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:36:20,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:36:20,860 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2019-01-01 20:36:20,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:36:20,952 INFO L93 Difference]: Finished difference Result 69 states and 103 transitions. [2019-01-01 20:36:20,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:36:20,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-01 20:36:20,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:36:20,971 INFO L225 Difference]: With dead ends: 69 [2019-01-01 20:36:20,971 INFO L226 Difference]: Without dead ends: 59 [2019-01-01 20:36:20,976 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:36:20,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-01 20:36:21,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-01 20:36:21,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-01 20:36:21,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 93 transitions. [2019-01-01 20:36:21,021 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 93 transitions. Word has length 3 [2019-01-01 20:36:21,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:36:21,021 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 93 transitions. [2019-01-01 20:36:21,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:36:21,021 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 93 transitions. [2019-01-01 20:36:21,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-01 20:36:21,022 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:36:21,022 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-01 20:36:21,022 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:36:21,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:36:21,023 INFO L82 PathProgramCache]: Analyzing trace with hash 957349, now seen corresponding path program 1 times [2019-01-01 20:36:21,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:36:21,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:36:21,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:36:21,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:36:21,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:36:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:36:21,049 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:36:21,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:36:21,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 20:36:21,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:36:21,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:36:21,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:36:21,052 INFO L87 Difference]: Start difference. First operand 59 states and 93 transitions. Second operand 3 states. [2019-01-01 20:36:21,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:36:21,272 INFO L93 Difference]: Finished difference Result 113 states and 180 transitions. [2019-01-01 20:36:21,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:36:21,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-01 20:36:21,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:36:21,276 INFO L225 Difference]: With dead ends: 113 [2019-01-01 20:36:21,276 INFO L226 Difference]: Without dead ends: 111 [2019-01-01 20:36:21,278 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:36:21,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-01 20:36:21,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2019-01-01 20:36:21,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-01 20:36:21,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 173 transitions. [2019-01-01 20:36:21,301 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 173 transitions. Word has length 4 [2019-01-01 20:36:21,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:36:21,302 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 173 transitions. [2019-01-01 20:36:21,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:36:21,302 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 173 transitions. [2019-01-01 20:36:21,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-01 20:36:21,304 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:36:21,304 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:36:21,304 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:36:21,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:36:21,305 INFO L82 PathProgramCache]: Analyzing trace with hash 725490672, now seen corresponding path program 1 times [2019-01-01 20:36:21,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:36:21,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:36:21,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:36:21,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:36:21,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:36:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:36:21,373 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:36:21,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:36:21,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 20:36:21,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:36:21,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:36:21,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:36:21,379 INFO L87 Difference]: Start difference. First operand 106 states and 173 transitions. Second operand 3 states. [2019-01-01 20:36:21,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:36:21,489 INFO L93 Difference]: Finished difference Result 110 states and 178 transitions. [2019-01-01 20:36:21,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:36:21,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-01-01 20:36:21,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:36:21,492 INFO L225 Difference]: With dead ends: 110 [2019-01-01 20:36:21,492 INFO L226 Difference]: Without dead ends: 109 [2019-01-01 20:36:21,493 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:36:21,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-01 20:36:21,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-01-01 20:36:21,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-01 20:36:21,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 175 transitions. [2019-01-01 20:36:21,513 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 175 transitions. Word has length 14 [2019-01-01 20:36:21,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:36:21,514 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 175 transitions. [2019-01-01 20:36:21,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:36:21,514 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 175 transitions. [2019-01-01 20:36:21,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-01 20:36:21,515 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:36:21,518 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:36:21,519 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:36:21,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:36:21,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1015374612, now seen corresponding path program 1 times [2019-01-01 20:36:21,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:36:21,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:36:21,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:36:21,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:36:21,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:36:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:36:21,634 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:36:21,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:36:21,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:36:21,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:36:21,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:36:21,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:36:21,638 INFO L87 Difference]: Start difference. First operand 108 states and 175 transitions. Second operand 4 states. [2019-01-01 20:36:21,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:36:21,748 INFO L93 Difference]: Finished difference Result 108 states and 175 transitions. [2019-01-01 20:36:21,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 20:36:21,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-01-01 20:36:21,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:36:21,750 INFO L225 Difference]: With dead ends: 108 [2019-01-01 20:36:21,750 INFO L226 Difference]: Without dead ends: 107 [2019-01-01 20:36:21,752 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:36:21,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-01 20:36:21,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-01 20:36:21,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-01 20:36:21,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 174 transitions. [2019-01-01 20:36:21,769 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 174 transitions. Word has length 15 [2019-01-01 20:36:21,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:36:21,773 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 174 transitions. [2019-01-01 20:36:21,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:36:21,773 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 174 transitions. [2019-01-01 20:36:21,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 20:36:21,775 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:36:21,775 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:36:21,775 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:36:21,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:36:21,778 INFO L82 PathProgramCache]: Analyzing trace with hash -145038970, now seen corresponding path program 1 times [2019-01-01 20:36:21,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:36:21,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:36:21,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:36:21,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:36:21,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:36:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:36:21,877 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:36:21,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:36:21,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:36:21,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:36:21,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:36:21,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:36:21,878 INFO L87 Difference]: Start difference. First operand 107 states and 174 transitions. Second operand 4 states. [2019-01-01 20:36:21,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:36:21,938 INFO L93 Difference]: Finished difference Result 115 states and 182 transitions. [2019-01-01 20:36:21,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 20:36:21,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-01-01 20:36:21,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:36:21,941 INFO L225 Difference]: With dead ends: 115 [2019-01-01 20:36:21,941 INFO L226 Difference]: Without dead ends: 114 [2019-01-01 20:36:21,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-01 20:36:21,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-01 20:36:21,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 104. [2019-01-01 20:36:21,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-01 20:36:21,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 171 transitions. [2019-01-01 20:36:21,953 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 171 transitions. Word has length 16 [2019-01-01 20:36:21,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:36:21,953 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 171 transitions. [2019-01-01 20:36:21,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:36:21,953 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 171 transitions. [2019-01-01 20:36:21,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 20:36:21,955 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:36:21,955 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:36:21,955 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:36:21,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:36:21,956 INFO L82 PathProgramCache]: Analyzing trace with hash -145032788, now seen corresponding path program 1 times [2019-01-01 20:36:21,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:36:21,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:36:21,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:36:21,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:36:21,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:36:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:36:22,075 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:36:22,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:36:22,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:36:22,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:36:22,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:36:22,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:36:22,077 INFO L87 Difference]: Start difference. First operand 104 states and 171 transitions. Second operand 4 states. [2019-01-01 20:36:22,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:36:22,158 INFO L93 Difference]: Finished difference Result 110 states and 177 transitions. [2019-01-01 20:36:22,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 20:36:22,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-01-01 20:36:22,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:36:22,160 INFO L225 Difference]: With dead ends: 110 [2019-01-01 20:36:22,160 INFO L226 Difference]: Without dead ends: 109 [2019-01-01 20:36:22,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-01 20:36:22,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-01 20:36:22,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2019-01-01 20:36:22,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-01 20:36:22,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 173 transitions. [2019-01-01 20:36:22,169 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 173 transitions. Word has length 16 [2019-01-01 20:36:22,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:36:22,169 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 173 transitions. [2019-01-01 20:36:22,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:36:22,169 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 173 transitions. [2019-01-01 20:36:22,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-01 20:36:22,171 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:36:22,171 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:36:22,172 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:36:22,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:36:22,172 INFO L82 PathProgramCache]: Analyzing trace with hash 817434134, now seen corresponding path program 1 times [2019-01-01 20:36:22,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:36:22,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:36:22,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:36:22,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:36:22,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:36:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:36:22,234 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:36:22,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:36:22,235 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:36:22,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:36:22,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:36:22,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:36:22,341 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:36:22,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 20:36:22,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2019-01-01 20:36:22,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 20:36:22,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 20:36:22,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:36:22,368 INFO L87 Difference]: Start difference. First operand 106 states and 173 transitions. Second operand 7 states. [2019-01-01 20:36:22,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:36:22,730 INFO L93 Difference]: Finished difference Result 113 states and 180 transitions. [2019-01-01 20:36:22,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 20:36:22,731 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-01-01 20:36:22,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:36:22,732 INFO L225 Difference]: With dead ends: 113 [2019-01-01 20:36:22,732 INFO L226 Difference]: Without dead ends: 106 [2019-01-01 20:36:22,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:36:22,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-01 20:36:22,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-01-01 20:36:22,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-01 20:36:22,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 172 transitions. [2019-01-01 20:36:22,740 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 172 transitions. Word has length 17 [2019-01-01 20:36:22,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:36:22,740 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 172 transitions. [2019-01-01 20:36:22,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 20:36:22,741 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 172 transitions. [2019-01-01 20:36:22,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 20:36:22,742 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:36:22,742 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:36:22,743 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:36:22,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:36:22,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1943488504, now seen corresponding path program 1 times [2019-01-01 20:36:22,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:36:22,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:36:22,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:36:22,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:36:22,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:36:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 20:36:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 20:36:22,780 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-01 20:36:22,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 08:36:22 BoogieIcfgContainer [2019-01-01 20:36:22,803 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 20:36:22,803 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 20:36:22,803 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 20:36:22,804 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 20:36:22,804 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:36:20" (3/4) ... [2019-01-01 20:36:22,807 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-01 20:36:22,857 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 20:36:22,857 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 20:36:22,858 INFO L168 Benchmark]: Toolchain (without parser) took 3438.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -54.8 MB). Peak memory consumption was 86.3 MB. Max. memory is 11.5 GB. [2019-01-01 20:36:22,861 INFO L168 Benchmark]: CDTParser took 1.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:36:22,861 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.00 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-01-01 20:36:22,863 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.34 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:36:22,863 INFO L168 Benchmark]: Boogie Preprocessor took 30.29 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-01 20:36:22,864 INFO L168 Benchmark]: RCFGBuilder took 815.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -166.6 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2019-01-01 20:36:22,866 INFO L168 Benchmark]: TraceAbstraction took 2207.94 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: 94.4 MB). Peak memory consumption was 94.4 MB. Max. memory is 11.5 GB. [2019-01-01 20:36:22,866 INFO L168 Benchmark]: Witness Printer took 54.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:36:22,872 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 271.00 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.34 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 30.29 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 815.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -166.6 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2207.94 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: 94.4 MB). Peak memory consumption was 94.4 MB. Max. memory is 11.5 GB. * Witness Printer took 54.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 81]: integer overflow possible integer overflow possible We found a FailurePath: [L53] int d = 1; [L54] int x = __VERIFIER_nondet_int(); [L56] COND TRUE __VERIFIER_nondet_int() [L57] EXPR d - 1 [L57] d = d - 1 [L61] COND FALSE !(__VERIFIER_nondet_int()) [L64] COND FALSE !(__VERIFIER_nondet_int()) [L67] COND FALSE !(__VERIFIER_nondet_int()) [L70] COND FALSE !(__VERIFIER_nondet_int()) [L76] COND TRUE __VERIFIER_nondet_int() [L77] EXPR d - 1 [L77] d = d - 1 [L80] COND TRUE x > 0 [L81] x - d - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 65 locations, 6 error locations. UNSAFE Result, 2.1s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 587 SDtfs, 960 SDslu, 719 SDs, 0 SdLazy, 128 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=3, 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.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 19 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 94 ConstructedInterpolants, 0 QuantifiedInterpolants, 6024 SizeOfPredicates, 0 NumberOfNonLiveVariables, 39 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...