java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/HOLA/13.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 00:56:59,852 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 00:56:59,854 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 00:56:59,867 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 00:56:59,867 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 00:56:59,868 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 00:56:59,872 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 00:56:59,874 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 00:56:59,876 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 00:56:59,876 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 00:56:59,879 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 00:56:59,879 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 00:56:59,880 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 00:56:59,881 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 00:56:59,884 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 00:56:59,885 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 00:56:59,886 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 00:56:59,898 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 00:56:59,900 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 00:56:59,901 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 00:56:59,902 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 00:56:59,904 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 00:56:59,908 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 00:56:59,908 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 00:56:59,909 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 00:56:59,910 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 00:56:59,910 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 00:56:59,911 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 00:56:59,912 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 00:56:59,912 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 00:56:59,917 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 00:56:59,918 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 00:56:59,918 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 00:56:59,919 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 00:56:59,919 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 00:56:59,920 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 00:56:59,933 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 00:56:59,933 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 00:56:59,934 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 00:56:59,934 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 00:56:59,935 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 00:56:59,935 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 00:56:59,935 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 00:56:59,935 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 00:56:59,936 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 00:56:59,936 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 00:56:59,936 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 00:56:59,936 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 00:56:59,936 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 00:56:59,937 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 00:56:59,940 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 00:56:59,940 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 00:56:59,941 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 00:56:59,942 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 00:56:59,942 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 00:56:59,990 INFO ]: Repository-Root is: /tmp [2018-06-22 00:57:00,008 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 00:57:00,013 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 00:57:00,014 INFO ]: Initializing SmtParser... [2018-06-22 00:57:00,015 INFO ]: SmtParser initialized [2018-06-22 00:57:00,015 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/13.c.smt2 [2018-06-22 00:57:00,016 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 00:57:00,101 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/13.c.smt2 unknown [2018-06-22 00:57:00,518 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/13.c.smt2 [2018-06-22 00:57:00,526 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 00:57:00,531 INFO ]: Walking toolchain with 4 elements. [2018-06-22 00:57:00,531 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 00:57:00,532 INFO ]: Initializing ChcToBoogie... [2018-06-22 00:57:00,532 INFO ]: ChcToBoogie initialized [2018-06-22 00:57:00,536 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:57:00" (1/1) ... [2018-06-22 00:57:00,625 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:57:00 Unit [2018-06-22 00:57:00,626 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 00:57:00,627 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 00:57:00,627 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 00:57:00,627 INFO ]: Boogie Preprocessor initialized [2018-06-22 00:57:00,647 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:57:00" (1/1) ... [2018-06-22 00:57:00,647 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:57:00" (1/1) ... [2018-06-22 00:57:00,656 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:57:00" (1/1) ... [2018-06-22 00:57:00,657 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:57:00" (1/1) ... [2018-06-22 00:57:00,661 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:57:00" (1/1) ... [2018-06-22 00:57:00,663 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:57:00" (1/1) ... [2018-06-22 00:57:00,667 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:57:00" (1/1) ... [2018-06-22 00:57:00,670 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 00:57:00,670 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 00:57:00,670 INFO ]: Initializing RCFGBuilder... [2018-06-22 00:57:00,671 INFO ]: RCFGBuilder initialized [2018-06-22 00:57:00,671 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:57:00" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 00:57:00,698 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 00:57:00,699 INFO ]: Found specification of procedure gotoProc [2018-06-22 00:57:00,699 INFO ]: Found implementation of procedure gotoProc [2018-06-22 00:57:00,699 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 00:57:00,699 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 00:57:00,699 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 00:57:01,239 INFO ]: Using library mode [2018-06-22 00:57:01,239 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:57:01 BoogieIcfgContainer [2018-06-22 00:57:01,239 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 00:57:01,241 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 00:57:01,241 INFO ]: Initializing TraceAbstraction... [2018-06-22 00:57:01,244 INFO ]: TraceAbstraction initialized [2018-06-22 00:57:01,244 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:57:00" (1/3) ... [2018-06-22 00:57:01,245 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d2375f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 12:57:01, skipping insertion in model container [2018-06-22 00:57:01,245 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:57:00" (2/3) ... [2018-06-22 00:57:01,245 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d2375f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 12:57:01, skipping insertion in model container [2018-06-22 00:57:01,245 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:57:01" (3/3) ... [2018-06-22 00:57:01,247 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 00:57:01,256 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 00:57:01,264 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 00:57:01,300 INFO ]: Using default assertion order modulation [2018-06-22 00:57:01,300 INFO ]: Interprodecural is true [2018-06-22 00:57:01,300 INFO ]: Hoare is false [2018-06-22 00:57:01,300 INFO ]: Compute interpolants for FPandBP [2018-06-22 00:57:01,301 INFO ]: Backedges is TWOTRACK [2018-06-22 00:57:01,301 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 00:57:01,301 INFO ]: Difference is false [2018-06-22 00:57:01,301 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 00:57:01,301 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 00:57:01,314 INFO ]: Start isEmpty. Operand 34 states. [2018-06-22 00:57:01,324 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 00:57:01,324 INFO ]: Found error trace [2018-06-22 00:57:01,325 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:01,325 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:01,329 INFO ]: Analyzing trace with hash -2007747266, now seen corresponding path program 1 times [2018-06-22 00:57:01,331 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:01,332 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:01,364 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:01,364 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:01,364 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:01,465 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:02,189 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:02,196 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:57:02,196 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 00:57:02,198 INFO ]: Interpolant automaton has 13 states [2018-06-22 00:57:02,213 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 00:57:02,213 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 00:57:02,216 INFO ]: Start difference. First operand 34 states. Second operand 13 states. [2018-06-22 00:57:02,788 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:02,789 INFO ]: Finished difference Result 50 states and 58 transitions. [2018-06-22 00:57:02,791 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 00:57:02,792 INFO ]: Start accepts. Automaton has 13 states. Word has length 21 [2018-06-22 00:57:02,792 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:02,799 INFO ]: With dead ends: 50 [2018-06-22 00:57:02,799 INFO ]: Without dead ends: 47 [2018-06-22 00:57:02,802 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=201, Invalid=449, Unknown=0, NotChecked=0, Total=650 [2018-06-22 00:57:02,817 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 00:57:02,834 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 36. [2018-06-22 00:57:02,836 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 00:57:02,837 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-06-22 00:57:02,838 INFO ]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 21 [2018-06-22 00:57:02,838 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:02,838 INFO ]: Abstraction has 36 states and 42 transitions. [2018-06-22 00:57:02,838 INFO ]: Interpolant automaton has 13 states. [2018-06-22 00:57:02,838 INFO ]: Start isEmpty. Operand 36 states and 42 transitions. [2018-06-22 00:57:02,839 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 00:57:02,839 INFO ]: Found error trace [2018-06-22 00:57:02,839 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:02,839 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:02,839 INFO ]: Analyzing trace with hash -266914576, now seen corresponding path program 1 times [2018-06-22 00:57:02,840 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:02,840 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:02,840 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:02,840 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:02,840 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:02,877 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:03,098 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:03,098 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:57:03,098 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 00:57:03,099 INFO ]: Interpolant automaton has 10 states [2018-06-22 00:57:03,099 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 00:57:03,099 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 00:57:03,099 INFO ]: Start difference. First operand 36 states and 42 transitions. Second operand 10 states. [2018-06-22 00:57:03,609 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:03,609 INFO ]: Finished difference Result 118 states and 140 transitions. [2018-06-22 00:57:03,609 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 00:57:03,609 INFO ]: Start accepts. Automaton has 10 states. Word has length 29 [2018-06-22 00:57:03,609 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:03,615 INFO ]: With dead ends: 118 [2018-06-22 00:57:03,615 INFO ]: Without dead ends: 117 [2018-06-22 00:57:03,616 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2018-06-22 00:57:03,616 INFO ]: Start minimizeSevpa. Operand 117 states. [2018-06-22 00:57:03,625 INFO ]: Finished minimizeSevpa. Reduced states from 117 to 39. [2018-06-22 00:57:03,625 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 00:57:03,626 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-06-22 00:57:03,626 INFO ]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 29 [2018-06-22 00:57:03,626 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:03,626 INFO ]: Abstraction has 39 states and 46 transitions. [2018-06-22 00:57:03,626 INFO ]: Interpolant automaton has 10 states. [2018-06-22 00:57:03,626 INFO ]: Start isEmpty. Operand 39 states and 46 transitions. [2018-06-22 00:57:03,627 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 00:57:03,627 INFO ]: Found error trace [2018-06-22 00:57:03,627 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:03,627 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:03,627 INFO ]: Analyzing trace with hash -595555152, now seen corresponding path program 1 times [2018-06-22 00:57:03,627 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:03,627 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:03,628 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:03,628 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:03,628 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:03,659 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:03,761 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:03,761 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:57:03,761 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 00:57:03,761 INFO ]: Interpolant automaton has 10 states [2018-06-22 00:57:03,762 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 00:57:03,762 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 00:57:03,762 INFO ]: Start difference. First operand 39 states and 46 transitions. Second operand 10 states. [2018-06-22 00:57:04,021 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:04,022 INFO ]: Finished difference Result 70 states and 81 transitions. [2018-06-22 00:57:04,023 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 00:57:04,023 INFO ]: Start accepts. Automaton has 10 states. Word has length 29 [2018-06-22 00:57:04,023 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:04,024 INFO ]: With dead ends: 70 [2018-06-22 00:57:04,024 INFO ]: Without dead ends: 67 [2018-06-22 00:57:04,025 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2018-06-22 00:57:04,025 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-22 00:57:04,028 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 37. [2018-06-22 00:57:04,028 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 00:57:04,029 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2018-06-22 00:57:04,029 INFO ]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 29 [2018-06-22 00:57:04,029 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:04,029 INFO ]: Abstraction has 37 states and 43 transitions. [2018-06-22 00:57:04,029 INFO ]: Interpolant automaton has 10 states. [2018-06-22 00:57:04,029 INFO ]: Start isEmpty. Operand 37 states and 43 transitions. [2018-06-22 00:57:04,030 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 00:57:04,030 INFO ]: Found error trace [2018-06-22 00:57:04,030 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:04,030 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:04,030 INFO ]: Analyzing trace with hash 976452838, now seen corresponding path program 1 times [2018-06-22 00:57:04,030 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:04,030 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:04,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:04,031 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:04,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:04,075 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:04,351 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:04,351 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:57:04,352 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 00:57:04,352 INFO ]: Interpolant automaton has 10 states [2018-06-22 00:57:04,352 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 00:57:04,352 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 00:57:04,352 INFO ]: Start difference. First operand 37 states and 43 transitions. Second operand 10 states. [2018-06-22 00:57:04,573 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:04,573 INFO ]: Finished difference Result 96 states and 113 transitions. [2018-06-22 00:57:04,574 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 00:57:04,574 INFO ]: Start accepts. Automaton has 10 states. Word has length 29 [2018-06-22 00:57:04,574 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:04,575 INFO ]: With dead ends: 96 [2018-06-22 00:57:04,575 INFO ]: Without dead ends: 95 [2018-06-22 00:57:04,575 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=429, Unknown=0, NotChecked=0, Total=600 [2018-06-22 00:57:04,576 INFO ]: Start minimizeSevpa. Operand 95 states. [2018-06-22 00:57:04,580 INFO ]: Finished minimizeSevpa. Reduced states from 95 to 39. [2018-06-22 00:57:04,581 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 00:57:04,581 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2018-06-22 00:57:04,581 INFO ]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 29 [2018-06-22 00:57:04,582 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:04,582 INFO ]: Abstraction has 39 states and 45 transitions. [2018-06-22 00:57:04,582 INFO ]: Interpolant automaton has 10 states. [2018-06-22 00:57:04,582 INFO ]: Start isEmpty. Operand 39 states and 45 transitions. [2018-06-22 00:57:04,582 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 00:57:04,582 INFO ]: Found error trace [2018-06-22 00:57:04,582 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:04,583 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:04,583 INFO ]: Analyzing trace with hash 647812262, now seen corresponding path program 1 times [2018-06-22 00:57:04,583 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:04,583 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:04,583 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:04,583 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:04,583 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:04,599 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:04,747 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:04,747 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:57:04,747 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 00:57:04,748 INFO ]: Interpolant automaton has 10 states [2018-06-22 00:57:04,748 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 00:57:04,748 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 00:57:04,748 INFO ]: Start difference. First operand 39 states and 45 transitions. Second operand 10 states. [2018-06-22 00:57:04,932 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:04,932 INFO ]: Finished difference Result 48 states and 54 transitions. [2018-06-22 00:57:04,932 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 00:57:04,933 INFO ]: Start accepts. Automaton has 10 states. Word has length 29 [2018-06-22 00:57:04,933 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:04,933 INFO ]: With dead ends: 48 [2018-06-22 00:57:04,933 INFO ]: Without dead ends: 44 [2018-06-22 00:57:04,933 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-06-22 00:57:04,934 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 00:57:04,936 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-06-22 00:57:04,936 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 00:57:04,937 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-06-22 00:57:04,937 INFO ]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 29 [2018-06-22 00:57:04,937 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:04,937 INFO ]: Abstraction has 36 states and 41 transitions. [2018-06-22 00:57:04,937 INFO ]: Interpolant automaton has 10 states. [2018-06-22 00:57:04,937 INFO ]: Start isEmpty. Operand 36 states and 41 transitions. [2018-06-22 00:57:04,938 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 00:57:04,938 INFO ]: Found error trace [2018-06-22 00:57:04,938 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:04,938 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:04,938 INFO ]: Analyzing trace with hash -441925906, now seen corresponding path program 1 times [2018-06-22 00:57:04,938 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:04,938 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:04,939 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:04,939 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:04,939 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:04,953 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:05,079 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:05,079 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:57:05,079 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 00:57:05,079 INFO ]: Interpolant automaton has 10 states [2018-06-22 00:57:05,079 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 00:57:05,079 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 00:57:05,080 INFO ]: Start difference. First operand 36 states and 41 transitions. Second operand 10 states. [2018-06-22 00:57:05,263 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:05,263 INFO ]: Finished difference Result 73 states and 85 transitions. [2018-06-22 00:57:05,264 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 00:57:05,264 INFO ]: Start accepts. Automaton has 10 states. Word has length 29 [2018-06-22 00:57:05,264 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:05,265 INFO ]: With dead ends: 73 [2018-06-22 00:57:05,265 INFO ]: Without dead ends: 72 [2018-06-22 00:57:05,265 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2018-06-22 00:57:05,265 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-22 00:57:05,268 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 39. [2018-06-22 00:57:05,268 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 00:57:05,269 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-06-22 00:57:05,269 INFO ]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 29 [2018-06-22 00:57:05,269 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:05,269 INFO ]: Abstraction has 39 states and 44 transitions. [2018-06-22 00:57:05,269 INFO ]: Interpolant automaton has 10 states. [2018-06-22 00:57:05,269 INFO ]: Start isEmpty. Operand 39 states and 44 transitions. [2018-06-22 00:57:05,270 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 00:57:05,270 INFO ]: Found error trace [2018-06-22 00:57:05,270 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:05,270 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:05,270 INFO ]: Analyzing trace with hash -770566482, now seen corresponding path program 1 times [2018-06-22 00:57:05,270 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:05,270 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:05,271 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:05,271 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:05,271 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:05,285 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:05,441 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:05,441 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:57:05,441 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 00:57:05,441 INFO ]: Interpolant automaton has 10 states [2018-06-22 00:57:05,441 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 00:57:05,442 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 00:57:05,442 INFO ]: Start difference. First operand 39 states and 44 transitions. Second operand 10 states. [2018-06-22 00:57:05,526 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:05,526 INFO ]: Finished difference Result 20 states and 21 transitions. [2018-06-22 00:57:05,526 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 00:57:05,526 INFO ]: Start accepts. Automaton has 10 states. Word has length 29 [2018-06-22 00:57:05,526 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:05,526 INFO ]: With dead ends: 20 [2018-06-22 00:57:05,526 INFO ]: Without dead ends: 0 [2018-06-22 00:57:05,527 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-06-22 00:57:05,527 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 00:57:05,527 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 00:57:05,527 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 00:57:05,527 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 00:57:05,527 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-06-22 00:57:05,527 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:05,527 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 00:57:05,527 INFO ]: Interpolant automaton has 10 states. [2018-06-22 00:57:05,527 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 00:57:05,527 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 00:57:05,531 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 12:57:05 BoogieIcfgContainer [2018-06-22 00:57:05,531 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 00:57:05,531 INFO ]: Toolchain (without parser) took 5004.90 ms. Allocated memory was 309.3 MB in the beginning and 372.2 MB in the end (delta: 62.9 MB). Free memory was 249.7 MB in the beginning and 262.8 MB in the end (delta: -13.0 MB). Peak memory consumption was 49.9 MB. Max. memory is 3.6 GB. [2018-06-22 00:57:05,533 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 00:57:05,533 INFO ]: ChcToBoogie took 94.77 ms. Allocated memory is still 309.3 MB. Free memory was 249.7 MB in the beginning and 247.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 00:57:05,534 INFO ]: Boogie Preprocessor took 43.29 ms. Allocated memory is still 309.3 MB. Free memory was 247.7 MB in the beginning and 245.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 00:57:05,534 INFO ]: RCFGBuilder took 568.81 ms. Allocated memory is still 309.3 MB. Free memory was 245.8 MB in the beginning and 211.8 MB in the end (delta: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 3.6 GB. [2018-06-22 00:57:05,534 INFO ]: TraceAbstraction took 4289.82 ms. Allocated memory was 309.3 MB in the beginning and 372.2 MB in the end (delta: 62.9 MB). Free memory was 211.8 MB in the beginning and 262.8 MB in the end (delta: -51.0 MB). Peak memory consumption was 11.9 MB. Max. memory is 3.6 GB. [2018-06-22 00:57:05,537 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 94.77 ms. Allocated memory is still 309.3 MB. Free memory was 249.7 MB in the beginning and 247.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 43.29 ms. Allocated memory is still 309.3 MB. Free memory was 247.7 MB in the beginning and 245.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 568.81 ms. Allocated memory is still 309.3 MB. Free memory was 245.8 MB in the beginning and 211.8 MB in the end (delta: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 4289.82 ms. Allocated memory was 309.3 MB in the beginning and 372.2 MB in the end (delta: 62.9 MB). Free memory was 211.8 MB in the beginning and 262.8 MB in the end (delta: -51.0 MB). Peak memory consumption was 11.9 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 34 locations, 1 error locations. SAFE Result, 4.2s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 223 SDtfs, 903 SDslu, 1847 SDs, 0 SdLazy, 420 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 216 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 195 NumberOfCodeBlocks, 195 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 8452 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 24/24 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/13.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_00-57-05-546.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/13.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_00-57-05-546.csv Received shutdown request...