./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive/gcd01_true-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/recursive/gcd01_true-unreach-call_true-no-overflow_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0497b69437c9ebb889888bdb31aaefcc8eaad029 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 09:52:02,029 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:52:02,031 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:52:02,045 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:52:02,046 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:52:02,047 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:52:02,048 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:52:02,052 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:52:02,054 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:52:02,058 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:52:02,061 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:52:02,062 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:52:02,064 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:52:02,067 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:52:02,072 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:52:02,074 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:52:02,077 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:52:02,081 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:52:02,083 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:52:02,088 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:52:02,093 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:52:02,095 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:52:02,099 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:52:02,102 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:52:02,102 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:52:02,103 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:52:02,104 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:52:02,109 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:52:02,110 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:52:02,112 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:52:02,115 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:52:02,116 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:52:02,116 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:52:02,116 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:52:02,117 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:52:02,120 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:52:02,122 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 09:52:02,151 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:52:02,153 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:52:02,154 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:52:02,154 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:52:02,158 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:52:02,158 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:52:02,158 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:52:02,159 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:52:02,159 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:52:02,159 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:52:02,159 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:52:02,159 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:52:02,159 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:52:02,161 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:52:02,161 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:52:02,161 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:52:02,162 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:52:02,162 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:52:02,162 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:52:02,162 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:52:02,165 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:52:02,165 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:52:02,166 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:52:02,166 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:52:02,166 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:52:02,166 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:52:02,166 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:52:02,167 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:52:02,167 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 ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0497b69437c9ebb889888bdb31aaefcc8eaad029 [2018-12-31 09:52:02,212 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:52:02,227 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:52:02,233 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:52:02,234 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:52:02,235 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:52:02,236 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive/gcd01_true-unreach-call_true-no-overflow_true-termination.c [2018-12-31 09:52:02,302 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07ca30526/8d9a2a52cd354701aeeb1f34ae6cfc0c/FLAG125c113e6 [2018-12-31 09:52:02,811 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:52:02,811 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive/gcd01_true-unreach-call_true-no-overflow_true-termination.c [2018-12-31 09:52:02,817 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07ca30526/8d9a2a52cd354701aeeb1f34ae6cfc0c/FLAG125c113e6 [2018-12-31 09:52:03,308 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07ca30526/8d9a2a52cd354701aeeb1f34ae6cfc0c [2018-12-31 09:52:03,312 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:52:03,313 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:52:03,314 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:52:03,314 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:52:03,318 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:52:03,319 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:52:03" (1/1) ... [2018-12-31 09:52:03,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ffe7129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:52:03, skipping insertion in model container [2018-12-31 09:52:03,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:52:03" (1/1) ... [2018-12-31 09:52:03,330 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:52:03,346 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:52:03,584 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:52:03,593 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:52:03,619 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:52:03,641 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:52:03,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:52:03 WrapperNode [2018-12-31 09:52:03,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:52:03,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:52:03,643 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:52:03,643 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:52:03,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:52:03" (1/1) ... [2018-12-31 09:52:03,664 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:52:03" (1/1) ... [2018-12-31 09:52:03,694 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:52:03,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:52:03,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:52:03,694 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:52:03,703 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:52:03" (1/1) ... [2018-12-31 09:52:03,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:52:03" (1/1) ... [2018-12-31 09:52:03,704 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:52:03" (1/1) ... [2018-12-31 09:52:03,705 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:52:03" (1/1) ... [2018-12-31 09:52:03,707 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:52:03" (1/1) ... [2018-12-31 09:52:03,710 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:52:03" (1/1) ... [2018-12-31 09:52:03,711 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:52:03" (1/1) ... [2018-12-31 09:52:03,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:52:03,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:52:03,713 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:52:03,713 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:52:03,714 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:52:03" (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 [2018-12-31 09:52:03,841 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2018-12-31 09:52:03,841 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2018-12-31 09:52:03,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:52:03,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:52:04,189 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:52:04,189 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-31 09:52:04,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:52:04 BoogieIcfgContainer [2018-12-31 09:52:04,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:52:04,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:52:04,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:52:04,193 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:52:04,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:52:03" (1/3) ... [2018-12-31 09:52:04,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32861ba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:52:04, skipping insertion in model container [2018-12-31 09:52:04,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:52:03" (2/3) ... [2018-12-31 09:52:04,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32861ba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:52:04, skipping insertion in model container [2018-12-31 09:52:04,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:52:04" (3/3) ... [2018-12-31 09:52:04,197 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd01_true-unreach-call_true-no-overflow_true-termination.c [2018-12-31 09:52:04,205 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:52:04,212 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 09:52:04,228 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 09:52:04,261 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:52:04,262 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:52:04,262 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:52:04,262 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:52:04,263 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:52:04,263 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:52:04,263 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:52:04,263 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:52:04,263 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:52:04,283 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-12-31 09:52:04,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 09:52:04,290 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:52:04,291 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:52:04,294 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:52:04,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:52:04,301 INFO L82 PathProgramCache]: Analyzing trace with hash -540428153, now seen corresponding path program 1 times [2018-12-31 09:52:04,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:52:04,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:52:04,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:04,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:52:04,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:52:04,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:52:04,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:52:04,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 09:52:04,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:52:04,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:52:04,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:52:04,632 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 6 states. [2018-12-31 09:52:04,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:52:04,918 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-12-31 09:52:04,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:52:04,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-12-31 09:52:04,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:52:04,932 INFO L225 Difference]: With dead ends: 36 [2018-12-31 09:52:04,932 INFO L226 Difference]: Without dead ends: 20 [2018-12-31 09:52:04,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:52:04,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-31 09:52:04,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-31 09:52:04,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-31 09:52:04,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2018-12-31 09:52:04,986 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 11 [2018-12-31 09:52:04,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:52:04,987 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-12-31 09:52:04,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:52:04,987 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2018-12-31 09:52:04,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-31 09:52:04,990 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:52:04,990 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:52:04,990 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:52:04,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:52:04,991 INFO L82 PathProgramCache]: Analyzing trace with hash 999682999, now seen corresponding path program 1 times [2018-12-31 09:52:04,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:52:04,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:52:04,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:04,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:52:04,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:52:05,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:52:05,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:52:05,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 09:52:05,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:52:05,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:52:05,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:52:05,244 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand 6 states. [2018-12-31 09:52:05,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:52:05,341 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2018-12-31 09:52:05,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:52:05,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-12-31 09:52:05,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:52:05,344 INFO L225 Difference]: With dead ends: 26 [2018-12-31 09:52:05,344 INFO L226 Difference]: Without dead ends: 22 [2018-12-31 09:52:05,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:52:05,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-31 09:52:05,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-12-31 09:52:05,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-31 09:52:05,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2018-12-31 09:52:05,352 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 12 [2018-12-31 09:52:05,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:52:05,353 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-12-31 09:52:05,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:52:05,353 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2018-12-31 09:52:05,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 09:52:05,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:52:05,355 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:52:05,355 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:52:05,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:52:05,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1243478463, now seen corresponding path program 1 times [2018-12-31 09:52:05,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:52:05,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:52:05,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:05,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:52:05,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:52:05,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 09:52:05,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:52:05,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 09:52:05,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 09:52:05,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 09:52:05,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:52:05,513 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand 8 states. [2018-12-31 09:52:05,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:52:05,850 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2018-12-31 09:52:05,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 09:52:05,852 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-12-31 09:52:05,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:52:05,853 INFO L225 Difference]: With dead ends: 31 [2018-12-31 09:52:05,854 INFO L226 Difference]: Without dead ends: 27 [2018-12-31 09:52:05,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-12-31 09:52:05,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-31 09:52:05,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2018-12-31 09:52:05,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-31 09:52:05,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-12-31 09:52:05,864 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 19 [2018-12-31 09:52:05,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:52:05,865 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-12-31 09:52:05,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 09:52:05,865 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2018-12-31 09:52:05,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 09:52:05,866 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:52:05,866 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:52:05,867 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:52:05,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:52:05,867 INFO L82 PathProgramCache]: Analyzing trace with hash -102281283, now seen corresponding path program 1 times [2018-12-31 09:52:05,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:52:05,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:52:05,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:05,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:52:05,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:05,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:52:06,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 09:52:06,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:52:06,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 09:52:06,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 09:52:06,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 09:52:06,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:52:06,370 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand 7 states. [2018-12-31 09:52:06,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:52:06,573 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2018-12-31 09:52:06,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 09:52:06,574 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-12-31 09:52:06,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:52:06,575 INFO L225 Difference]: With dead ends: 35 [2018-12-31 09:52:06,575 INFO L226 Difference]: Without dead ends: 27 [2018-12-31 09:52:06,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-31 09:52:06,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-31 09:52:06,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-12-31 09:52:06,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-31 09:52:06,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2018-12-31 09:52:06,587 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 19 [2018-12-31 09:52:06,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:52:06,588 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-12-31 09:52:06,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 09:52:06,588 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2018-12-31 09:52:06,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-31 09:52:06,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:52:06,590 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:52:06,591 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:52:06,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:52:06,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1914749337, now seen corresponding path program 1 times [2018-12-31 09:52:06,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:52:06,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:52:06,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:06,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:52:06,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:52:06,678 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-31 09:52:06,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:52:06,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 09:52:06,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 09:52:06,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 09:52:06,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:52:06,681 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand 7 states. [2018-12-31 09:52:06,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:52:06,815 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2018-12-31 09:52:06,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 09:52:06,817 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-12-31 09:52:06,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:52:06,818 INFO L225 Difference]: With dead ends: 32 [2018-12-31 09:52:06,819 INFO L226 Difference]: Without dead ends: 28 [2018-12-31 09:52:06,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:52:06,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-31 09:52:06,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2018-12-31 09:52:06,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-31 09:52:06,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2018-12-31 09:52:06,826 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 20 [2018-12-31 09:52:06,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:52:06,827 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-12-31 09:52:06,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 09:52:06,827 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2018-12-31 09:52:06,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-31 09:52:06,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:52:06,828 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:52:06,828 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:52:06,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:52:06,829 INFO L82 PathProgramCache]: Analyzing trace with hash -675898105, now seen corresponding path program 1 times [2018-12-31 09:52:06,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:52:06,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:52:06,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:06,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:52:06,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:52:06,906 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-31 09:52:06,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:52:06,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 09:52:06,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 09:52:06,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 09:52:06,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:52:06,908 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand 7 states. [2018-12-31 09:52:07,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:52:07,046 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2018-12-31 09:52:07,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 09:52:07,047 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-12-31 09:52:07,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:52:07,049 INFO L225 Difference]: With dead ends: 32 [2018-12-31 09:52:07,050 INFO L226 Difference]: Without dead ends: 28 [2018-12-31 09:52:07,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:52:07,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-31 09:52:07,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-31 09:52:07,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 09:52:07,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2018-12-31 09:52:07,057 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 20 [2018-12-31 09:52:07,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:52:07,057 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-12-31 09:52:07,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 09:52:07,058 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2018-12-31 09:52:07,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-31 09:52:07,059 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:52:07,059 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:52:07,059 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:52:07,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:52:07,060 INFO L82 PathProgramCache]: Analyzing trace with hash -482715817, now seen corresponding path program 1 times [2018-12-31 09:52:07,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:52:07,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:52:07,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:07,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:52:07,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:07,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:52:07,197 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-31 09:52:07,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:52:07,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 09:52:07,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 09:52:07,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 09:52:07,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:52:07,199 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 8 states. [2018-12-31 09:52:07,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:52:07,307 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2018-12-31 09:52:07,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:52:07,308 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-12-31 09:52:07,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:52:07,309 INFO L225 Difference]: With dead ends: 39 [2018-12-31 09:52:07,309 INFO L226 Difference]: Without dead ends: 23 [2018-12-31 09:52:07,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-12-31 09:52:07,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-31 09:52:07,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-31 09:52:07,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-31 09:52:07,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-12-31 09:52:07,317 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 28 [2018-12-31 09:52:07,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:52:07,317 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-12-31 09:52:07,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 09:52:07,317 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-12-31 09:52:07,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-31 09:52:07,320 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:52:07,320 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:52:07,320 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:52:07,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:52:07,321 INFO L82 PathProgramCache]: Analyzing trace with hash 176898181, now seen corresponding path program 1 times [2018-12-31 09:52:07,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:52:07,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:52:07,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:07,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:52:07,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:52:07,435 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-31 09:52:07,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:52:07,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 09:52:07,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:52:07,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:52:07,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:52:07,437 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2018-12-31 09:52:07,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:52:07,536 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2018-12-31 09:52:07,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:52:07,537 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-12-31 09:52:07,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:52:07,538 INFO L225 Difference]: With dead ends: 23 [2018-12-31 09:52:07,538 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 09:52:07,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:52:07,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 09:52:07,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 09:52:07,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 09:52:07,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 09:52:07,540 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-12-31 09:52:07,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:52:07,540 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 09:52:07,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:52:07,541 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 09:52:07,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 09:52:07,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 09:52:07,653 INFO L448 ceAbstractionStarter]: For program point gcdFINAL(lines 15 26) no Hoare annotation was computed. [2018-12-31 09:52:07,654 INFO L448 ceAbstractionStarter]: For program point gcdEXIT(lines 15 26) no Hoare annotation was computed. [2018-12-31 09:52:07,654 INFO L444 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (and (= gcd_~y2 |gcd_#in~y2|) (<= 1 gcd_~y1) (<= (+ gcd_~y1 1) gcd_~y2) (<= |gcd_#in~y1| gcd_~y1)) [2018-12-31 09:52:07,654 INFO L448 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2018-12-31 09:52:07,654 INFO L451 ceAbstractionStarter]: At program point gcdENTRY(lines 15 26) the Hoare annotation is: true [2018-12-31 09:52:07,655 INFO L444 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (and (<= 1 gcd_~y2) (= gcd_~y2 |gcd_#in~y2|) (<= (+ gcd_~y2 1) gcd_~y1) (<= |gcd_#in~y1| gcd_~y1)) [2018-12-31 09:52:07,655 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 24) no Hoare annotation was computed. [2018-12-31 09:52:07,655 INFO L448 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-12-31 09:52:07,655 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 21) no Hoare annotation was computed. [2018-12-31 09:52:07,655 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 18) no Hoare annotation was computed. [2018-12-31 09:52:07,655 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 09:52:07,656 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 32) no Hoare annotation was computed. [2018-12-31 09:52:07,658 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 09:52:07,658 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 09:52:07,658 INFO L451 ceAbstractionStarter]: At program point L41(lines 28 43) the Hoare annotation is: true [2018-12-31 09:52:07,658 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-12-31 09:52:07,658 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 42) no Hoare annotation was computed. [2018-12-31 09:52:07,659 INFO L444 ceAbstractionStarter]: At program point L37(line 37) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~m~0) (<= 1 ULTIMATE.start_main_~n~0)) [2018-12-31 09:52:07,659 INFO L448 ceAbstractionStarter]: For program point L37-1(line 37) no Hoare annotation was computed. [2018-12-31 09:52:07,659 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2018-12-31 09:52:07,659 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 36) no Hoare annotation was computed. [2018-12-31 09:52:07,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:52:07 BoogieIcfgContainer [2018-12-31 09:52:07,668 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:52:07,668 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:52:07,668 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:52:07,669 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:52:07,669 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:52:04" (3/4) ... [2018-12-31 09:52:07,674 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 09:52:07,682 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure gcd [2018-12-31 09:52:07,688 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-31 09:52:07,688 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-31 09:52:07,744 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:52:07,745 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:52:07,746 INFO L168 Benchmark]: Toolchain (without parser) took 4433.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 954.0 MB in the beginning and 945.5 MB in the end (delta: 8.5 MB). Peak memory consumption was 149.6 MB. Max. memory is 11.5 GB. [2018-12-31 09:52:07,748 INFO L168 Benchmark]: CDTParser took 0.65 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. [2018-12-31 09:52:07,749 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.79 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 943.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 09:52:07,749 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.30 ms. Allocated memory is still 1.0 GB. Free memory is still 943.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:52:07,751 INFO L168 Benchmark]: Boogie Preprocessor took 18.13 ms. Allocated memory is still 1.0 GB. Free memory is still 943.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:52:07,751 INFO L168 Benchmark]: RCFGBuilder took 477.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -174.9 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2018-12-31 09:52:07,752 INFO L168 Benchmark]: TraceAbstraction took 3477.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 952.1 MB in the end (delta: 166.1 MB). Peak memory consumption was 166.1 MB. Max. memory is 11.5 GB. [2018-12-31 09:52:07,753 INFO L168 Benchmark]: Witness Printer took 76.47 ms. Allocated memory is still 1.2 GB. Free memory was 952.1 MB in the beginning and 945.5 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-12-31 09:52:07,758 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.65 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 327.79 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 943.3 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 51.30 ms. Allocated memory is still 1.0 GB. Free memory is still 943.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.13 ms. Allocated memory is still 1.0 GB. Free memory is still 943.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 477.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -174.9 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3477.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 952.1 MB in the end (delta: 166.1 MB). Peak memory consumption was 166.1 MB. Max. memory is 11.5 GB. * Witness Printer took 76.47 ms. Allocated memory is still 1.2 GB. Free memory was 952.1 MB in the beginning and 945.5 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 1 error locations. SAFE Result, 3.4s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 132 SDtfs, 116 SDslu, 414 SDs, 0 SdLazy, 336 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 11 PreInvPairs, 14 NumberOfFragments, 39 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 16 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 6698 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 48/48 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...