java -Xss4m -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/hopv/lia/mochi/lock.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:31:44,777 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:31:44,779 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:31:44,790 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:31:44,791 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:31:44,792 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:31:44,795 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:31:44,797 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:31:44,798 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:31:44,799 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:31:44,801 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:31:44,801 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:31:44,802 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:31:44,803 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:31:44,804 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:31:44,806 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:31:44,808 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:31:44,817 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:31:44,819 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:31:44,819 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:31:44,820 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:31:44,826 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:31:44,826 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:31:44,826 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:31:44,827 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:31:44,828 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:31:44,828 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:31:44,831 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:31:44,832 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:31:44,832 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:31:44,833 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:31:44,833 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:31:44,833 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:31:44,838 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:31:44,839 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:31:44,839 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:31:44,858 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:31:44,858 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:31:44,859 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:31:44,859 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:31:44,860 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:31:44,860 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:31:44,860 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:31:44,861 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:31:44,861 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:31:44,861 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:31:44,861 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:31:44,861 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:31:44,862 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:31:44,862 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:31:44,862 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:31:44,862 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:31:44,862 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:31:44,863 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:31:44,863 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:31:44,863 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:31:44,863 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:31:44,864 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:31:44,865 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:31:44,910 INFO ]: Repository-Root is: /tmp [2018-06-25 09:31:44,926 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:31:44,929 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:31:44,935 INFO ]: Initializing SmtParser... [2018-06-25 09:31:44,935 INFO ]: SmtParser initialized [2018-06-25 09:31:44,936 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/lock.smt2 [2018-06-25 09:31:44,937 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-25 09:31:45,032 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/lock.smt2 unknown [2018-06-25 09:31:45,277 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/lock.smt2 [2018-06-25 09:31:45,285 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:31:45,291 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:31:45,291 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:31:45,291 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:31:45,291 INFO ]: ChcToBoogie initialized [2018-06-25 09:31:45,295 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:31:45" (1/1) ... [2018-06-25 09:31:45,357 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:31:45 Unit [2018-06-25 09:31:45,357 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:31:45,358 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:31:45,358 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:31:45,358 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:31:45,379 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:31:45" (1/1) ... [2018-06-25 09:31:45,379 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:31:45" (1/1) ... [2018-06-25 09:31:45,385 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:31:45" (1/1) ... [2018-06-25 09:31:45,385 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:31:45" (1/1) ... [2018-06-25 09:31:45,389 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:31:45" (1/1) ... [2018-06-25 09:31:45,397 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:31:45" (1/1) ... [2018-06-25 09:31:45,399 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:31:45" (1/1) ... [2018-06-25 09:31:45,400 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:31:45,405 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:31:45,405 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:31:45,405 INFO ]: RCFGBuilder initialized [2018-06-25 09:31:45,406 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:31:45" (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-25 09:31:45,417 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:31:45,417 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:31:45,417 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:31:45,417 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:31:45,417 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:31:45,417 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-25 09:31:45,796 INFO ]: Using library mode [2018-06-25 09:31:45,796 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:31:45 BoogieIcfgContainer [2018-06-25 09:31:45,796 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:31:45,797 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:31:45,797 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:31:45,800 INFO ]: TraceAbstraction initialized [2018-06-25 09:31:45,800 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:31:45" (1/3) ... [2018-06-25 09:31:45,801 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b69e40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:31:45, skipping insertion in model container [2018-06-25 09:31:45,801 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:31:45" (2/3) ... [2018-06-25 09:31:45,801 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b69e40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:31:45, skipping insertion in model container [2018-06-25 09:31:45,801 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:31:45" (3/3) ... [2018-06-25 09:31:45,803 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:31:45,810 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:31:45,820 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:31:45,866 INFO ]: Using default assertion order modulation [2018-06-25 09:31:45,866 INFO ]: Interprodecural is true [2018-06-25 09:31:45,866 INFO ]: Hoare is false [2018-06-25 09:31:45,866 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:31:45,866 INFO ]: Backedges is TWOTRACK [2018-06-25 09:31:45,866 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:31:45,866 INFO ]: Difference is false [2018-06-25 09:31:45,866 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:31:45,866 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:31:45,879 INFO ]: Start isEmpty. Operand 26 states. [2018-06-25 09:31:45,892 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:31:45,892 INFO ]: Found error trace [2018-06-25 09:31:45,893 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:31:45,893 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:31:45,900 INFO ]: Analyzing trace with hash -552003197, now seen corresponding path program 1 times [2018-06-25 09:31:45,901 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:31:45,902 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:31:45,937 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:31:45,937 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:31:45,937 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:31:45,963 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:31:46,019 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:31:46,021 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:31:46,021 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:31:46,022 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:31:46,032 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:31:46,032 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:31:46,034 INFO ]: Start difference. First operand 26 states. Second operand 4 states. [2018-06-25 09:31:46,325 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:31:46,325 INFO ]: Finished difference Result 45 states and 63 transitions. [2018-06-25 09:31:46,325 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:31:46,326 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-25 09:31:46,327 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:31:46,340 INFO ]: With dead ends: 45 [2018-06-25 09:31:46,340 INFO ]: Without dead ends: 45 [2018-06-25 09:31:46,342 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:31:46,371 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-25 09:31:46,396 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-06-25 09:31:46,397 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-25 09:31:46,399 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2018-06-25 09:31:46,400 INFO ]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 7 [2018-06-25 09:31:46,401 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:31:46,401 INFO ]: Abstraction has 45 states and 63 transitions. [2018-06-25 09:31:46,401 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:31:46,401 INFO ]: Start isEmpty. Operand 45 states and 63 transitions. [2018-06-25 09:31:46,402 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:31:46,402 INFO ]: Found error trace [2018-06-25 09:31:46,402 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:31:46,402 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:31:46,403 INFO ]: Analyzing trace with hash -1748540373, now seen corresponding path program 1 times [2018-06-25 09:31:46,403 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:31:46,403 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:31:46,403 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:31:46,403 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:31:46,403 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:31:46,408 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:31:46,492 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:31:46,492 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:31:46,492 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:31:46,494 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:31:46,494 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:31:46,494 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:31:46,494 INFO ]: Start difference. First operand 45 states and 63 transitions. Second operand 4 states. [2018-06-25 09:31:46,817 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:31:46,817 INFO ]: Finished difference Result 66 states and 93 transitions. [2018-06-25 09:31:46,817 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:31:46,817 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-25 09:31:46,817 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:31:46,820 INFO ]: With dead ends: 66 [2018-06-25 09:31:46,820 INFO ]: Without dead ends: 66 [2018-06-25 09:31:46,820 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:31:46,821 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-25 09:31:46,829 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-06-25 09:31:46,829 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-25 09:31:46,832 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 93 transitions. [2018-06-25 09:31:46,832 INFO ]: Start accepts. Automaton has 66 states and 93 transitions. Word has length 9 [2018-06-25 09:31:46,832 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:31:46,832 INFO ]: Abstraction has 66 states and 93 transitions. [2018-06-25 09:31:46,832 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:31:46,832 INFO ]: Start isEmpty. Operand 66 states and 93 transitions. [2018-06-25 09:31:46,833 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:31:46,833 INFO ]: Found error trace [2018-06-25 09:31:46,833 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:31:46,833 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:31:46,833 INFO ]: Analyzing trace with hash -1403344436, now seen corresponding path program 1 times [2018-06-25 09:31:46,833 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:31:46,833 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:31:46,834 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:31:46,834 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:31:46,834 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:31:46,840 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:31:46,959 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:31:46,959 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:31:46,959 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:31:46,959 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:31:46,960 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:31:46,960 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:31:46,960 INFO ]: Start difference. First operand 66 states and 93 transitions. Second operand 4 states. [2018-06-25 09:31:47,196 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:31:47,196 INFO ]: Finished difference Result 87 states and 123 transitions. [2018-06-25 09:31:47,196 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:31:47,196 INFO ]: Start accepts. Automaton has 4 states. Word has length 11 [2018-06-25 09:31:47,196 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:31:47,199 INFO ]: With dead ends: 87 [2018-06-25 09:31:47,199 INFO ]: Without dead ends: 87 [2018-06-25 09:31:47,199 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:31:47,199 INFO ]: Start minimizeSevpa. Operand 87 states. [2018-06-25 09:31:47,209 INFO ]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-06-25 09:31:47,209 INFO ]: Start removeUnreachable. Operand 87 states. [2018-06-25 09:31:47,212 INFO ]: Finished removeUnreachable. Reduced from 87 states to 87 states and 123 transitions. [2018-06-25 09:31:47,212 INFO ]: Start accepts. Automaton has 87 states and 123 transitions. Word has length 11 [2018-06-25 09:31:47,212 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:31:47,212 INFO ]: Abstraction has 87 states and 123 transitions. [2018-06-25 09:31:47,212 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:31:47,212 INFO ]: Start isEmpty. Operand 87 states and 123 transitions. [2018-06-25 09:31:47,213 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:31:47,213 INFO ]: Found error trace [2018-06-25 09:31:47,213 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:31:47,214 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:31:47,214 INFO ]: Analyzing trace with hash 38271845, now seen corresponding path program 1 times [2018-06-25 09:31:47,214 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:31:47,214 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:31:47,215 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:31:47,215 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:31:47,215 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:31:47,224 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:31:47,281 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:31:47,281 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:31:47,281 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:31:47,281 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:31:47,282 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:31:47,282 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:31:47,282 INFO ]: Start difference. First operand 87 states and 123 transitions. Second operand 4 states. [2018-06-25 09:31:47,320 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:31:47,320 INFO ]: Finished difference Result 95 states and 127 transitions. [2018-06-25 09:31:47,320 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:31:47,320 INFO ]: Start accepts. Automaton has 4 states. Word has length 11 [2018-06-25 09:31:47,320 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:31:47,322 INFO ]: With dead ends: 95 [2018-06-25 09:31:47,322 INFO ]: Without dead ends: 87 [2018-06-25 09:31:47,322 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:31:47,322 INFO ]: Start minimizeSevpa. Operand 87 states. [2018-06-25 09:31:47,330 INFO ]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-06-25 09:31:47,330 INFO ]: Start removeUnreachable. Operand 87 states. [2018-06-25 09:31:47,332 INFO ]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2018-06-25 09:31:47,332 INFO ]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 11 [2018-06-25 09:31:47,332 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:31:47,332 INFO ]: Abstraction has 87 states and 119 transitions. [2018-06-25 09:31:47,332 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:31:47,333 INFO ]: Start isEmpty. Operand 87 states and 119 transitions. [2018-06-25 09:31:47,334 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:31:47,334 INFO ]: Found error trace [2018-06-25 09:31:47,334 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:31:47,334 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:31:47,336 INFO ]: Analyzing trace with hash 1097782249, now seen corresponding path program 1 times [2018-06-25 09:31:47,336 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:31:47,336 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:31:47,337 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:31:47,337 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:31:47,337 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:31:47,346 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:31:47,420 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:31:47,420 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:31:47,420 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:31:47,421 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:31:47,421 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:31:47,421 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:31:47,421 INFO ]: Start difference. First operand 87 states and 119 transitions. Second operand 4 states. [2018-06-25 09:31:47,462 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:31:47,462 INFO ]: Finished difference Result 135 states and 197 transitions. [2018-06-25 09:31:47,462 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:31:47,462 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-25 09:31:47,463 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:31:47,467 INFO ]: With dead ends: 135 [2018-06-25 09:31:47,467 INFO ]: Without dead ends: 135 [2018-06-25 09:31:47,467 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:31:47,467 INFO ]: Start minimizeSevpa. Operand 135 states. [2018-06-25 09:31:47,484 INFO ]: Finished minimizeSevpa. Reduced states from 135 to 95. [2018-06-25 09:31:47,484 INFO ]: Start removeUnreachable. Operand 95 states. [2018-06-25 09:31:47,486 INFO ]: Finished removeUnreachable. Reduced from 95 states to 95 states and 127 transitions. [2018-06-25 09:31:47,486 INFO ]: Start accepts. Automaton has 95 states and 127 transitions. Word has length 13 [2018-06-25 09:31:47,486 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:31:47,486 INFO ]: Abstraction has 95 states and 127 transitions. [2018-06-25 09:31:47,486 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:31:47,486 INFO ]: Start isEmpty. Operand 95 states and 127 transitions. [2018-06-25 09:31:47,489 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-25 09:31:47,489 INFO ]: Found error trace [2018-06-25 09:31:47,489 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:31:47,489 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:31:47,489 INFO ]: Analyzing trace with hash -190155451, now seen corresponding path program 1 times [2018-06-25 09:31:47,490 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:31:47,490 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:31:47,490 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:31:47,490 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:31:47,490 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:31:47,503 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:31:47,941 WARN ]: Spent 185.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 8 [2018-06-25 09:31:47,976 INFO ]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:31:47,976 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:31:47,976 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:31:47,986 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:31:48,018 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:31:48,026 INFO ]: Computing forward predicates... [2018-06-25 09:31:48,138 INFO ]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:31:48,164 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:31:48,164 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2018-06-25 09:31:48,164 INFO ]: Interpolant automaton has 13 states [2018-06-25 09:31:48,164 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 09:31:48,164 INFO ]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:31:48,164 INFO ]: Start difference. First operand 95 states and 127 transitions. Second operand 13 states. [2018-06-25 09:31:49,329 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:31:49,329 INFO ]: Finished difference Result 268 states and 452 transitions. [2018-06-25 09:31:49,330 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 09:31:49,330 INFO ]: Start accepts. Automaton has 13 states. Word has length 22 [2018-06-25 09:31:49,330 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:31:49,339 INFO ]: With dead ends: 268 [2018-06-25 09:31:49,339 INFO ]: Without dead ends: 251 [2018-06-25 09:31:49,339 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2018-06-25 09:31:49,339 INFO ]: Start minimizeSevpa. Operand 251 states. [2018-06-25 09:31:49,430 INFO ]: Finished minimizeSevpa. Reduced states from 251 to 105. [2018-06-25 09:31:49,430 INFO ]: Start removeUnreachable. Operand 105 states. [2018-06-25 09:31:49,431 INFO ]: Finished removeUnreachable. Reduced from 105 states to 105 states and 137 transitions. [2018-06-25 09:31:49,431 INFO ]: Start accepts. Automaton has 105 states and 137 transitions. Word has length 22 [2018-06-25 09:31:49,432 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:31:49,432 INFO ]: Abstraction has 105 states and 137 transitions. [2018-06-25 09:31:49,432 INFO ]: Interpolant automaton has 13 states. [2018-06-25 09:31:49,432 INFO ]: Start isEmpty. Operand 105 states and 137 transitions. [2018-06-25 09:31:49,437 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-25 09:31:49,437 INFO ]: Found error trace [2018-06-25 09:31:49,437 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:31:49,437 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:31:49,437 INFO ]: Analyzing trace with hash 67153641, now seen corresponding path program 1 times [2018-06-25 09:31:49,437 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:31:49,437 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:31:49,438 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:31:49,438 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:31:49,438 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:31:49,461 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:31:49,586 INFO ]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:31:49,586 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:31:49,586 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-25 09:31:49,586 INFO ]: Interpolant automaton has 7 states [2018-06-25 09:31:49,586 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 09:31:49,586 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:31:49,586 INFO ]: Start difference. First operand 105 states and 137 transitions. Second operand 7 states. [2018-06-25 09:31:49,824 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:31:49,824 INFO ]: Finished difference Result 129 states and 161 transitions. [2018-06-25 09:31:49,824 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:31:49,824 INFO ]: Start accepts. Automaton has 7 states. Word has length 22 [2018-06-25 09:31:49,824 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:31:49,825 INFO ]: With dead ends: 129 [2018-06-25 09:31:49,825 INFO ]: Without dead ends: 105 [2018-06-25 09:31:49,826 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:31:49,826 INFO ]: Start minimizeSevpa. Operand 105 states. [2018-06-25 09:31:49,838 INFO ]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-06-25 09:31:49,838 INFO ]: Start removeUnreachable. Operand 105 states. [2018-06-25 09:31:49,839 INFO ]: Finished removeUnreachable. Reduced from 105 states to 105 states and 133 transitions. [2018-06-25 09:31:49,839 INFO ]: Start accepts. Automaton has 105 states and 133 transitions. Word has length 22 [2018-06-25 09:31:49,839 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:31:49,839 INFO ]: Abstraction has 105 states and 133 transitions. [2018-06-25 09:31:49,839 INFO ]: Interpolant automaton has 7 states. [2018-06-25 09:31:49,839 INFO ]: Start isEmpty. Operand 105 states and 133 transitions. [2018-06-25 09:31:49,844 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-25 09:31:49,844 INFO ]: Found error trace [2018-06-25 09:31:49,844 INFO ]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:31:49,844 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:31:49,844 INFO ]: Analyzing trace with hash -633381970, now seen corresponding path program 1 times [2018-06-25 09:31:49,844 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:31:49,844 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:31:49,845 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:31:49,845 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:31:49,845 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:31:49,863 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:31:49,901 INFO ]: Checked inductivity of 19 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 09:31:49,901 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:31:49,901 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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) [2018-06-25 09:31:49,920 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:31:49,950 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:31:49,952 INFO ]: Computing forward predicates... [2018-06-25 09:31:49,963 INFO ]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 09:31:49,989 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:31:49,990 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-06-25 09:31:49,990 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:31:49,990 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:31:49,990 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:31:49,990 INFO ]: Start difference. First operand 105 states and 133 transitions. Second operand 4 states. [2018-06-25 09:31:50,047 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:31:50,047 INFO ]: Finished difference Result 124 states and 153 transitions. [2018-06-25 09:31:50,047 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:31:50,047 INFO ]: Start accepts. Automaton has 4 states. Word has length 33 [2018-06-25 09:31:50,047 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:31:50,048 INFO ]: With dead ends: 124 [2018-06-25 09:31:50,048 INFO ]: Without dead ends: 102 [2018-06-25 09:31:50,049 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:31:50,049 INFO ]: Start minimizeSevpa. Operand 102 states. [2018-06-25 09:31:50,053 INFO ]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-06-25 09:31:50,054 INFO ]: Start removeUnreachable. Operand 102 states. [2018-06-25 09:31:50,055 INFO ]: Finished removeUnreachable. Reduced from 102 states to 102 states and 125 transitions. [2018-06-25 09:31:50,055 INFO ]: Start accepts. Automaton has 102 states and 125 transitions. Word has length 33 [2018-06-25 09:31:50,055 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:31:50,055 INFO ]: Abstraction has 102 states and 125 transitions. [2018-06-25 09:31:50,055 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:31:50,055 INFO ]: Start isEmpty. Operand 102 states and 125 transitions. [2018-06-25 09:31:50,057 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-25 09:31:50,057 INFO ]: Found error trace [2018-06-25 09:31:50,057 INFO ]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:31:50,057 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:31:50,057 INFO ]: Analyzing trace with hash 1078840033, now seen corresponding path program 1 times [2018-06-25 09:31:50,057 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:31:50,057 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:31:50,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:31:50,058 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:31:50,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:31:50,072 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:31:50,132 INFO ]: Checked inductivity of 36 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-25 09:31:50,132 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:31:50,132 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:31:50,143 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:31:50,179 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:31:50,182 INFO ]: Computing forward predicates... [2018-06-25 09:31:50,225 INFO ]: Checked inductivity of 36 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:31:50,256 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:31:50,256 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 8 [2018-06-25 09:31:50,256 INFO ]: Interpolant automaton has 8 states [2018-06-25 09:31:50,256 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 09:31:50,256 INFO ]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:31:50,256 INFO ]: Start difference. First operand 102 states and 125 transitions. Second operand 8 states. [2018-06-25 09:31:50,333 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:31:50,333 INFO ]: Finished difference Result 163 states and 218 transitions. [2018-06-25 09:31:50,334 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 09:31:50,334 INFO ]: Start accepts. Automaton has 8 states. Word has length 40 [2018-06-25 09:31:50,335 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:31:50,336 INFO ]: With dead ends: 163 [2018-06-25 09:31:50,336 INFO ]: Without dead ends: 156 [2018-06-25 09:31:50,337 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:31:50,337 INFO ]: Start minimizeSevpa. Operand 156 states. [2018-06-25 09:31:50,344 INFO ]: Finished minimizeSevpa. Reduced states from 156 to 106. [2018-06-25 09:31:50,344 INFO ]: Start removeUnreachable. Operand 106 states. [2018-06-25 09:31:50,345 INFO ]: Finished removeUnreachable. Reduced from 106 states to 106 states and 129 transitions. [2018-06-25 09:31:50,345 INFO ]: Start accepts. Automaton has 106 states and 129 transitions. Word has length 40 [2018-06-25 09:31:50,346 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:31:50,346 INFO ]: Abstraction has 106 states and 129 transitions. [2018-06-25 09:31:50,346 INFO ]: Interpolant automaton has 8 states. [2018-06-25 09:31:50,346 INFO ]: Start isEmpty. Operand 106 states and 129 transitions. [2018-06-25 09:31:50,347 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-25 09:31:50,347 INFO ]: Found error trace [2018-06-25 09:31:50,347 INFO ]: trace histogram [4, 4, 4, 3, 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-25 09:31:50,347 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:31:50,347 INFO ]: Analyzing trace with hash 402983890, now seen corresponding path program 1 times [2018-06-25 09:31:50,347 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:31:50,347 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:31:50,348 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:31:50,348 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:31:50,348 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:31:50,358 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:31:50,451 INFO ]: Checked inductivity of 38 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-25 09:31:50,451 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:31:50,451 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:31:50,457 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:31:50,487 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:31:50,490 INFO ]: Computing forward predicates... [2018-06-25 09:31:50,679 INFO ]: Checked inductivity of 38 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-25 09:31:50,702 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:31:50,703 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-06-25 09:31:50,703 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:31:50,703 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:31:50,703 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:31:50,703 INFO ]: Start difference. First operand 106 states and 129 transitions. Second operand 12 states. [2018-06-25 09:31:51,590 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:31:51,590 INFO ]: Finished difference Result 159 states and 206 transitions. [2018-06-25 09:31:51,590 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-25 09:31:51,590 INFO ]: Start accepts. Automaton has 12 states. Word has length 44 [2018-06-25 09:31:51,591 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:31:51,592 INFO ]: With dead ends: 159 [2018-06-25 09:31:51,592 INFO ]: Without dead ends: 145 [2018-06-25 09:31:51,592 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2018-06-25 09:31:51,592 INFO ]: Start minimizeSevpa. Operand 145 states. [2018-06-25 09:31:51,599 INFO ]: Finished minimizeSevpa. Reduced states from 145 to 106. [2018-06-25 09:31:51,599 INFO ]: Start removeUnreachable. Operand 106 states. [2018-06-25 09:31:51,600 INFO ]: Finished removeUnreachable. Reduced from 106 states to 106 states and 127 transitions. [2018-06-25 09:31:51,600 INFO ]: Start accepts. Automaton has 106 states and 127 transitions. Word has length 44 [2018-06-25 09:31:51,600 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:31:51,600 INFO ]: Abstraction has 106 states and 127 transitions. [2018-06-25 09:31:51,600 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:31:51,600 INFO ]: Start isEmpty. Operand 106 states and 127 transitions. [2018-06-25 09:31:51,602 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-25 09:31:51,602 INFO ]: Found error trace [2018-06-25 09:31:51,602 INFO ]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:31:51,602 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:31:51,602 INFO ]: Analyzing trace with hash -1815662978, now seen corresponding path program 2 times [2018-06-25 09:31:51,602 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:31:51,602 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:31:51,603 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:31:51,603 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:31:51,603 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:31:51,617 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:31:51,713 INFO ]: Checked inductivity of 62 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-25 09:31:51,714 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:31:51,714 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:31:51,719 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:31:51,758 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:31:51,758 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:31:51,761 INFO ]: Computing forward predicates... [2018-06-25 09:31:51,882 INFO ]: Checked inductivity of 62 backedges. 39 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-25 09:31:51,902 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:31:51,902 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-06-25 09:31:51,902 INFO ]: Interpolant automaton has 20 states [2018-06-25 09:31:51,902 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-25 09:31:51,902 INFO ]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:31:51,903 INFO ]: Start difference. First operand 106 states and 127 transitions. Second operand 20 states. [2018-06-25 09:31:52,991 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:31:53,018 INFO ]: Finished difference Result 252 states and 355 transitions. [2018-06-25 09:31:53,019 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-25 09:31:53,019 INFO ]: Start accepts. Automaton has 20 states. Word has length 53 [2018-06-25 09:31:53,019 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:31:53,022 INFO ]: With dead ends: 252 [2018-06-25 09:31:53,022 INFO ]: Without dead ends: 252 [2018-06-25 09:31:53,023 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=1258, Unknown=0, NotChecked=0, Total=1482 [2018-06-25 09:31:53,023 INFO ]: Start minimizeSevpa. Operand 252 states. [2018-06-25 09:31:53,033 INFO ]: Finished minimizeSevpa. Reduced states from 252 to 168. [2018-06-25 09:31:53,033 INFO ]: Start removeUnreachable. Operand 168 states. [2018-06-25 09:31:53,035 INFO ]: Finished removeUnreachable. Reduced from 168 states to 168 states and 218 transitions. [2018-06-25 09:31:53,035 INFO ]: Start accepts. Automaton has 168 states and 218 transitions. Word has length 53 [2018-06-25 09:31:53,035 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:31:53,035 INFO ]: Abstraction has 168 states and 218 transitions. [2018-06-25 09:31:53,035 INFO ]: Interpolant automaton has 20 states. [2018-06-25 09:31:53,035 INFO ]: Start isEmpty. Operand 168 states and 218 transitions. [2018-06-25 09:31:53,037 INFO ]: Finished isEmpty. Found accepting run of length 63 [2018-06-25 09:31:53,037 INFO ]: Found error trace [2018-06-25 09:31:53,037 INFO ]: trace histogram [6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:31:53,037 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:31:53,037 INFO ]: Analyzing trace with hash 520615586, now seen corresponding path program 1 times [2018-06-25 09:31:53,037 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:31:53,037 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:31:53,038 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:31:53,038 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:31:53,038 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:31:53,055 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:31:53,225 WARN ]: Spent 119.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 4 [2018-06-25 09:31:53,297 INFO ]: Checked inductivity of 95 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-06-25 09:31:53,297 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:31:53,297 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-25 09:31:53,297 INFO ]: Interpolant automaton has 6 states [2018-06-25 09:31:53,298 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 09:31:53,298 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:31:53,298 INFO ]: Start difference. First operand 168 states and 218 transitions. Second operand 6 states. [2018-06-25 09:31:53,330 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:31:53,330 INFO ]: Finished difference Result 81 states and 90 transitions. [2018-06-25 09:31:53,330 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 09:31:53,330 INFO ]: Start accepts. Automaton has 6 states. Word has length 62 [2018-06-25 09:31:53,331 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:31:53,331 INFO ]: With dead ends: 81 [2018-06-25 09:31:53,331 INFO ]: Without dead ends: 0 [2018-06-25 09:31:53,331 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:31:53,331 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 09:31:53,331 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 09:31:53,331 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 09:31:53,331 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 09:31:53,331 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2018-06-25 09:31:53,331 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:31:53,331 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 09:31:53,331 INFO ]: Interpolant automaton has 6 states. [2018-06-25 09:31:53,331 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 09:31:53,331 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 09:31:53,335 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:31:53 BoogieIcfgContainer [2018-06-25 09:31:53,335 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:31:53,336 INFO ]: Toolchain (without parser) took 8050.54 ms. Allocated memory was 307.8 MB in the beginning and 381.2 MB in the end (delta: 73.4 MB). Free memory was 263.1 MB in the beginning and 270.7 MB in the end (delta: -7.6 MB). Peak memory consumption was 65.8 MB. Max. memory is 3.6 GB. [2018-06-25 09:31:53,336 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:31:53,337 INFO ]: ChcToBoogie took 66.21 ms. Allocated memory is still 307.8 MB. Free memory was 262.1 MB in the beginning and 260.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:31:53,337 INFO ]: Boogie Preprocessor took 42.48 ms. Allocated memory is still 307.8 MB. Free memory was 260.1 MB in the beginning and 259.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-25 09:31:53,338 INFO ]: RCFGBuilder took 391.48 ms. Allocated memory is still 307.8 MB. Free memory was 259.1 MB in the beginning and 247.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:31:53,338 INFO ]: TraceAbstraction took 7537.66 ms. Allocated memory was 307.8 MB in the beginning and 381.2 MB in the end (delta: 73.4 MB). Free memory was 247.1 MB in the beginning and 270.7 MB in the end (delta: -23.6 MB). Peak memory consumption was 49.8 MB. Max. memory is 3.6 GB. [2018-06-25 09:31:53,341 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 66.21 ms. Allocated memory is still 307.8 MB. Free memory was 262.1 MB in the beginning and 260.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 42.48 ms. Allocated memory is still 307.8 MB. Free memory was 260.1 MB in the beginning and 259.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 391.48 ms. Allocated memory is still 307.8 MB. Free memory was 259.1 MB in the beginning and 247.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 7537.66 ms. Allocated memory was 307.8 MB in the beginning and 381.2 MB in the end (delta: 73.4 MB). Free memory was 247.1 MB in the beginning and 270.7 MB in the end (delta: -23.6 MB). Peak memory consumption was 49.8 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, 26 locations, 1 error locations. SAFE Result, 7.4s OverallTime, 12 OverallIterations, 6 TraceHistogramMax, 4.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 529 SDtfs, 585 SDslu, 2117 SDs, 0 SdLazy, 2053 SolverSat, 182 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 331 GetRequests, 209 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168occurred in iteration=11, 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.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 359 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 519 NumberOfCodeBlocks, 519 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 502 ConstructedInterpolants, 0 QuantifiedInterpolants, 32562 SizeOfPredicates, 21 NumberOfNonLiveVariables, 790 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 17 InterpolantComputations, 10 PerfectInterpolantSequences, 392/424 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/lock.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-31-53-351.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lock.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-31-53-351.csv Received shutdown request...