./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/McCarthy91_Recursion.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/termination-crafted/McCarthy91_Recursion.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 871be16186d4378aec884efd2352a47ca4eb57bc ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:49:58,750 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:49:58,752 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:49:58,763 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:49:58,764 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:49:58,765 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:49:58,766 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:49:58,768 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:49:58,774 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:49:58,775 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:49:58,776 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:49:58,778 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:49:58,778 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:49:58,780 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:49:58,781 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:49:58,783 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:49:58,784 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:49:58,787 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:49:58,790 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:49:58,795 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:49:58,797 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:49:58,798 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:49:58,799 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:49:58,800 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:49:58,803 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:49:58,803 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:49:58,803 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:49:58,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:49:58,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:49:58,806 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:49:58,806 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:49:58,807 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:49:58,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:49:58,809 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:49:58,810 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:49:58,810 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:49:58,811 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:49:58,811 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:49:58,811 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:49:58,812 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:49:58,813 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:49:58,814 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-28 02:49:58,829 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:49:58,829 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:49:58,830 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:49:58,831 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:49:58,831 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:49:58,831 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:49:58,832 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:49:58,832 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:49:58,832 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:49:58,832 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 02:49:58,833 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:49:58,833 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 02:49:58,833 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-28 02:49:58,834 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 02:49:58,834 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:49:58,834 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 02:49:58,834 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:49:58,835 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:49:58,835 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:49:58,835 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:49:58,836 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:49:58,836 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:49:58,836 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:49:58,836 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 02:49:58,837 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:49:58,837 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:49:58,837 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 02:49:58,838 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 871be16186d4378aec884efd2352a47ca4eb57bc [2019-11-28 02:49:59,155 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:49:59,173 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:49:59,176 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:49:59,178 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:49:59,178 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:49:59,179 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/McCarthy91_Recursion.c [2019-11-28 02:49:59,255 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/842cf14b8/0af7cf41ffa54d4bbf6178345736c4a6/FLAGf8621c608 [2019-11-28 02:49:59,653 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:49:59,655 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/McCarthy91_Recursion.c [2019-11-28 02:49:59,662 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/842cf14b8/0af7cf41ffa54d4bbf6178345736c4a6/FLAGf8621c608 [2019-11-28 02:50:00,025 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/842cf14b8/0af7cf41ffa54d4bbf6178345736c4a6 [2019-11-28 02:50:00,029 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:50:00,031 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 02:50:00,032 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:50:00,032 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:50:00,036 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:50:00,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:50:00" (1/1) ... [2019-11-28 02:50:00,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a02a077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:00, skipping insertion in model container [2019-11-28 02:50:00,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:50:00" (1/1) ... [2019-11-28 02:50:00,048 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:50:00,062 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:50:00,231 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:50:00,236 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:50:00,249 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:50:00,260 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:50:00,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:00 WrapperNode [2019-11-28 02:50:00,260 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:50:00,261 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 02:50:00,261 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 02:50:00,261 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 02:50:00,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:00" (1/1) ... [2019-11-28 02:50:00,273 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:00" (1/1) ... [2019-11-28 02:50:00,289 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 02:50:00,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:50:00,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:50:00,290 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:50:00,350 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:00" (1/1) ... [2019-11-28 02:50:00,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:00" (1/1) ... [2019-11-28 02:50:00,351 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:00" (1/1) ... [2019-11-28 02:50:00,351 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:00" (1/1) ... [2019-11-28 02:50:00,353 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:00" (1/1) ... [2019-11-28 02:50:00,354 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:00" (1/1) ... [2019-11-28 02:50:00,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:00" (1/1) ... [2019-11-28 02:50:00,356 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:50:00,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:50:00,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:50:00,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:50:00,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:00" (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-11-28 02:50:00,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:50:00,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:50:00,416 INFO L130 BoogieDeclarations]: Found specification of procedure mc91 [2019-11-28 02:50:00,416 INFO L138 BoogieDeclarations]: Found implementation of procedure mc91 [2019-11-28 02:50:00,587 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:50:00,587 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 02:50:00,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:50:00 BoogieIcfgContainer [2019-11-28 02:50:00,588 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:50:00,589 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:50:00,590 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:50:00,593 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:50:00,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:50:00" (1/3) ... [2019-11-28 02:50:00,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eea186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:50:00, skipping insertion in model container [2019-11-28 02:50:00,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:00" (2/3) ... [2019-11-28 02:50:00,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eea186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:50:00, skipping insertion in model container [2019-11-28 02:50:00,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:50:00" (3/3) ... [2019-11-28 02:50:00,597 INFO L109 eAbstractionObserver]: Analyzing ICFG McCarthy91_Recursion.c [2019-11-28 02:50:00,606 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:50:00,614 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-28 02:50:00,627 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-28 02:50:00,683 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:50:00,687 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 02:50:00,687 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:50:00,687 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:50:00,687 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:50:00,687 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:50:00,688 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:50:00,688 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:50:00,714 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-11-28 02:50:00,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 02:50:00,719 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:00,720 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 02:50:00,721 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:00,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:00,727 INFO L82 PathProgramCache]: Analyzing trace with hash 30304495, now seen corresponding path program 1 times [2019-11-28 02:50:00,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:00,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694452439] [2019-11-28 02:50:00,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:00,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:00,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694452439] [2019-11-28 02:50:00,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:00,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:50:00,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932220578] [2019-11-28 02:50:00,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:50:00,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:00,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:50:00,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:50:00,908 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 5 states. [2019-11-28 02:50:01,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:01,053 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2019-11-28 02:50:01,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:50:01,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-11-28 02:50:01,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:01,077 INFO L225 Difference]: With dead ends: 40 [2019-11-28 02:50:01,077 INFO L226 Difference]: Without dead ends: 32 [2019-11-28 02:50:01,081 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:50:01,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-28 02:50:01,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2019-11-28 02:50:01,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 02:50:01,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-11-28 02:50:01,124 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 5 [2019-11-28 02:50:01,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:01,125 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-11-28 02:50:01,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:50:01,125 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2019-11-28 02:50:01,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 02:50:01,126 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:01,126 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 02:50:01,126 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:01,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:01,127 INFO L82 PathProgramCache]: Analyzing trace with hash 30304655, now seen corresponding path program 1 times [2019-11-28 02:50:01,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:01,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39536592] [2019-11-28 02:50:01,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:01,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:01,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39536592] [2019-11-28 02:50:01,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:01,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:50:01,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918923717] [2019-11-28 02:50:01,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:50:01,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:01,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:50:01,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:01,150 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 3 states. [2019-11-28 02:50:01,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:01,177 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2019-11-28 02:50:01,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:50:01,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 02:50:01,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:01,178 INFO L225 Difference]: With dead ends: 29 [2019-11-28 02:50:01,179 INFO L226 Difference]: Without dead ends: 28 [2019-11-28 02:50:01,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:01,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-28 02:50:01,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-11-28 02:50:01,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 02:50:01,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-11-28 02:50:01,191 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 5 [2019-11-28 02:50:01,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:01,192 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-11-28 02:50:01,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:50:01,192 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-11-28 02:50:01,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-28 02:50:01,193 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:01,193 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-28 02:50:01,194 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:01,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:01,194 INFO L82 PathProgramCache]: Analyzing trace with hash 939439389, now seen corresponding path program 1 times [2019-11-28 02:50:01,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:01,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003006386] [2019-11-28 02:50:01,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:01,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:01,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003006386] [2019-11-28 02:50:01,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:01,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:50:01,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923531175] [2019-11-28 02:50:01,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:50:01,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:01,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:50:01,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:01,220 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 3 states. [2019-11-28 02:50:01,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:01,244 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2019-11-28 02:50:01,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:50:01,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-28 02:50:01,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:01,246 INFO L225 Difference]: With dead ends: 28 [2019-11-28 02:50:01,247 INFO L226 Difference]: Without dead ends: 25 [2019-11-28 02:50:01,248 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:01,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-28 02:50:01,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-11-28 02:50:01,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 02:50:01,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-11-28 02:50:01,256 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 6 [2019-11-28 02:50:01,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:01,256 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-11-28 02:50:01,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:50:01,257 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-11-28 02:50:01,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-28 02:50:01,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:01,257 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-28 02:50:01,258 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:01,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:01,258 INFO L82 PathProgramCache]: Analyzing trace with hash 939444354, now seen corresponding path program 1 times [2019-11-28 02:50:01,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:01,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431197737] [2019-11-28 02:50:01,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:01,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:01,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431197737] [2019-11-28 02:50:01,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:01,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:50:01,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978663327] [2019-11-28 02:50:01,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:50:01,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:01,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:50:01,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:50:01,311 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 5 states. [2019-11-28 02:50:01,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:01,387 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2019-11-28 02:50:01,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:50:01,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-11-28 02:50:01,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:01,390 INFO L225 Difference]: With dead ends: 39 [2019-11-28 02:50:01,390 INFO L226 Difference]: Without dead ends: 38 [2019-11-28 02:50:01,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:50:01,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-28 02:50:01,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2019-11-28 02:50:01,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-28 02:50:01,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2019-11-28 02:50:01,405 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 6 [2019-11-28 02:50:01,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:01,405 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2019-11-28 02:50:01,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:50:01,405 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2019-11-28 02:50:01,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 02:50:01,406 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:01,407 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:01,407 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:01,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:01,408 INFO L82 PathProgramCache]: Analyzing trace with hash 312291472, now seen corresponding path program 1 times [2019-11-28 02:50:01,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:01,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836940353] [2019-11-28 02:50:01,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:01,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:01,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836940353] [2019-11-28 02:50:01,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:01,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:50:01,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691756180] [2019-11-28 02:50:01,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:50:01,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:01,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:50:01,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:50:01,465 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 5 states. [2019-11-28 02:50:01,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:01,552 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2019-11-28 02:50:01,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:50:01,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-28 02:50:01,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:01,554 INFO L225 Difference]: With dead ends: 55 [2019-11-28 02:50:01,554 INFO L226 Difference]: Without dead ends: 54 [2019-11-28 02:50:01,555 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-11-28 02:50:01,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-28 02:50:01,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2019-11-28 02:50:01,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 02:50:01,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2019-11-28 02:50:01,572 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 10 [2019-11-28 02:50:01,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:01,572 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2019-11-28 02:50:01,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:50:01,575 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2019-11-28 02:50:01,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 02:50:01,576 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:01,576 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:01,576 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:01,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:01,577 INFO L82 PathProgramCache]: Analyzing trace with hash -904725729, now seen corresponding path program 1 times [2019-11-28 02:50:01,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:01,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480565979] [2019-11-28 02:50:01,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:01,723 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 02:50:01,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480565979] [2019-11-28 02:50:01,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995304589] [2019-11-28 02:50:01,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:01,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 02:50:01,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:01,926 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:01,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:01,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2019-11-28 02:50:01,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863504812] [2019-11-28 02:50:01,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 02:50:01,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:01,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 02:50:01,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-11-28 02:50:01,929 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 15 states. [2019-11-28 02:50:02,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:02,252 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2019-11-28 02:50:02,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 02:50:02,253 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-11-28 02:50:02,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:02,256 INFO L225 Difference]: With dead ends: 70 [2019-11-28 02:50:02,256 INFO L226 Difference]: Without dead ends: 69 [2019-11-28 02:50:02,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2019-11-28 02:50:02,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-28 02:50:02,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 46. [2019-11-28 02:50:02,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-28 02:50:02,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2019-11-28 02:50:02,288 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 18 [2019-11-28 02:50:02,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:02,290 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2019-11-28 02:50:02,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 02:50:02,290 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2019-11-28 02:50:02,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:50:02,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:02,293 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:02,494 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:02,494 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:02,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:02,495 INFO L82 PathProgramCache]: Analyzing trace with hash 2018278482, now seen corresponding path program 1 times [2019-11-28 02:50:02,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:02,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767426852] [2019-11-28 02:50:02,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:02,589 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:50:02,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767426852] [2019-11-28 02:50:02,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:02,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:50:02,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520992374] [2019-11-28 02:50:02,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:50:02,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:02,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:50:02,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:50:02,593 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 7 states. [2019-11-28 02:50:02,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:02,748 INFO L93 Difference]: Finished difference Result 98 states and 127 transitions. [2019-11-28 02:50:02,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:50:02,749 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-28 02:50:02,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:02,751 INFO L225 Difference]: With dead ends: 98 [2019-11-28 02:50:02,751 INFO L226 Difference]: Without dead ends: 97 [2019-11-28 02:50:02,752 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:50:02,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-28 02:50:02,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2019-11-28 02:50:02,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-28 02:50:02,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2019-11-28 02:50:02,772 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 19 [2019-11-28 02:50:02,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:02,773 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2019-11-28 02:50:02,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:50:02,773 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2019-11-28 02:50:02,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 02:50:02,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:02,776 INFO L410 BasicCegarLoop]: trace histogram [7, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-28 02:50:02,776 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:02,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:02,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1310326519, now seen corresponding path program 1 times [2019-11-28 02:50:02,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:02,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720417172] [2019-11-28 02:50:02,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:02,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:02,934 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-11-28 02:50:02,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720417172] [2019-11-28 02:50:02,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:02,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 02:50:02,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224549772] [2019-11-28 02:50:02,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:50:02,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:02,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:50:02,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:50:02,939 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand 8 states. [2019-11-28 02:50:03,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:03,142 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2019-11-28 02:50:03,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 02:50:03,143 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-11-28 02:50:03,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:03,144 INFO L225 Difference]: With dead ends: 92 [2019-11-28 02:50:03,144 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 02:50:03,147 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-11-28 02:50:03,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 02:50:03,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 02:50:03,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 02:50:03,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 02:50:03,151 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2019-11-28 02:50:03,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:03,151 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:50:03,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:50:03,152 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:50:03,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 02:50:03,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 02:50:03,509 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 02:50:03,509 INFO L242 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 2147483647) (<= 0 (+ ULTIMATE.start_main_~x~0 2147483648))) [2019-11-28 02:50:03,509 INFO L246 CegarLoopResult]: For program point L16-1(line 16) no Hoare annotation was computed. [2019-11-28 02:50:03,509 INFO L246 CegarLoopResult]: For program point L14(lines 14 17) no Hoare annotation was computed. [2019-11-28 02:50:03,509 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 02:50:03,510 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 02:50:03,510 INFO L246 CegarLoopResult]: For program point mc91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 11) no Hoare annotation was computed. [2019-11-28 02:50:03,510 INFO L246 CegarLoopResult]: For program point mc91FINAL(lines 8 12) no Hoare annotation was computed. [2019-11-28 02:50:03,510 INFO L246 CegarLoopResult]: For program point mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 11) no Hoare annotation was computed. [2019-11-28 02:50:03,510 INFO L246 CegarLoopResult]: For program point mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 10) no Hoare annotation was computed. [2019-11-28 02:50:03,510 INFO L246 CegarLoopResult]: For program point mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 10) no Hoare annotation was computed. [2019-11-28 02:50:03,511 INFO L246 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2019-11-28 02:50:03,512 INFO L246 CegarLoopResult]: For program point L10(lines 10 11) no Hoare annotation was computed. [2019-11-28 02:50:03,512 INFO L246 CegarLoopResult]: For program point L11-1(line 11) no Hoare annotation was computed. [2019-11-28 02:50:03,512 INFO L246 CegarLoopResult]: For program point L10-1(line 10) no Hoare annotation was computed. [2019-11-28 02:50:03,513 INFO L242 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: (let ((.cse0 (= mc91_~n |mc91_#in~n|))) (and (or (not (<= |mc91_#in~n| 2147483647)) (not (<= 0 (+ |mc91_#in~n| 2147483648))) (and (<= mc91_~n 100) .cse0)) (or (and (<= mc91_~n 2147483647) .cse0) (not (<= |mc91_#in~n| 2147483648)) (not (<= 91 |mc91_#in~n|))))) [2019-11-28 02:50:03,513 INFO L246 CegarLoopResult]: For program point L10-2(line 10) no Hoare annotation was computed. [2019-11-28 02:50:03,513 INFO L246 CegarLoopResult]: For program point L11-3(line 11) no Hoare annotation was computed. [2019-11-28 02:50:03,514 INFO L242 CegarLoopResult]: At program point L11-4(line 11) the Hoare annotation is: (let ((.cse0 (= mc91_~n |mc91_#in~n|))) (and (or (not (<= |mc91_#in~n| 2147483648)) (not (<= 91 |mc91_#in~n|)) (and (<= mc91_~n 100) .cse0)) (or (not (<= |mc91_#in~n| 2147483647)) (not (<= 0 (+ |mc91_#in~n| 2147483648))) (and (<= |mc91_#t~ret0| 2147483648) (<= 91 |mc91_#t~ret0|) .cse0)))) [2019-11-28 02:50:03,514 INFO L249 CegarLoopResult]: At program point mc91ENTRY(lines 8 12) the Hoare annotation is: true [2019-11-28 02:50:03,514 INFO L246 CegarLoopResult]: For program point L11-5(line 11) no Hoare annotation was computed. [2019-11-28 02:50:03,514 INFO L246 CegarLoopResult]: For program point mc91EXIT(lines 8 12) no Hoare annotation was computed. [2019-11-28 02:50:03,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:50:03 BoogieIcfgContainer [2019-11-28 02:50:03,535 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:50:03,536 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:50:03,536 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:50:03,536 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:50:03,539 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:50:00" (3/4) ... [2019-11-28 02:50:03,544 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 02:50:03,556 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure mc91 [2019-11-28 02:50:03,570 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 02:50:03,571 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 02:50:03,634 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:50:03,634 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:50:03,638 INFO L168 Benchmark]: Toolchain (without parser) took 3606.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 960.4 MB in the beginning and 831.5 MB in the end (delta: 128.9 MB). Peak memory consumption was 246.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:03,642 INFO L168 Benchmark]: CDTParser took 0.56 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:50:03,643 INFO L168 Benchmark]: CACSL2BoogieTranslator took 228.79 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:03,648 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.86 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:50:03,649 INFO L168 Benchmark]: Boogie Preprocessor took 66.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -164.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:03,650 INFO L168 Benchmark]: RCFGBuilder took 231.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:03,650 INFO L168 Benchmark]: TraceAbstraction took 2945.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 838.2 MB in the end (delta: 257.4 MB). Peak memory consumption was 257.4 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:03,652 INFO L168 Benchmark]: Witness Printer took 99.08 ms. Allocated memory is still 1.1 GB. Free memory was 838.2 MB in the beginning and 831.5 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:03,658 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.56 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 228.79 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.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 28.86 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -164.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 231.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2945.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 838.2 MB in the end (delta: 257.4 MB). Peak memory consumption was 257.4 MB. Max. memory is 11.5 GB. * Witness Printer took 99.08 ms. Allocated memory is still 1.1 GB. Free memory was 838.2 MB in the beginning and 831.5 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 10]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 4 error locations. Result: SAFE, OverallTime: 2.4s, OverallIterations: 8, TraceHistogramMax: 7, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 125 SDtfs, 213 SDslu, 226 SDs, 0 SdLazy, 403 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 51 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 58 PreInvPairs, 58 NumberOfFragments, 83 HoareAnnotationTreeSize, 58 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 4 FomulaSimplificationsInter, 310 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 132 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 5895 SizeOfPredicates, 4 NumberOfNonLiveVariables, 39 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 94/102 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...