./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive/Ackermann01_true-unreach-call_true-no-overflow.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/Ackermann01_true-unreach-call_true-no-overflow.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 c2f1e635c5c806286d01eb0b8ff07448b8253a7a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:51:48,633 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:51:48,636 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:51:48,655 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:51:48,656 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:51:48,658 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:51:48,659 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:51:48,662 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:51:48,665 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:51:48,666 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:51:48,668 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:51:48,669 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:51:48,670 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:51:48,671 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:51:48,680 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:51:48,681 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:51:48,682 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:51:48,686 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:51:48,691 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:51:48,692 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:51:48,695 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:51:48,698 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:51:48,702 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:51:48,703 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:51:48,703 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:51:48,704 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:51:48,705 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:51:48,705 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:51:48,708 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:51:48,710 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:51:48,711 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:51:48,711 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:51:48,711 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:51:48,712 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:51:48,714 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:51:48,715 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:51:48,716 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:51:48,746 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:51:48,746 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:51:48,751 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:51:48,751 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:51:48,752 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:51:48,752 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:51:48,752 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:51:48,752 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:51:48,752 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:51:48,753 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:51:48,753 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:51:48,753 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:51:48,753 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:51:48,753 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:51:48,754 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:51:48,755 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:51:48,755 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:51:48,756 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:51:48,757 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:51:48,757 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:51:48,757 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:51:48,757 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:51:48,757 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:51:48,758 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:51:48,758 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:51:48,758 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:51:48,758 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:51:48,758 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:51:48,760 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 -> c2f1e635c5c806286d01eb0b8ff07448b8253a7a [2018-12-31 09:51:48,808 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:51:48,826 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:51:48,831 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:51:48,833 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:51:48,833 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:51:48,834 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive/Ackermann01_true-unreach-call_true-no-overflow.c [2018-12-31 09:51:48,895 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0b7218e1/3078294f614940f28284ef5b5d4b8dbb/FLAGec7d9ffb3 [2018-12-31 09:51:49,376 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:51:49,377 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive/Ackermann01_true-unreach-call_true-no-overflow.c [2018-12-31 09:51:49,383 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0b7218e1/3078294f614940f28284ef5b5d4b8dbb/FLAGec7d9ffb3 [2018-12-31 09:51:49,760 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0b7218e1/3078294f614940f28284ef5b5d4b8dbb [2018-12-31 09:51:49,765 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:51:49,767 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:51:49,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:51:49,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:51:49,774 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:51:49,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:51:49" (1/1) ... [2018-12-31 09:51:49,779 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36235c94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:49, skipping insertion in model container [2018-12-31 09:51:49,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:51:49" (1/1) ... [2018-12-31 09:51:49,789 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:51:49,809 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:51:50,008 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:51:50,015 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:51:50,044 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:51:50,062 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:51:50,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:50 WrapperNode [2018-12-31 09:51:50,062 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:51:50,063 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:51:50,063 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:51:50,064 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:51:50,074 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:51:50" (1/1) ... [2018-12-31 09:51:50,080 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:51:50" (1/1) ... [2018-12-31 09:51:50,107 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:51:50,108 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:51:50,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:51:50,109 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:51:50,118 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:50" (1/1) ... [2018-12-31 09:51:50,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:50" (1/1) ... [2018-12-31 09:51:50,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:50" (1/1) ... [2018-12-31 09:51:50,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:50" (1/1) ... [2018-12-31 09:51:50,122 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:50" (1/1) ... [2018-12-31 09:51:50,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:50" (1/1) ... [2018-12-31 09:51:50,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:50" (1/1) ... [2018-12-31 09:51:50,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:51:50,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:51:50,133 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:51:50,133 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:51:50,133 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:50" (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:51:50,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:51:50,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:51:50,271 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2018-12-31 09:51:50,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2018-12-31 09:51:50,589 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:51:50,589 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-31 09:51:50,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:51:50 BoogieIcfgContainer [2018-12-31 09:51:50,590 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:51:50,591 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:51:50,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:51:50,594 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:51:50,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:51:49" (1/3) ... [2018-12-31 09:51:50,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3195f370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:51:50, skipping insertion in model container [2018-12-31 09:51:50,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:50" (2/3) ... [2018-12-31 09:51:50,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3195f370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:51:50, skipping insertion in model container [2018-12-31 09:51:50,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:51:50" (3/3) ... [2018-12-31 09:51:50,598 INFO L112 eAbstractionObserver]: Analyzing ICFG Ackermann01_true-unreach-call_true-no-overflow.c [2018-12-31 09:51:50,621 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:51:50,629 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 09:51:50,645 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 09:51:50,675 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:51:50,676 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:51:50,676 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:51:50,676 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:51:50,676 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:51:50,677 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:51:50,677 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:51:50,677 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:51:50,677 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:51:50,696 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-12-31 09:51:50,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 09:51:50,703 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:50,705 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:51:50,707 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:50,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:50,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1260755674, now seen corresponding path program 1 times [2018-12-31 09:51:50,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:50,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:50,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:50,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:50,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:51,014 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:51:51,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:51:51,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 09:51:51,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 09:51:51,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 09:51:51,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:51:51,036 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 7 states. [2018-12-31 09:51:51,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:51,577 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2018-12-31 09:51:51,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 09:51:51,579 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-31 09:51:51,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:51,590 INFO L225 Difference]: With dead ends: 37 [2018-12-31 09:51:51,590 INFO L226 Difference]: Without dead ends: 21 [2018-12-31 09:51:51,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-31 09:51:51,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-31 09:51:51,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-31 09:51:51,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-31 09:51:51,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-12-31 09:51:51,640 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 11 [2018-12-31 09:51:51,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:51,641 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-12-31 09:51:51,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 09:51:51,641 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2018-12-31 09:51:51,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 09:51:51,644 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:51,644 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:51:51,644 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:51,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:51,645 INFO L82 PathProgramCache]: Analyzing trace with hash 963920485, now seen corresponding path program 1 times [2018-12-31 09:51:51,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:51,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:51,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:51,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:51,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:51,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 09:51:51,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:51:51,818 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:51:51,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:51,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:51:51,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 09:51:51,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:51:51,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-12-31 09:51:51,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 09:51:51,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 09:51:51,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:51:51,935 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand 8 states. [2018-12-31 09:51:52,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:52,340 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2018-12-31 09:51:52,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:51:52,341 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-12-31 09:51:52,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:52,342 INFO L225 Difference]: With dead ends: 28 [2018-12-31 09:51:52,343 INFO L226 Difference]: Without dead ends: 24 [2018-12-31 09:51:52,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 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:51:52,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-31 09:51:52,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-12-31 09:51:52,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-31 09:51:52,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2018-12-31 09:51:52,352 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 18 [2018-12-31 09:51:52,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:52,352 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-12-31 09:51:52,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 09:51:52,353 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2018-12-31 09:51:52,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-31 09:51:52,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:52,355 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:51:52,355 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:52,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:52,355 INFO L82 PathProgramCache]: Analyzing trace with hash -193744714, now seen corresponding path program 1 times [2018-12-31 09:51:52,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:52,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:52,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:52,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:52,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:52,432 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-31 09:51:52,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:51:52,433 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:51:52,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:52,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:51:52,563 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-31 09:51:52,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:51:52,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2018-12-31 09:51:52,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 09:51:52,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 09:51:52,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-31 09:51:52,586 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 10 states. [2018-12-31 09:51:52,733 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-12-31 09:51:53,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:53,284 INFO L93 Difference]: Finished difference Result 47 states and 74 transitions. [2018-12-31 09:51:53,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:51:53,288 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-12-31 09:51:53,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:53,290 INFO L225 Difference]: With dead ends: 47 [2018-12-31 09:51:53,290 INFO L226 Difference]: Without dead ends: 29 [2018-12-31 09:51:53,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-31 09:51:53,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-31 09:51:53,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-12-31 09:51:53,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-31 09:51:53,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2018-12-31 09:51:53,302 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 24 [2018-12-31 09:51:53,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:53,302 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2018-12-31 09:51:53,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 09:51:53,303 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2018-12-31 09:51:53,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:51:53,305 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:53,305 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:51:53,305 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:53,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:53,306 INFO L82 PathProgramCache]: Analyzing trace with hash 416247163, now seen corresponding path program 1 times [2018-12-31 09:51:53,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:53,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:53,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:53,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:53,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:53,559 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-31 09:51:53,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:51:53,559 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:51:53,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:53,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:51:53,619 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-31 09:51:53,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:51:53,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-12-31 09:51:53,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 09:51:53,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 09:51:53,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-12-31 09:51:53,646 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand 11 states. [2018-12-31 09:51:54,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:54,160 INFO L93 Difference]: Finished difference Result 38 states and 55 transitions. [2018-12-31 09:51:54,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 09:51:54,161 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-12-31 09:51:54,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:54,164 INFO L225 Difference]: With dead ends: 38 [2018-12-31 09:51:54,164 INFO L226 Difference]: Without dead ends: 34 [2018-12-31 09:51:54,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-12-31 09:51:54,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-31 09:51:54,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-12-31 09:51:54,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-31 09:51:54,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 49 transitions. [2018-12-31 09:51:54,178 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 49 transitions. Word has length 31 [2018-12-31 09:51:54,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:54,179 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 49 transitions. [2018-12-31 09:51:54,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 09:51:54,179 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 49 transitions. [2018-12-31 09:51:54,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-31 09:51:54,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:54,181 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:51:54,182 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:54,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:54,182 INFO L82 PathProgramCache]: Analyzing trace with hash -781004688, now seen corresponding path program 2 times [2018-12-31 09:51:54,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:54,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:54,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:54,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:54,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:54,476 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-31 09:51:54,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:51:54,477 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:51:54,493 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 09:51:54,521 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 09:51:54,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:51:54,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:51:54,540 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-31 09:51:54,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:51:54,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-12-31 09:51:54,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 09:51:54,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 09:51:54,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-12-31 09:51:54,566 INFO L87 Difference]: Start difference. First operand 32 states and 49 transitions. Second operand 12 states. [2018-12-31 09:51:54,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:54,893 INFO L93 Difference]: Finished difference Result 45 states and 71 transitions. [2018-12-31 09:51:54,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 09:51:54,895 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-12-31 09:51:54,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:54,897 INFO L225 Difference]: With dead ends: 45 [2018-12-31 09:51:54,897 INFO L226 Difference]: Without dead ends: 41 [2018-12-31 09:51:54,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-12-31 09:51:54,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-31 09:51:54,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2018-12-31 09:51:54,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-31 09:51:54,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-12-31 09:51:54,910 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 38 [2018-12-31 09:51:54,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:54,911 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-12-31 09:51:54,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 09:51:54,911 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-12-31 09:51:54,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-31 09:51:54,913 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:54,913 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:51:54,913 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:54,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:54,914 INFO L82 PathProgramCache]: Analyzing trace with hash 947442768, now seen corresponding path program 3 times [2018-12-31 09:51:54,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:54,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:54,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:54,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:51:54,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:55,079 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-31 09:51:55,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:51:55,080 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:51:55,098 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 09:51:55,119 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-31 09:51:55,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:51:55,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:51:55,133 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-31 09:51:55,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:51:55,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-12-31 09:51:55,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 09:51:55,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 09:51:55,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:51:55,154 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 9 states. [2018-12-31 09:51:55,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:55,460 INFO L93 Difference]: Finished difference Result 38 states and 54 transitions. [2018-12-31 09:51:55,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:51:55,461 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-12-31 09:51:55,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:55,462 INFO L225 Difference]: With dead ends: 38 [2018-12-31 09:51:55,463 INFO L226 Difference]: Without dead ends: 34 [2018-12-31 09:51:55,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-12-31 09:51:55,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-31 09:51:55,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-31 09:51:55,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-31 09:51:55,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 50 transitions. [2018-12-31 09:51:55,478 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 50 transitions. Word has length 38 [2018-12-31 09:51:55,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:55,479 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 50 transitions. [2018-12-31 09:51:55,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 09:51:55,479 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 50 transitions. [2018-12-31 09:51:55,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-31 09:51:55,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:55,482 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:51:55,482 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:55,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:55,482 INFO L82 PathProgramCache]: Analyzing trace with hash 96732912, now seen corresponding path program 4 times [2018-12-31 09:51:55,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:55,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:55,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:55,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:51:55,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:55,609 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 32 proven. 23 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-31 09:51:55,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:51:55,610 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:51:55,622 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-31 09:51:55,641 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-31 09:51:55,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:51:55,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:51:55,826 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 52 proven. 17 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-31 09:51:55,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:51:55,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-12-31 09:51:55,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-31 09:51:55,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-31 09:51:55,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-12-31 09:51:55,846 INFO L87 Difference]: Start difference. First operand 34 states and 50 transitions. Second operand 15 states. [2018-12-31 09:51:56,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:56,774 INFO L93 Difference]: Finished difference Result 92 states and 203 transitions. [2018-12-31 09:51:56,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 09:51:56,775 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2018-12-31 09:51:56,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:56,777 INFO L225 Difference]: With dead ends: 92 [2018-12-31 09:51:56,777 INFO L226 Difference]: Without dead ends: 62 [2018-12-31 09:51:56,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=541, Unknown=0, NotChecked=0, Total=702 [2018-12-31 09:51:56,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-31 09:51:56,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2018-12-31 09:51:56,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-31 09:51:56,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 107 transitions. [2018-12-31 09:51:56,797 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 107 transitions. Word has length 51 [2018-12-31 09:51:56,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:56,797 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 107 transitions. [2018-12-31 09:51:56,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-31 09:51:56,797 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 107 transitions. [2018-12-31 09:51:56,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-31 09:51:56,800 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:56,801 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:51:56,801 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:56,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:56,801 INFO L82 PathProgramCache]: Analyzing trace with hash -191844027, now seen corresponding path program 5 times [2018-12-31 09:51:56,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:56,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:56,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:56,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:51:56,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:57,171 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 63 proven. 81 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-31 09:51:57,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:51:57,171 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:51:57,191 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-31 09:51:57,292 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-12-31 09:51:57,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:51:57,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:51:57,506 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 97 proven. 37 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-12-31 09:51:57,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:51:57,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2018-12-31 09:51:57,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-31 09:51:57,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-31 09:51:57,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-12-31 09:51:57,526 INFO L87 Difference]: Start difference. First operand 59 states and 107 transitions. Second operand 20 states. [2018-12-31 09:51:58,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:58,452 INFO L93 Difference]: Finished difference Result 91 states and 177 transitions. [2018-12-31 09:51:58,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-31 09:51:58,453 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 71 [2018-12-31 09:51:58,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:58,455 INFO L225 Difference]: With dead ends: 91 [2018-12-31 09:51:58,455 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 09:51:58,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=303, Invalid=1103, Unknown=0, NotChecked=0, Total=1406 [2018-12-31 09:51:58,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 09:51:58,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 09:51:58,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 09:51:58,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 09:51:58,458 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2018-12-31 09:51:58,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:58,459 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 09:51:58,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-31 09:51:58,459 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 09:51:58,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 09:51:58,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 09:51:58,852 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2018-12-31 09:51:59,056 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2018-12-31 09:51:59,271 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 14 [2018-12-31 09:51:59,275 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 09:51:59,276 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 09:51:59,276 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 09:51:59,276 INFO L448 ceAbstractionStarter]: For program point L28(lines 28 32) no Hoare annotation was computed. [2018-12-31 09:51:59,276 INFO L451 ceAbstractionStarter]: At program point L26(lines 26 46) the Hoare annotation is: true [2018-12-31 09:51:59,276 INFO L448 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2018-12-31 09:51:59,276 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 45) no Hoare annotation was computed. [2018-12-31 09:51:59,277 INFO L444 ceAbstractionStarter]: At program point L40(line 40) the Hoare annotation is: (<= 0 ULTIMATE.start_main_~n~0) [2018-12-31 09:51:59,277 INFO L448 ceAbstractionStarter]: For program point L40-1(line 40) no Hoare annotation was computed. [2018-12-31 09:51:59,277 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2018-12-31 09:51:59,277 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 39) no Hoare annotation was computed. [2018-12-31 09:51:59,277 INFO L448 ceAbstractionStarter]: For program point ackermannEXIT(lines 15 23) no Hoare annotation was computed. [2018-12-31 09:51:59,277 INFO L444 ceAbstractionStarter]: At program point L22(line 22) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (<= |ackermann_#in~n| ackermann_~n) (or (< |ackermann_#in~m| 0) (< 0 |ackermann_#in~m|))) [2018-12-31 09:51:59,278 INFO L451 ceAbstractionStarter]: At program point ackermannENTRY(lines 15 23) the Hoare annotation is: true [2018-12-31 09:51:59,278 INFO L448 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2018-12-31 09:51:59,278 INFO L444 ceAbstractionStarter]: At program point L20(line 20) the Hoare annotation is: (and (<= |ackermann_#in~n| 0) (= ackermann_~m |ackermann_#in~m|) (<= |ackermann_#in~n| ackermann_~n) (or (< |ackermann_#in~m| 0) (< 0 |ackermann_#in~m|))) [2018-12-31 09:51:59,278 INFO L444 ceAbstractionStarter]: At program point L22-2(line 22) the Hoare annotation is: (and (< 0 |ackermann_#in~m|) (let ((.cse0 (= ackermann_~m |ackermann_#in~m|)) (.cse1 (<= |ackermann_#in~n| ackermann_~n))) (or (and (<= 3 |ackermann_#t~ret1|) .cse0 .cse1) (and .cse0 .cse1 (<= |ackermann_#in~m| 1) (<= 2 |ackermann_#t~ret1|))))) [2018-12-31 09:51:59,278 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 21) no Hoare annotation was computed. [2018-12-31 09:51:59,278 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-12-31 09:51:59,278 INFO L448 ceAbstractionStarter]: For program point L22-3(line 22) no Hoare annotation was computed. [2018-12-31 09:51:59,278 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 18) no Hoare annotation was computed. [2018-12-31 09:51:59,278 INFO L448 ceAbstractionStarter]: For program point ackermannFINAL(lines 15 23) no Hoare annotation was computed. [2018-12-31 09:51:59,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:51:59 BoogieIcfgContainer [2018-12-31 09:51:59,286 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:51:59,287 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:51:59,287 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:51:59,287 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:51:59,287 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:51:50" (3/4) ... [2018-12-31 09:51:59,291 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 09:51:59,298 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ackermann [2018-12-31 09:51:59,302 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-31 09:51:59,302 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-31 09:51:59,352 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:51:59,352 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:51:59,353 INFO L168 Benchmark]: Toolchain (without parser) took 9587.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Free memory was 950.0 MB in the beginning and 886.6 MB in the end (delta: 63.5 MB). Peak memory consumption was 264.3 MB. Max. memory is 11.5 GB. [2018-12-31 09:51:59,355 INFO L168 Benchmark]: CDTParser took 0.15 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:51:59,355 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.85 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 937.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-12-31 09:51:59,356 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.12 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:51:59,356 INFO L168 Benchmark]: Boogie Preprocessor took 22.98 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:51:59,357 INFO L168 Benchmark]: RCFGBuilder took 457.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -172.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-12-31 09:51:59,358 INFO L168 Benchmark]: TraceAbstraction took 8695.34 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 894.0 MB in the end (delta: 216.0 MB). Peak memory consumption was 282.6 MB. Max. memory is 11.5 GB. [2018-12-31 09:51:59,359 INFO L168 Benchmark]: Witness Printer took 65.97 ms. Allocated memory is still 1.2 GB. Free memory was 894.0 MB in the beginning and 886.6 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. [2018-12-31 09:51:59,364 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.15 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 294.85 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 937.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.12 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.98 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 457.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -172.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8695.34 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 894.0 MB in the end (delta: 216.0 MB). Peak memory consumption was 282.6 MB. Max. memory is 11.5 GB. * Witness Printer took 65.97 ms. Allocated memory is still 1.2 GB. Free memory was 894.0 MB in the beginning and 886.6 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: 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: 26]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 1 error locations. SAFE Result, 8.6s OverallTime, 8 OverallIterations, 10 TraceHistogramMax, 4.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 132 SDtfs, 206 SDslu, 588 SDs, 0 SdLazy, 1434 SolverSat, 272 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 416 GetRequests, 280 SyntacticMatches, 1 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 23 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 86 PreInvPairs, 110 NumberOfFragments, 69 HoareAnnotationTreeSize, 86 FomulaSimplifications, 555 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 432 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 553 NumberOfCodeBlocks, 510 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 538 ConstructedInterpolants, 0 QuantifiedInterpolants, 46704 SizeOfPredicates, 25 NumberOfNonLiveVariables, 698 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 15 InterpolantComputations, 1 PerfectInterpolantSequences, 664/880 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...