java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.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/llreve/barthe_merged_unsafe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:46:28,798 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:46:28,800 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:46:28,812 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:46:28,812 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:46:28,813 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:46:28,817 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:46:28,819 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:46:28,820 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:46:28,822 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:46:28,823 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:46:28,823 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:46:28,824 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:46:28,825 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:46:28,825 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:46:28,830 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:46:28,832 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:46:28,844 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:46:28,845 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:46:28,846 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:46:28,847 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:46:28,849 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:46:28,849 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:46:28,849 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:46:28,850 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:46:28,851 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:46:28,852 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:46:28,852 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:46:28,853 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:46:28,854 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:46:28,854 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:46:28,859 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:46:28,860 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:46:28,860 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:46:28,861 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:46:28,861 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 20:46:28,875 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:46:28,876 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:46:28,876 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:46:28,876 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:46:28,877 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:46:28,877 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:46:28,877 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:46:28,878 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:46:28,878 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:46:28,878 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:46:28,878 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:46:28,878 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:46:28,879 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:46:28,879 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:46:28,879 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:46:28,879 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:46:28,879 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:46:28,879 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:46:28,880 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:46:28,880 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:46:28,880 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:46:28,881 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:46:28,881 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:46:28,917 INFO ]: Repository-Root is: /tmp [2018-06-24 20:46:28,936 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:46:28,941 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:46:28,943 INFO ]: Initializing SmtParser... [2018-06-24 20:46:28,943 INFO ]: SmtParser initialized [2018-06-24 20:46:28,944 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/barthe_merged_unsafe.c-1.smt2 [2018-06-24 20:46:28,945 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-24 20:46:29,033 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/barthe_merged_unsafe.c-1.smt2 unknown [2018-06-24 20:46:29,207 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/barthe_merged_unsafe.c-1.smt2 [2018-06-24 20:46:29,217 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:46:29,223 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:46:29,224 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:46:29,224 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:46:29,224 INFO ]: ChcToBoogie initialized [2018-06-24 20:46:29,227 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:46:29" (1/1) ... [2018-06-24 20:46:29,278 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:29 Unit [2018-06-24 20:46:29,278 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:46:29,279 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:46:29,279 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:46:29,279 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:46:29,299 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:29" (1/1) ... [2018-06-24 20:46:29,299 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:29" (1/1) ... [2018-06-24 20:46:29,305 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:29" (1/1) ... [2018-06-24 20:46:29,305 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:29" (1/1) ... [2018-06-24 20:46:29,309 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:29" (1/1) ... [2018-06-24 20:46:29,312 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:29" (1/1) ... [2018-06-24 20:46:29,313 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:29" (1/1) ... [2018-06-24 20:46:29,315 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:46:29,316 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:46:29,316 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:46:29,316 INFO ]: RCFGBuilder initialized [2018-06-24 20:46:29,316 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:29" (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-24 20:46:29,330 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:46:29,330 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:46:29,330 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:46:29,330 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:46:29,330 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:46:29,330 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-24 20:46:29,587 INFO ]: Using library mode [2018-06-24 20:46:29,587 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:46:29 BoogieIcfgContainer [2018-06-24 20:46:29,588 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:46:29,588 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:46:29,588 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:46:29,589 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:46:29,590 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:46:29" (1/1) ... [2018-06-24 20:46:29,618 INFO ]: Initial Icfg 11 locations, 12 edges [2018-06-24 20:46:29,620 INFO ]: Using Remove infeasible edges [2018-06-24 20:46:29,620 INFO ]: Using Maximize final states [2018-06-24 20:46:29,621 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:46:29,622 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:46:29,623 INFO ]: Using Remove sink states [2018-06-24 20:46:29,624 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:46:29,624 INFO ]: Using Use SBE [2018-06-24 20:46:29,630 INFO ]: SBE split 0 edges [2018-06-24 20:46:29,636 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 20:46:29,637 INFO ]: 0 new accepting states [2018-06-24 20:46:29,674 INFO ]: Removed 6 edges and 3 locations by large block encoding [2018-06-24 20:46:29,675 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:46:29,679 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:46:29,680 INFO ]: 0 new accepting states [2018-06-24 20:46:29,680 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:46:29,680 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:46:29,680 INFO ]: Encoded RCFG 6 locations, 7 edges [2018-06-24 20:46:29,680 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:46:29 BasicIcfg [2018-06-24 20:46:29,680 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:46:29,681 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:46:29,681 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:46:29,684 INFO ]: TraceAbstraction initialized [2018-06-24 20:46:29,684 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:46:29" (1/4) ... [2018-06-24 20:46:29,685 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a1b01ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:46:29, skipping insertion in model container [2018-06-24 20:46:29,685 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:29" (2/4) ... [2018-06-24 20:46:29,685 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a1b01ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:46:29, skipping insertion in model container [2018-06-24 20:46:29,685 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:46:29" (3/4) ... [2018-06-24 20:46:29,685 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a1b01ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:46:29, skipping insertion in model container [2018-06-24 20:46:29,685 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:46:29" (4/4) ... [2018-06-24 20:46:29,688 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:46:29,702 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:46:29,709 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:46:29,750 INFO ]: Using default assertion order modulation [2018-06-24 20:46:29,751 INFO ]: Interprodecural is true [2018-06-24 20:46:29,751 INFO ]: Hoare is false [2018-06-24 20:46:29,751 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:46:29,751 INFO ]: Backedges is TWOTRACK [2018-06-24 20:46:29,751 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:46:29,751 INFO ]: Difference is false [2018-06-24 20:46:29,751 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:46:29,751 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:46:29,763 INFO ]: Start isEmpty. Operand 6 states. [2018-06-24 20:46:29,772 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:46:29,772 INFO ]: Found error trace [2018-06-24 20:46:29,773 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:46:29,773 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:29,778 INFO ]: Analyzing trace with hash 37312133, now seen corresponding path program 1 times [2018-06-24 20:46:29,780 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:29,781 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:29,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:29,812 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:29,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:29,855 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:29,904 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:29,905 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:46:29,905 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:46:29,907 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:46:29,918 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:46:29,918 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:46:29,920 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-24 20:46:29,967 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:29,968 INFO ]: Finished difference Result 7 states and 9 transitions. [2018-06-24 20:46:29,968 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:46:29,969 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:46:29,969 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:29,976 INFO ]: With dead ends: 7 [2018-06-24 20:46:29,976 INFO ]: Without dead ends: 7 [2018-06-24 20:46:29,978 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:46:29,991 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 20:46:30,003 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 20:46:30,005 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 20:46:30,005 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-06-24 20:46:30,006 INFO ]: Start accepts. Automaton has 7 states and 9 transitions. Word has length 5 [2018-06-24 20:46:30,007 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:30,007 INFO ]: Abstraction has 7 states and 9 transitions. [2018-06-24 20:46:30,007 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:46:30,007 INFO ]: Start isEmpty. Operand 7 states and 9 transitions. [2018-06-24 20:46:30,007 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:46:30,007 INFO ]: Found error trace [2018-06-24 20:46:30,007 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:46:30,007 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:30,007 INFO ]: Analyzing trace with hash 1156291884, now seen corresponding path program 1 times [2018-06-24 20:46:30,007 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:30,008 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:30,008 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:30,008 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:30,008 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:30,045 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:30,353 WARN ]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-06-24 20:46:30,354 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:30,354 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:30,354 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) [2018-06-24 20:46:30,372 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:46:30,417 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:30,424 INFO ]: Computing forward predicates... [2018-06-24 20:46:30,512 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:30,542 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:30,542 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-24 20:46:30,543 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:46:30,543 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:46:30,543 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:46:30,543 INFO ]: Start difference. First operand 7 states and 9 transitions. Second operand 5 states. [2018-06-24 20:46:30,662 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:30,662 INFO ]: Finished difference Result 9 states and 13 transitions. [2018-06-24 20:46:30,663 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:46:30,663 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-24 20:46:30,663 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:30,664 INFO ]: With dead ends: 9 [2018-06-24 20:46:30,664 INFO ]: Without dead ends: 9 [2018-06-24 20:46:30,665 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:46:30,665 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 20:46:30,666 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 20:46:30,666 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 20:46:30,666 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2018-06-24 20:46:30,666 INFO ]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 6 [2018-06-24 20:46:30,667 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:30,667 INFO ]: Abstraction has 9 states and 13 transitions. [2018-06-24 20:46:30,667 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:46:30,667 INFO ]: Start isEmpty. Operand 9 states and 13 transitions. [2018-06-24 20:46:30,667 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:46:30,667 INFO ]: Found error trace [2018-06-24 20:46:30,667 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:46:30,667 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:30,667 INFO ]: Analyzing trace with hash 1485849318, now seen corresponding path program 1 times [2018-06-24 20:46:30,667 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:30,667 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:30,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:30,671 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:30,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:30,709 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:30,839 INFO ]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:30,839 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:30,839 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:46:30,845 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:30,898 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:30,900 INFO ]: Computing forward predicates... [2018-06-24 20:46:30,914 INFO ]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:30,946 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:30,947 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-24 20:46:30,947 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:46:30,947 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:46:30,947 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:46:30,947 INFO ]: Start difference. First operand 9 states and 13 transitions. Second operand 4 states. [2018-06-24 20:46:31,024 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:31,024 INFO ]: Finished difference Result 11 states and 17 transitions. [2018-06-24 20:46:31,025 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:46:31,025 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-24 20:46:31,025 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:31,025 INFO ]: With dead ends: 11 [2018-06-24 20:46:31,025 INFO ]: Without dead ends: 11 [2018-06-24 20:46:31,026 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:46:31,026 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 20:46:31,027 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-06-24 20:46:31,027 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 20:46:31,027 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2018-06-24 20:46:31,027 INFO ]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 7 [2018-06-24 20:46:31,028 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:31,028 INFO ]: Abstraction has 9 states and 13 transitions. [2018-06-24 20:46:31,028 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:46:31,028 INFO ]: Start isEmpty. Operand 9 states and 13 transitions. [2018-06-24 20:46:31,028 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:46:31,028 INFO ]: Found error trace [2018-06-24 20:46:31,028 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-24 20:46:31,028 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:31,028 INFO ]: Analyzing trace with hash -1212324788, now seen corresponding path program 2 times [2018-06-24 20:46:31,028 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:31,028 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:31,029 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:31,029 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:31,029 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:31,058 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:31,251 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:31,251 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:31,251 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-24 20:46:31,258 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:46:31,349 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:46:31,349 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:31,352 INFO ]: Computing forward predicates... [2018-06-24 20:46:31,514 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:31,552 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:31,552 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-24 20:46:31,553 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:46:31,553 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:46:31,553 INFO ]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:46:31,553 INFO ]: Start difference. First operand 9 states and 13 transitions. Second operand 7 states. [2018-06-24 20:46:31,942 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:31,942 INFO ]: Finished difference Result 13 states and 21 transitions. [2018-06-24 20:46:31,942 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:46:31,942 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-24 20:46:31,942 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:31,943 INFO ]: With dead ends: 13 [2018-06-24 20:46:31,943 INFO ]: Without dead ends: 13 [2018-06-24 20:46:31,943 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:46:31,943 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 20:46:31,944 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-06-24 20:46:31,945 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:46:31,945 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2018-06-24 20:46:31,945 INFO ]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 8 [2018-06-24 20:46:31,945 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:31,945 INFO ]: Abstraction has 11 states and 17 transitions. [2018-06-24 20:46:31,945 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:46:31,945 INFO ]: Start isEmpty. Operand 11 states and 17 transitions. [2018-06-24 20:46:31,945 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:46:31,945 INFO ]: Found error trace [2018-06-24 20:46:31,945 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:46:31,946 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:31,946 INFO ]: Analyzing trace with hash -1183695637, now seen corresponding path program 2 times [2018-06-24 20:46:31,946 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:31,946 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:31,947 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:31,947 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:31,947 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:31,960 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:32,000 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:32,000 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:32,000 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-24 20:46:32,008 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:46:32,048 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:46:32,048 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:32,050 INFO ]: Computing forward predicates... [2018-06-24 20:46:32,055 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:32,089 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:32,089 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 20:46:32,090 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:46:32,090 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:46:32,090 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:46:32,090 INFO ]: Start difference. First operand 11 states and 17 transitions. Second operand 5 states. [2018-06-24 20:46:32,182 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:32,182 INFO ]: Finished difference Result 14 states and 23 transitions. [2018-06-24 20:46:32,183 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:46:32,183 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-24 20:46:32,183 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:32,183 INFO ]: With dead ends: 14 [2018-06-24 20:46:32,183 INFO ]: Without dead ends: 14 [2018-06-24 20:46:32,183 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:46:32,184 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 20:46:32,185 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-06-24 20:46:32,185 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:46:32,185 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2018-06-24 20:46:32,185 INFO ]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 8 [2018-06-24 20:46:32,186 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:32,186 INFO ]: Abstraction has 11 states and 17 transitions. [2018-06-24 20:46:32,186 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:46:32,186 INFO ]: Start isEmpty. Operand 11 states and 17 transitions. [2018-06-24 20:46:32,186 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:46:32,186 INFO ]: Found error trace [2018-06-24 20:46:32,186 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:46:32,186 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:32,186 INFO ]: Analyzing trace with hash 1959756678, now seen corresponding path program 3 times [2018-06-24 20:46:32,186 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:32,186 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:32,187 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:32,187 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:32,187 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:32,204 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:32,525 INFO ]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:32,525 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:32,525 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) [2018-06-24 20:46:32,541 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:46:32,617 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 20:46:32,617 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:32,619 INFO ]: Computing forward predicates... [2018-06-24 20:46:32,629 INFO ]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:32,651 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:32,651 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-24 20:46:32,651 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:46:32,651 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:46:32,651 INFO ]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:46:32,652 INFO ]: Start difference. First operand 11 states and 17 transitions. Second operand 6 states. [2018-06-24 20:46:32,684 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:32,684 INFO ]: Finished difference Result 15 states and 25 transitions. [2018-06-24 20:46:32,685 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:46:32,685 INFO ]: Start accepts. Automaton has 6 states. Word has length 9 [2018-06-24 20:46:32,685 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:32,686 INFO ]: With dead ends: 15 [2018-06-24 20:46:32,686 INFO ]: Without dead ends: 15 [2018-06-24 20:46:32,686 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:46:32,686 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 20:46:32,688 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 11. [2018-06-24 20:46:32,688 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:46:32,688 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2018-06-24 20:46:32,688 INFO ]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 9 [2018-06-24 20:46:32,688 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:32,688 INFO ]: Abstraction has 11 states and 17 transitions. [2018-06-24 20:46:32,688 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:46:32,688 INFO ]: Start isEmpty. Operand 11 states and 17 transitions. [2018-06-24 20:46:32,689 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:46:32,689 INFO ]: Found error trace [2018-06-24 20:46:32,689 INFO ]: trace histogram [5, 1, 1, 1, 1, 1] [2018-06-24 20:46:32,689 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:32,689 INFO ]: Analyzing trace with hash -1120279700, now seen corresponding path program 3 times [2018-06-24 20:46:32,689 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:32,689 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:32,690 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:32,690 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:32,690 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:32,715 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:32,882 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:32,882 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:32,882 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:46:32,888 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:46:32,963 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 20:46:32,963 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:32,967 INFO ]: Computing forward predicates... [2018-06-24 20:46:33,304 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:33,331 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:33,331 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-24 20:46:33,331 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:46:33,332 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:46:33,332 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:46:33,332 INFO ]: Start difference. First operand 11 states and 17 transitions. Second operand 9 states. [2018-06-24 20:46:33,413 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:33,413 INFO ]: Finished difference Result 17 states and 29 transitions. [2018-06-24 20:46:33,414 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:46:33,414 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-24 20:46:33,414 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:33,414 INFO ]: With dead ends: 17 [2018-06-24 20:46:33,414 INFO ]: Without dead ends: 17 [2018-06-24 20:46:33,414 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:46:33,414 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 20:46:33,416 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 13. [2018-06-24 20:46:33,416 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:46:33,416 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2018-06-24 20:46:33,416 INFO ]: Start accepts. Automaton has 13 states and 21 transitions. Word has length 10 [2018-06-24 20:46:33,416 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:33,416 INFO ]: Abstraction has 13 states and 21 transitions. [2018-06-24 20:46:33,416 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:46:33,416 INFO ]: Start isEmpty. Operand 13 states and 21 transitions. [2018-06-24 20:46:33,417 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:46:33,417 INFO ]: Found error trace [2018-06-24 20:46:33,417 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:46:33,417 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:33,417 INFO ]: Analyzing trace with hash 622530635, now seen corresponding path program 4 times [2018-06-24 20:46:33,417 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:33,417 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:33,418 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:33,418 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:33,418 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:33,440 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:33,557 INFO ]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:33,558 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:33,558 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:46:33,567 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:46:33,600 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:46:33,600 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:33,602 INFO ]: Computing forward predicates... [2018-06-24 20:46:33,606 INFO ]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:33,626 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:33,626 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-24 20:46:33,626 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:46:33,626 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:46:33,626 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:46:33,626 INFO ]: Start difference. First operand 13 states and 21 transitions. Second operand 7 states. [2018-06-24 20:46:33,656 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:33,656 INFO ]: Finished difference Result 18 states and 31 transitions. [2018-06-24 20:46:33,656 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:46:33,656 INFO ]: Start accepts. Automaton has 7 states. Word has length 10 [2018-06-24 20:46:33,656 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:33,657 INFO ]: With dead ends: 18 [2018-06-24 20:46:33,657 INFO ]: Without dead ends: 18 [2018-06-24 20:46:33,657 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:46:33,657 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 20:46:33,658 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 13. [2018-06-24 20:46:33,658 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:46:33,659 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2018-06-24 20:46:33,659 INFO ]: Start accepts. Automaton has 13 states and 21 transitions. Word has length 10 [2018-06-24 20:46:33,659 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:33,659 INFO ]: Abstraction has 13 states and 21 transitions. [2018-06-24 20:46:33,659 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:46:33,659 INFO ]: Start isEmpty. Operand 13 states and 21 transitions. [2018-06-24 20:46:33,659 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:46:33,659 INFO ]: Found error trace [2018-06-24 20:46:33,659 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:46:33,660 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:33,660 INFO ]: Analyzing trace with hash 2118196262, now seen corresponding path program 5 times [2018-06-24 20:46:33,660 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:33,660 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:33,660 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:33,660 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:33,660 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:33,673 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:34,117 INFO ]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:34,117 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:34,117 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:46:34,124 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:46:34,227 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 20:46:34,227 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:34,229 INFO ]: Computing forward predicates... [2018-06-24 20:46:34,239 INFO ]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:34,263 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:34,263 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-24 20:46:34,263 INFO ]: Interpolant automaton has 8 states [2018-06-24 20:46:34,264 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 20:46:34,264 INFO ]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:46:34,264 INFO ]: Start difference. First operand 13 states and 21 transitions. Second operand 8 states. [2018-06-24 20:46:34,317 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:34,317 INFO ]: Finished difference Result 19 states and 33 transitions. [2018-06-24 20:46:34,317 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 20:46:34,317 INFO ]: Start accepts. Automaton has 8 states. Word has length 11 [2018-06-24 20:46:34,317 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:34,317 INFO ]: With dead ends: 19 [2018-06-24 20:46:34,317 INFO ]: Without dead ends: 19 [2018-06-24 20:46:34,318 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:46:34,318 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 20:46:34,319 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 13. [2018-06-24 20:46:34,319 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:46:34,319 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2018-06-24 20:46:34,319 INFO ]: Start accepts. Automaton has 13 states and 21 transitions. Word has length 11 [2018-06-24 20:46:34,319 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:34,319 INFO ]: Abstraction has 13 states and 21 transitions. [2018-06-24 20:46:34,320 INFO ]: Interpolant automaton has 8 states. [2018-06-24 20:46:34,320 INFO ]: Start isEmpty. Operand 13 states and 21 transitions. [2018-06-24 20:46:34,320 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:46:34,320 INFO ]: Found error trace [2018-06-24 20:46:34,320 INFO ]: trace histogram [7, 1, 1, 1, 1, 1] [2018-06-24 20:46:34,320 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:34,320 INFO ]: Analyzing trace with hash 1435703948, now seen corresponding path program 4 times [2018-06-24 20:46:34,320 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:34,320 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:34,321 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:34,321 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:34,321 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:34,350 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:34,536 INFO ]: Checked inductivity of 28 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 20:46:34,537 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:34,537 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 20:46:34,550 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:46:34,596 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:46:34,596 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:34,602 INFO ]: Computing forward predicates... [2018-06-24 20:46:35,106 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:35,137 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:35,137 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 12 [2018-06-24 20:46:35,137 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:46:35,137 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:46:35,137 INFO ]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:46:35,137 INFO ]: Start difference. First operand 13 states and 21 transitions. Second operand 12 states. [2018-06-24 20:46:35,303 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:35,303 INFO ]: Finished difference Result 21 states and 37 transitions. [2018-06-24 20:46:35,303 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:46:35,303 INFO ]: Start accepts. Automaton has 12 states. Word has length 12 [2018-06-24 20:46:35,303 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:35,303 INFO ]: With dead ends: 21 [2018-06-24 20:46:35,303 INFO ]: Without dead ends: 21 [2018-06-24 20:46:35,304 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:46:35,304 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 20:46:35,305 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 13. [2018-06-24 20:46:35,306 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:46:35,306 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2018-06-24 20:46:35,306 INFO ]: Start accepts. Automaton has 13 states and 21 transitions. Word has length 12 [2018-06-24 20:46:35,306 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:35,306 INFO ]: Abstraction has 13 states and 21 transitions. [2018-06-24 20:46:35,306 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:46:35,306 INFO ]: Start isEmpty. Operand 13 states and 21 transitions. [2018-06-24 20:46:35,306 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:46:35,306 INFO ]: Found error trace [2018-06-24 20:46:35,307 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:46:35,307 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:35,307 INFO ]: Analyzing trace with hash 1239190443, now seen corresponding path program 6 times [2018-06-24 20:46:35,307 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:35,307 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:35,307 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:35,307 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:35,308 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:35,325 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:35,437 INFO ]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:35,438 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:35,464 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:46:35,470 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:46:35,565 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-24 20:46:35,565 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:35,567 INFO ]: Computing forward predicates... [2018-06-24 20:46:35,574 INFO ]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:35,596 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:35,596 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-24 20:46:35,596 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:46:35,596 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:46:35,597 INFO ]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:46:35,597 INFO ]: Start difference. First operand 13 states and 21 transitions. Second operand 9 states. [2018-06-24 20:46:35,700 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:35,700 INFO ]: Finished difference Result 14 states and 23 transitions. [2018-06-24 20:46:35,700 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:46:35,700 INFO ]: Start accepts. Automaton has 9 states. Word has length 12 [2018-06-24 20:46:35,701 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:35,701 INFO ]: With dead ends: 14 [2018-06-24 20:46:35,701 INFO ]: Without dead ends: 14 [2018-06-24 20:46:35,701 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:46:35,701 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 20:46:35,703 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-24 20:46:35,703 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:46:35,703 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 23 transitions. [2018-06-24 20:46:35,704 INFO ]: Start accepts. Automaton has 14 states and 23 transitions. Word has length 12 [2018-06-24 20:46:35,704 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:35,704 INFO ]: Abstraction has 14 states and 23 transitions. [2018-06-24 20:46:35,704 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:46:35,704 INFO ]: Start isEmpty. Operand 14 states and 23 transitions. [2018-06-24 20:46:35,704 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:46:35,704 INFO ]: Found error trace [2018-06-24 20:46:35,704 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:46:35,704 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:35,705 INFO ]: Analyzing trace with hash -240186170, now seen corresponding path program 7 times [2018-06-24 20:46:35,705 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:35,705 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:35,705 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:35,705 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:35,705 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:35,719 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:35,883 INFO ]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:35,883 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:35,883 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:46:35,889 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:35,936 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:35,938 INFO ]: Computing forward predicates... [2018-06-24 20:46:35,947 INFO ]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:35,979 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:35,979 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-24 20:46:35,979 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:46:35,979 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:46:35,979 INFO ]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:46:35,979 INFO ]: Start difference. First operand 14 states and 23 transitions. Second operand 10 states. [2018-06-24 20:46:36,111 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:36,111 INFO ]: Finished difference Result 15 states and 25 transitions. [2018-06-24 20:46:36,111 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:46:36,111 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-24 20:46:36,111 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:36,112 INFO ]: With dead ends: 15 [2018-06-24 20:46:36,112 INFO ]: Without dead ends: 15 [2018-06-24 20:46:36,112 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:46:36,112 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 20:46:36,113 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-24 20:46:36,113 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 20:46:36,114 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 25 transitions. [2018-06-24 20:46:36,114 INFO ]: Start accepts. Automaton has 15 states and 25 transitions. Word has length 13 [2018-06-24 20:46:36,114 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:36,114 INFO ]: Abstraction has 15 states and 25 transitions. [2018-06-24 20:46:36,114 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:46:36,114 INFO ]: Start isEmpty. Operand 15 states and 25 transitions. [2018-06-24 20:46:36,114 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:46:36,114 INFO ]: Found error trace [2018-06-24 20:46:36,114 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1] [2018-06-24 20:46:36,115 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:36,115 INFO ]: Analyzing trace with hash 1143779083, now seen corresponding path program 8 times [2018-06-24 20:46:36,115 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:36,115 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:36,115 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:36,115 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:36,115 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:36,129 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:36,314 INFO ]: Checked inductivity of 45 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:36,314 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:36,314 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:46:36,321 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:46:36,361 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:46:36,361 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:36,363 INFO ]: Computing forward predicates... [2018-06-24 20:46:36,371 INFO ]: Checked inductivity of 45 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:36,403 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:36,404 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-24 20:46:36,404 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:46:36,404 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:46:36,404 INFO ]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:46:36,404 INFO ]: Start difference. First operand 15 states and 25 transitions. Second operand 11 states. [2018-06-24 20:46:36,471 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:36,471 INFO ]: Finished difference Result 16 states and 27 transitions. [2018-06-24 20:46:36,471 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:46:36,471 INFO ]: Start accepts. Automaton has 11 states. Word has length 14 [2018-06-24 20:46:36,471 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:36,472 INFO ]: With dead ends: 16 [2018-06-24 20:46:36,472 INFO ]: Without dead ends: 16 [2018-06-24 20:46:36,472 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:46:36,472 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 20:46:36,473 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-24 20:46:36,473 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:46:36,474 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 27 transitions. [2018-06-24 20:46:36,474 INFO ]: Start accepts. Automaton has 16 states and 27 transitions. Word has length 14 [2018-06-24 20:46:36,474 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:36,474 INFO ]: Abstraction has 16 states and 27 transitions. [2018-06-24 20:46:36,474 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:46:36,474 INFO ]: Start isEmpty. Operand 16 states and 27 transitions. [2018-06-24 20:46:36,474 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:46:36,474 INFO ]: Found error trace [2018-06-24 20:46:36,474 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:46:36,475 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:36,475 INFO ]: Analyzing trace with hash 1097028966, now seen corresponding path program 9 times [2018-06-24 20:46:36,475 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:36,475 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:36,475 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:36,475 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:36,475 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:36,490 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:36,829 INFO ]: Checked inductivity of 55 backedges. 10 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:36,829 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:36,829 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:46:36,836 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:46:36,922 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 20:46:36,922 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:36,924 INFO ]: Computing forward predicates... [2018-06-24 20:46:36,935 INFO ]: Checked inductivity of 55 backedges. 10 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:36,963 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:36,963 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-24 20:46:36,963 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:46:36,963 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:46:36,963 INFO ]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:46:36,963 INFO ]: Start difference. First operand 16 states and 27 transitions. Second operand 12 states. [2018-06-24 20:46:36,994 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:36,995 INFO ]: Finished difference Result 17 states and 29 transitions. [2018-06-24 20:46:36,995 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:46:36,995 INFO ]: Start accepts. Automaton has 12 states. Word has length 15 [2018-06-24 20:46:36,995 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:36,995 INFO ]: With dead ends: 17 [2018-06-24 20:46:36,995 INFO ]: Without dead ends: 17 [2018-06-24 20:46:36,996 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:46:36,996 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 20:46:36,997 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-24 20:46:36,997 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 20:46:36,997 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2018-06-24 20:46:36,997 INFO ]: Start accepts. Automaton has 17 states and 29 transitions. Word has length 15 [2018-06-24 20:46:36,998 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:36,998 INFO ]: Abstraction has 17 states and 29 transitions. [2018-06-24 20:46:36,998 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:46:36,998 INFO ]: Start isEmpty. Operand 17 states and 29 transitions. [2018-06-24 20:46:36,998 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:46:36,998 INFO ]: Found error trace [2018-06-24 20:46:36,998 INFO ]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2018-06-24 20:46:36,998 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:36,998 INFO ]: Analyzing trace with hash -352224661, now seen corresponding path program 10 times [2018-06-24 20:46:36,998 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:36,998 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:36,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:36,999 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:36,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:37,029 INFO ]: Conjunction of SSA is sat [2018-06-24 20:46:37,033 INFO ]: Counterexample might be feasible [2018-06-24 20:46:37,047 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:46:37,048 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:46:37 BasicIcfg [2018-06-24 20:46:37,048 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:46:37,049 INFO ]: Toolchain (without parser) took 7831.37 ms. Allocated memory was 308.8 MB in the beginning and 377.0 MB in the end (delta: 68.2 MB). Free memory was 265.2 MB in the beginning and 278.6 MB in the end (delta: -13.4 MB). Peak memory consumption was 54.7 MB. Max. memory is 3.6 GB. [2018-06-24 20:46:37,050 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:46:37,050 INFO ]: ChcToBoogie took 54.21 ms. Allocated memory is still 308.8 MB. Free memory was 265.2 MB in the beginning and 261.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:46:37,051 INFO ]: Boogie Preprocessor took 36.48 ms. Allocated memory is still 308.8 MB. Free memory is still 261.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:46:37,051 INFO ]: RCFGBuilder took 272.01 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 253.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:46:37,052 INFO ]: BlockEncodingV2 took 92.56 ms. Allocated memory is still 308.8 MB. Free memory was 253.2 MB in the beginning and 249.3 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:46:37,052 INFO ]: TraceAbstraction took 7367.18 ms. Allocated memory was 308.8 MB in the beginning and 377.0 MB in the end (delta: 68.2 MB). Free memory was 249.3 MB in the beginning and 278.6 MB in the end (delta: -29.4 MB). Peak memory consumption was 38.8 MB. Max. memory is 3.6 GB. [2018-06-24 20:46:37,055 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 11 locations, 12 edges - StatisticsResult: Encoded RCFG 6 locations, 7 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 54.21 ms. Allocated memory is still 308.8 MB. Free memory was 265.2 MB in the beginning and 261.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 36.48 ms. Allocated memory is still 308.8 MB. Free memory is still 261.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 272.01 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 253.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 92.56 ms. Allocated memory is still 308.8 MB. Free memory was 253.2 MB in the beginning and 249.3 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 7367.18 ms. Allocated memory was 308.8 MB in the beginning and 377.0 MB in the end (delta: 68.2 MB). Free memory was 249.3 MB in the beginning and 278.6 MB in the end (delta: -29.4 MB). Peak memory consumption was 38.8 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, 0, 0, 0, 0, 0, 0, 0); [L0] assume !(hbv_False_1_Int == hbv_False_2_Int); [L0] hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hhv_inv_main15_2_Int, hhv_inv_main15_3_Int, hhv_inv_main15_4_Int, hhv_inv_main15_5_Int, hhv_inv_main15_6_Int := hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int, hbv_False_7_Int, hbv_False_1_Int, hbv_False_2_Int; [L0] havoc hbv_False_1_Int, hbv_False_7_Int, hbv_False_5_Int, hbv_False_2_Int, hbv_False_4_Int, hbv_False_6_Int, hbv_False_3_Int; [L0] assume (((((hhv_inv_main15_4_Int == 10 && hhv_inv_main15_3_Int == 5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int) && 0 <= hhv_inv_main15_0_Int + -1 * (hbv_inv_main15_1_Int + 1) + -1) && hhv_inv_main15_6_Int == hbv_inv_main15_3_Int + 10) && hhv_inv_main15_2_Int == hbv_inv_main15_1_Int + 1) && hhv_inv_main15_5_Int == hbv_inv_main15_2_Int + (5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int)) && hbv_inv_main15_1_Int == 10; [L0] hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hhv_inv_main15_2_Int, hhv_inv_main15_3_Int, hhv_inv_main15_4_Int, hhv_inv_main15_5_Int, hhv_inv_main15_6_Int := hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hbv_inv_main15_1_Int, hbv_inv_main15_4_Int, hbv_inv_main15_5_Int, hbv_inv_main15_2_Int, hbv_inv_main15_3_Int; [L0] havoc hbv_inv_main15_3_Int, hbv_inv_main15_5_Int, hbv_inv_main15_2_Int, hbv_inv_main15_4_Int, hbv_inv_main15_1_Int; [L0] assume (((((hhv_inv_main15_3_Int == 5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int && hhv_inv_main15_5_Int == hbv_inv_main15_3_Int + (5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int)) && hhv_inv_main15_6_Int == hbv_inv_main15_4_Int + (hbv_inv_main15_2_Int + 5)) && 0 <= hhv_inv_main15_0_Int + -1 * (hbv_inv_main15_1_Int + 1) + -1) && hhv_inv_main15_4_Int == hbv_inv_main15_2_Int + 5) && hhv_inv_main15_2_Int == hbv_inv_main15_1_Int + 1) && !(hbv_inv_main15_1_Int == 10); [L0] hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hhv_inv_main15_2_Int, hhv_inv_main15_3_Int, hhv_inv_main15_4_Int, hhv_inv_main15_5_Int, hhv_inv_main15_6_Int := hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hbv_inv_main15_1_Int, hbv_inv_main15_5_Int, hbv_inv_main15_2_Int, hbv_inv_main15_3_Int, hbv_inv_main15_4_Int; [L0] havoc hbv_inv_main15_3_Int, hbv_inv_main15_5_Int, hbv_inv_main15_2_Int, hbv_inv_main15_4_Int, hbv_inv_main15_1_Int; [L0] assume (((((hhv_inv_main15_3_Int == 5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int && hhv_inv_main15_5_Int == hbv_inv_main15_3_Int + (5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int)) && hhv_inv_main15_6_Int == hbv_inv_main15_4_Int + (hbv_inv_main15_2_Int + 5)) && 0 <= hhv_inv_main15_0_Int + -1 * (hbv_inv_main15_1_Int + 1) + -1) && hhv_inv_main15_4_Int == hbv_inv_main15_2_Int + 5) && hhv_inv_main15_2_Int == hbv_inv_main15_1_Int + 1) && !(hbv_inv_main15_1_Int == 10); [L0] hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hhv_inv_main15_2_Int, hhv_inv_main15_3_Int, hhv_inv_main15_4_Int, hhv_inv_main15_5_Int, hhv_inv_main15_6_Int := hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hbv_inv_main15_1_Int, hbv_inv_main15_5_Int, hbv_inv_main15_2_Int, hbv_inv_main15_3_Int, hbv_inv_main15_4_Int; [L0] havoc hbv_inv_main15_3_Int, hbv_inv_main15_5_Int, hbv_inv_main15_2_Int, hbv_inv_main15_4_Int, hbv_inv_main15_1_Int; [L0] assume (((((hhv_inv_main15_3_Int == 5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int && hhv_inv_main15_5_Int == hbv_inv_main15_3_Int + (5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int)) && hhv_inv_main15_6_Int == hbv_inv_main15_4_Int + (hbv_inv_main15_2_Int + 5)) && 0 <= hhv_inv_main15_0_Int + -1 * (hbv_inv_main15_1_Int + 1) + -1) && hhv_inv_main15_4_Int == hbv_inv_main15_2_Int + 5) && hhv_inv_main15_2_Int == hbv_inv_main15_1_Int + 1) && !(hbv_inv_main15_1_Int == 10); [L0] hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hhv_inv_main15_2_Int, hhv_inv_main15_3_Int, hhv_inv_main15_4_Int, hhv_inv_main15_5_Int, hhv_inv_main15_6_Int := hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hbv_inv_main15_1_Int, hbv_inv_main15_5_Int, hbv_inv_main15_2_Int, hbv_inv_main15_3_Int, hbv_inv_main15_4_Int; [L0] havoc hbv_inv_main15_3_Int, hbv_inv_main15_5_Int, hbv_inv_main15_2_Int, hbv_inv_main15_4_Int, hbv_inv_main15_1_Int; [L0] assume (((((hhv_inv_main15_3_Int == 5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int && hhv_inv_main15_5_Int == hbv_inv_main15_3_Int + (5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int)) && hhv_inv_main15_6_Int == hbv_inv_main15_4_Int + (hbv_inv_main15_2_Int + 5)) && 0 <= hhv_inv_main15_0_Int + -1 * (hbv_inv_main15_1_Int + 1) + -1) && hhv_inv_main15_4_Int == hbv_inv_main15_2_Int + 5) && hhv_inv_main15_2_Int == hbv_inv_main15_1_Int + 1) && !(hbv_inv_main15_1_Int == 10); [L0] hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hhv_inv_main15_2_Int, hhv_inv_main15_3_Int, hhv_inv_main15_4_Int, hhv_inv_main15_5_Int, hhv_inv_main15_6_Int := hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hbv_inv_main15_1_Int, hbv_inv_main15_5_Int, hbv_inv_main15_2_Int, hbv_inv_main15_3_Int, hbv_inv_main15_4_Int; [L0] havoc hbv_inv_main15_3_Int, hbv_inv_main15_5_Int, hbv_inv_main15_2_Int, hbv_inv_main15_4_Int, hbv_inv_main15_1_Int; [L0] assume (((((hhv_inv_main15_3_Int == 5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int && hhv_inv_main15_5_Int == hbv_inv_main15_3_Int + (5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int)) && hhv_inv_main15_6_Int == hbv_inv_main15_4_Int + (hbv_inv_main15_2_Int + 5)) && 0 <= hhv_inv_main15_0_Int + -1 * (hbv_inv_main15_1_Int + 1) + -1) && hhv_inv_main15_4_Int == hbv_inv_main15_2_Int + 5) && hhv_inv_main15_2_Int == hbv_inv_main15_1_Int + 1) && !(hbv_inv_main15_1_Int == 10); [L0] hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hhv_inv_main15_2_Int, hhv_inv_main15_3_Int, hhv_inv_main15_4_Int, hhv_inv_main15_5_Int, hhv_inv_main15_6_Int := hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hbv_inv_main15_1_Int, hbv_inv_main15_5_Int, hbv_inv_main15_2_Int, hbv_inv_main15_3_Int, hbv_inv_main15_4_Int; [L0] havoc hbv_inv_main15_3_Int, hbv_inv_main15_5_Int, hbv_inv_main15_2_Int, hbv_inv_main15_4_Int, hbv_inv_main15_1_Int; [L0] assume (((((hhv_inv_main15_3_Int == 5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int && hhv_inv_main15_5_Int == hbv_inv_main15_3_Int + (5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int)) && hhv_inv_main15_6_Int == hbv_inv_main15_4_Int + (hbv_inv_main15_2_Int + 5)) && 0 <= hhv_inv_main15_0_Int + -1 * (hbv_inv_main15_1_Int + 1) + -1) && hhv_inv_main15_4_Int == hbv_inv_main15_2_Int + 5) && hhv_inv_main15_2_Int == hbv_inv_main15_1_Int + 1) && !(hbv_inv_main15_1_Int == 10); [L0] hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hhv_inv_main15_2_Int, hhv_inv_main15_3_Int, hhv_inv_main15_4_Int, hhv_inv_main15_5_Int, hhv_inv_main15_6_Int := hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hbv_inv_main15_1_Int, hbv_inv_main15_5_Int, hbv_inv_main15_2_Int, hbv_inv_main15_3_Int, hbv_inv_main15_4_Int; [L0] havoc hbv_inv_main15_3_Int, hbv_inv_main15_5_Int, hbv_inv_main15_2_Int, hbv_inv_main15_4_Int, hbv_inv_main15_1_Int; [L0] assume (((((hhv_inv_main15_3_Int == 5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int && hhv_inv_main15_5_Int == hbv_inv_main15_3_Int + (5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int)) && hhv_inv_main15_6_Int == hbv_inv_main15_4_Int + (hbv_inv_main15_2_Int + 5)) && 0 <= hhv_inv_main15_0_Int + -1 * (hbv_inv_main15_1_Int + 1) + -1) && hhv_inv_main15_4_Int == hbv_inv_main15_2_Int + 5) && hhv_inv_main15_2_Int == hbv_inv_main15_1_Int + 1) && !(hbv_inv_main15_1_Int == 10); [L0] hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hhv_inv_main15_2_Int, hhv_inv_main15_3_Int, hhv_inv_main15_4_Int, hhv_inv_main15_5_Int, hhv_inv_main15_6_Int := hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hbv_inv_main15_1_Int, hbv_inv_main15_5_Int, hbv_inv_main15_2_Int, hbv_inv_main15_3_Int, hbv_inv_main15_4_Int; [L0] havoc hbv_inv_main15_3_Int, hbv_inv_main15_5_Int, hbv_inv_main15_2_Int, hbv_inv_main15_4_Int, hbv_inv_main15_1_Int; [L0] assume (((((hhv_inv_main15_3_Int == 5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int && hhv_inv_main15_5_Int == hbv_inv_main15_3_Int + (5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int)) && hhv_inv_main15_6_Int == hbv_inv_main15_4_Int + (hbv_inv_main15_2_Int + 5)) && 0 <= hhv_inv_main15_0_Int + -1 * (hbv_inv_main15_1_Int + 1) + -1) && hhv_inv_main15_4_Int == hbv_inv_main15_2_Int + 5) && hhv_inv_main15_2_Int == hbv_inv_main15_1_Int + 1) && !(hbv_inv_main15_1_Int == 10); [L0] hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hhv_inv_main15_2_Int, hhv_inv_main15_3_Int, hhv_inv_main15_4_Int, hhv_inv_main15_5_Int, hhv_inv_main15_6_Int := hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hbv_inv_main15_1_Int, hbv_inv_main15_5_Int, hbv_inv_main15_2_Int, hbv_inv_main15_3_Int, hbv_inv_main15_4_Int; [L0] havoc hbv_inv_main15_3_Int, hbv_inv_main15_5_Int, hbv_inv_main15_2_Int, hbv_inv_main15_4_Int, hbv_inv_main15_1_Int; [L0] assume (((((hhv_inv_main15_3_Int == 5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int && hhv_inv_main15_5_Int == hbv_inv_main15_3_Int + (5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int)) && hhv_inv_main15_6_Int == hbv_inv_main15_4_Int + (hbv_inv_main15_2_Int + 5)) && 0 <= hhv_inv_main15_0_Int + -1 * (hbv_inv_main15_1_Int + 1) + -1) && hhv_inv_main15_4_Int == hbv_inv_main15_2_Int + 5) && hhv_inv_main15_2_Int == hbv_inv_main15_1_Int + 1) && !(hbv_inv_main15_1_Int == 10); [L0] hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hhv_inv_main15_2_Int, hhv_inv_main15_3_Int, hhv_inv_main15_4_Int, hhv_inv_main15_5_Int, hhv_inv_main15_6_Int := hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hbv_inv_main15_1_Int, hbv_inv_main15_5_Int, hbv_inv_main15_2_Int, hbv_inv_main15_3_Int, hbv_inv_main15_4_Int; [L0] havoc hbv_inv_main15_3_Int, hbv_inv_main15_5_Int, hbv_inv_main15_2_Int, hbv_inv_main15_4_Int, hbv_inv_main15_1_Int; [L0] assume (((((hhv_inv_main15_3_Int == 5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int && hhv_inv_main15_5_Int == hbv_inv_main15_3_Int + (5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int)) && hhv_inv_main15_6_Int == hbv_inv_main15_4_Int + (hbv_inv_main15_2_Int + 5)) && 0 <= hhv_inv_main15_0_Int + -1 * (hbv_inv_main15_1_Int + 1) + -1) && hhv_inv_main15_4_Int == hbv_inv_main15_2_Int + 5) && hhv_inv_main15_2_Int == hbv_inv_main15_1_Int + 1) && !(hbv_inv_main15_1_Int == 10); [L0] hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hhv_inv_main15_2_Int, hhv_inv_main15_3_Int, hhv_inv_main15_4_Int, hhv_inv_main15_5_Int, hhv_inv_main15_6_Int := hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hbv_inv_main15_1_Int, hbv_inv_main15_5_Int, hbv_inv_main15_2_Int, hbv_inv_main15_3_Int, hbv_inv_main15_4_Int; [L0] havoc hbv_inv_main15_3_Int, hbv_inv_main15_5_Int, hbv_inv_main15_2_Int, hbv_inv_main15_4_Int, hbv_inv_main15_1_Int; [L0] RET call gotoProc(0, 0, 0, 0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. UNSAFE Result, 7.3s OverallTime, 15 OverallIterations, 10 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 88 SDtfs, 0 SDslu, 147 SDs, 0 SdLazy, 460 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 138 SyntacticMatches, 7 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=14, 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, 14 MinimizatonAttempts, 34 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 248 ConstructedInterpolants, 0 QuantifiedInterpolants, 13615 SizeOfPredicates, 29 NumberOfNonLiveVariables, 2661 ConjunctsInSsa, 441 ConjunctsInUnsatCore, 27 InterpolantComputations, 1 PerfectInterpolantSequences, 118/538 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/barthe_merged_unsafe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-46-37-070.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/barthe_merged_unsafe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-46-37-070.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/barthe_merged_unsafe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-46-37-070.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/barthe_merged_unsafe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-46-37-070.csv Received shutdown request...