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/hopv/lia/mochi/a-copy-print.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:12:12,203 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:12:12,206 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:12:12,217 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:12:12,217 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:12:12,218 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:12:12,219 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:12:12,221 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:12:12,222 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:12:12,223 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:12:12,224 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:12:12,224 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:12:12,225 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:12:12,226 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:12:12,227 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:12:12,227 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:12:12,229 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:12:12,231 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:12:12,233 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:12:12,234 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:12:12,235 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:12:12,237 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:12:12,238 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:12:12,238 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:12:12,239 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:12:12,240 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:12:12,241 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:12:12,241 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:12:12,243 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:12:12,243 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:12:12,244 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:12:12,244 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:12:12,245 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:12:12,245 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:12:12,246 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:12:12,247 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 21:12:12,262 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:12:12,262 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:12:12,263 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:12:12,263 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:12:12,264 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:12:12,264 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:12:12,264 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:12:12,265 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:12:12,265 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:12:12,265 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:12:12,265 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:12:12,266 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:12:12,266 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:12:12,266 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:12:12,266 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:12:12,266 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:12:12,267 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:12:12,267 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:12:12,267 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:12:12,267 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:12:12,268 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:12:12,269 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:12:12,269 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:12:12,324 INFO ]: Repository-Root is: /tmp [2018-06-24 21:12:12,344 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:12:12,349 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:12:12,351 INFO ]: Initializing SmtParser... [2018-06-24 21:12:12,351 INFO ]: SmtParser initialized [2018-06-24 21:12:12,351 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/a-copy-print.smt2 [2018-06-24 21:12:12,353 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 21:12:12,429 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/a-copy-print.smt2 unknown [2018-06-24 21:12:12,964 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/a-copy-print.smt2 [2018-06-24 21:12:12,969 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:12:12,975 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:12:12,976 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:12:12,976 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:12:12,976 INFO ]: ChcToBoogie initialized [2018-06-24 21:12:12,979 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:12:12" (1/1) ... [2018-06-24 21:12:13,059 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:12:13 Unit [2018-06-24 21:12:13,059 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:12:13,060 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:12:13,060 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:12:13,060 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:12:13,079 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:12:13" (1/1) ... [2018-06-24 21:12:13,079 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:12:13" (1/1) ... [2018-06-24 21:12:13,101 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:12:13" (1/1) ... [2018-06-24 21:12:13,101 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:12:13" (1/1) ... [2018-06-24 21:12:13,125 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:12:13" (1/1) ... [2018-06-24 21:12:13,139 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:12:13" (1/1) ... [2018-06-24 21:12:13,141 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:12:13" (1/1) ... [2018-06-24 21:12:13,146 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:12:13,146 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:12:13,146 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:12:13,146 INFO ]: RCFGBuilder initialized [2018-06-24 21:12:13,155 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:12:13" (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 21:12:13,178 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:12:13,178 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:12:13,178 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:12:13,178 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:12:13,178 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:12:13,178 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 21:12:14,398 INFO ]: Using library mode [2018-06-24 21:12:14,398 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:12:14 BoogieIcfgContainer [2018-06-24 21:12:14,398 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:12:14,399 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:12:14,399 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:12:14,400 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:12:14,400 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:12:14" (1/1) ... [2018-06-24 21:12:14,448 INFO ]: Initial Icfg 171 locations, 285 edges [2018-06-24 21:12:14,450 INFO ]: Using Remove infeasible edges [2018-06-24 21:12:14,450 INFO ]: Using Maximize final states [2018-06-24 21:12:14,451 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:12:14,451 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:12:14,453 INFO ]: Using Remove sink states [2018-06-24 21:12:14,454 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:12:14,454 INFO ]: Using Use SBE [2018-06-24 21:12:14,505 INFO ]: SBE split 1 edges [2018-06-24 21:12:14,512 INFO ]: Removed 5 edges and 2 locations because of local infeasibility [2018-06-24 21:12:14,514 INFO ]: 0 new accepting states [2018-06-24 21:12:16,558 INFO ]: Removed 247 edges and 48 locations by large block encoding [2018-06-24 21:12:16,561 INFO ]: Removed 6 edges and 4 locations by removing sink states [2018-06-24 21:12:16,563 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:12:16,564 INFO ]: 0 new accepting states [2018-06-24 21:12:16,565 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:12:16,566 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:12:16,567 INFO ]: Encoded RCFG 117 locations, 234 edges [2018-06-24 21:12:16,568 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:12:16 BasicIcfg [2018-06-24 21:12:16,568 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:12:16,569 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:12:16,569 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:12:16,572 INFO ]: TraceAbstraction initialized [2018-06-24 21:12:16,572 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:12:12" (1/4) ... [2018-06-24 21:12:16,573 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c97081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:12:16, skipping insertion in model container [2018-06-24 21:12:16,573 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:12:13" (2/4) ... [2018-06-24 21:12:16,573 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c97081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:12:16, skipping insertion in model container [2018-06-24 21:12:16,573 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:12:14" (3/4) ... [2018-06-24 21:12:16,574 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c97081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:12:16, skipping insertion in model container [2018-06-24 21:12:16,574 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:12:16" (4/4) ... [2018-06-24 21:12:16,575 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:12:16,584 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:12:16,592 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:12:16,634 INFO ]: Using default assertion order modulation [2018-06-24 21:12:16,634 INFO ]: Interprodecural is true [2018-06-24 21:12:16,634 INFO ]: Hoare is false [2018-06-24 21:12:16,634 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:12:16,634 INFO ]: Backedges is TWOTRACK [2018-06-24 21:12:16,634 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:12:16,634 INFO ]: Difference is false [2018-06-24 21:12:16,634 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:12:16,634 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:12:16,646 INFO ]: Start isEmpty. Operand 117 states. [2018-06-24 21:12:16,685 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-24 21:12:16,685 INFO ]: Found error trace [2018-06-24 21:12:16,686 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-24 21:12:16,686 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:12:16,691 INFO ]: Analyzing trace with hash 6312096, now seen corresponding path program 1 times [2018-06-24 21:12:16,693 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:12:16,693 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:12:16,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:16,739 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:12:16,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:16,775 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:12:16,867 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:12:16,869 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:12:16,995 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:12:16,997 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:12:17,008 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:12:17,009 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:12:17,011 INFO ]: Start difference. First operand 117 states. Second operand 3 states. [2018-06-24 21:12:17,946 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:12:17,946 INFO ]: Finished difference Result 184 states and 353 transitions. [2018-06-24 21:12:17,946 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:12:17,947 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-24 21:12:17,948 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:12:17,982 INFO ]: With dead ends: 184 [2018-06-24 21:12:17,982 INFO ]: Without dead ends: 180 [2018-06-24 21:12:17,984 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 21:12:18,002 INFO ]: Start minimizeSevpa. Operand 180 states. [2018-06-24 21:12:18,087 INFO ]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-06-24 21:12:18,088 INFO ]: Start removeUnreachable. Operand 180 states. [2018-06-24 21:12:18,099 INFO ]: Finished removeUnreachable. Reduced from 180 states to 180 states and 345 transitions. [2018-06-24 21:12:18,101 INFO ]: Start accepts. Automaton has 180 states and 345 transitions. Word has length 4 [2018-06-24 21:12:18,102 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:12:18,102 INFO ]: Abstraction has 180 states and 345 transitions. [2018-06-24 21:12:18,102 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:12:18,102 INFO ]: Start isEmpty. Operand 180 states and 345 transitions. [2018-06-24 21:12:18,111 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-24 21:12:18,111 INFO ]: Found error trace [2018-06-24 21:12:18,111 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-24 21:12:18,111 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:12:18,112 INFO ]: Analyzing trace with hash 6318823, now seen corresponding path program 1 times [2018-06-24 21:12:18,112 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:12:18,112 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:12:18,112 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:18,112 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:12:18,112 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:18,116 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:12:18,165 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:12:18,165 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:12:18,165 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:12:18,167 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:12:18,167 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:12:18,167 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:12:18,167 INFO ]: Start difference. First operand 180 states and 345 transitions. Second operand 3 states. [2018-06-24 21:12:19,402 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:12:19,402 INFO ]: Finished difference Result 245 states and 462 transitions. [2018-06-24 21:12:19,403 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:12:19,403 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-24 21:12:19,403 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:12:19,423 INFO ]: With dead ends: 245 [2018-06-24 21:12:19,424 INFO ]: Without dead ends: 245 [2018-06-24 21:12:19,424 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 21:12:19,425 INFO ]: Start minimizeSevpa. Operand 245 states. [2018-06-24 21:12:19,465 INFO ]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-06-24 21:12:19,465 INFO ]: Start removeUnreachable. Operand 245 states. [2018-06-24 21:12:19,475 INFO ]: Finished removeUnreachable. Reduced from 245 states to 245 states and 462 transitions. [2018-06-24 21:12:19,475 INFO ]: Start accepts. Automaton has 245 states and 462 transitions. Word has length 4 [2018-06-24 21:12:19,475 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:12:19,475 INFO ]: Abstraction has 245 states and 462 transitions. [2018-06-24 21:12:19,475 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:12:19,476 INFO ]: Start isEmpty. Operand 245 states and 462 transitions. [2018-06-24 21:12:19,480 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:12:19,480 INFO ]: Found error trace [2018-06-24 21:12:19,480 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:12:19,480 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:12:19,481 INFO ]: Analyzing trace with hash 198884003, now seen corresponding path program 1 times [2018-06-24 21:12:19,481 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:12:19,481 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:12:19,481 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:19,481 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:12:19,481 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:19,488 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:12:19,549 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:12:19,549 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:12:19,549 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:12:19,549 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:12:19,549 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:12:19,549 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:12:19,549 INFO ]: Start difference. First operand 245 states and 462 transitions. Second operand 3 states. [2018-06-24 21:12:20,072 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:12:20,072 INFO ]: Finished difference Result 310 states and 584 transitions. [2018-06-24 21:12:20,073 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:12:20,073 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:12:20,073 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:12:20,096 INFO ]: With dead ends: 310 [2018-06-24 21:12:20,096 INFO ]: Without dead ends: 310 [2018-06-24 21:12:20,097 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 21:12:20,097 INFO ]: Start minimizeSevpa. Operand 310 states. [2018-06-24 21:12:20,143 INFO ]: Finished minimizeSevpa. Reduced states from 310 to 310. [2018-06-24 21:12:20,143 INFO ]: Start removeUnreachable. Operand 310 states. [2018-06-24 21:12:20,156 INFO ]: Finished removeUnreachable. Reduced from 310 states to 310 states and 584 transitions. [2018-06-24 21:12:20,156 INFO ]: Start accepts. Automaton has 310 states and 584 transitions. Word has length 5 [2018-06-24 21:12:20,156 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:12:20,156 INFO ]: Abstraction has 310 states and 584 transitions. [2018-06-24 21:12:20,156 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:12:20,156 INFO ]: Start isEmpty. Operand 310 states and 584 transitions. [2018-06-24 21:12:20,163 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:12:20,163 INFO ]: Found error trace [2018-06-24 21:12:20,163 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:12:20,163 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:12:20,163 INFO ]: Analyzing trace with hash 201027994, now seen corresponding path program 1 times [2018-06-24 21:12:20,163 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:12:20,163 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:12:20,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:20,164 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:12:20,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:20,180 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:12:20,245 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:12:20,245 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:12:20,246 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:12:20,246 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:12:20,246 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:12:20,246 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:12:20,246 INFO ]: Start difference. First operand 310 states and 584 transitions. Second operand 3 states. [2018-06-24 21:12:20,645 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:12:20,645 INFO ]: Finished difference Result 375 states and 725 transitions. [2018-06-24 21:12:20,646 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:12:20,646 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:12:20,646 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:12:20,671 INFO ]: With dead ends: 375 [2018-06-24 21:12:20,671 INFO ]: Without dead ends: 375 [2018-06-24 21:12:20,671 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 21:12:20,672 INFO ]: Start minimizeSevpa. Operand 375 states. [2018-06-24 21:12:20,738 INFO ]: Finished minimizeSevpa. Reduced states from 375 to 375. [2018-06-24 21:12:20,738 INFO ]: Start removeUnreachable. Operand 375 states. [2018-06-24 21:12:20,749 INFO ]: Finished removeUnreachable. Reduced from 375 states to 375 states and 725 transitions. [2018-06-24 21:12:20,750 INFO ]: Start accepts. Automaton has 375 states and 725 transitions. Word has length 5 [2018-06-24 21:12:20,750 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:12:20,750 INFO ]: Abstraction has 375 states and 725 transitions. [2018-06-24 21:12:20,750 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:12:20,750 INFO ]: Start isEmpty. Operand 375 states and 725 transitions. [2018-06-24 21:12:20,770 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:12:20,770 INFO ]: Found error trace [2018-06-24 21:12:20,770 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:12:20,770 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:12:20,770 INFO ]: Analyzing trace with hash -1285311552, now seen corresponding path program 1 times [2018-06-24 21:12:20,770 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:12:20,770 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:12:20,771 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:20,771 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:12:20,771 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:20,778 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:12:20,837 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:12:20,837 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:12:20,837 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:12:20,837 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:12:20,837 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:12:20,837 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:12:20,837 INFO ]: Start difference. First operand 375 states and 725 transitions. Second operand 3 states. [2018-06-24 21:12:21,323 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:12:21,323 INFO ]: Finished difference Result 440 states and 868 transitions. [2018-06-24 21:12:21,323 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:12:21,323 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-24 21:12:21,323 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:12:21,356 INFO ]: With dead ends: 440 [2018-06-24 21:12:21,356 INFO ]: Without dead ends: 440 [2018-06-24 21:12:21,356 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 21:12:21,357 INFO ]: Start minimizeSevpa. Operand 440 states. [2018-06-24 21:12:21,399 INFO ]: Finished minimizeSevpa. Reduced states from 440 to 440. [2018-06-24 21:12:21,399 INFO ]: Start removeUnreachable. Operand 440 states. [2018-06-24 21:12:21,416 INFO ]: Finished removeUnreachable. Reduced from 440 states to 440 states and 868 transitions. [2018-06-24 21:12:21,416 INFO ]: Start accepts. Automaton has 440 states and 868 transitions. Word has length 11 [2018-06-24 21:12:21,416 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:12:21,416 INFO ]: Abstraction has 440 states and 868 transitions. [2018-06-24 21:12:21,416 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:12:21,416 INFO ]: Start isEmpty. Operand 440 states and 868 transitions. [2018-06-24 21:12:21,441 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:12:21,441 INFO ]: Found error trace [2018-06-24 21:12:21,441 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:12:21,441 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:12:21,442 INFO ]: Analyzing trace with hash -1923650546, now seen corresponding path program 1 times [2018-06-24 21:12:21,442 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:12:21,442 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:12:21,443 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:21,443 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:12:21,443 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:21,473 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:12:21,655 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:12:21,655 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:12:21,655 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-24 21:12:21,656 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:12:21,656 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:12:21,656 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:12:21,656 INFO ]: Start difference. First operand 440 states and 868 transitions. Second operand 8 states. [2018-06-24 21:12:24,871 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:12:24,872 INFO ]: Finished difference Result 2566 states and 14963 transitions. [2018-06-24 21:12:24,873 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 21:12:24,873 INFO ]: Start accepts. Automaton has 8 states. Word has length 12 [2018-06-24 21:12:24,873 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:12:25,442 INFO ]: With dead ends: 2566 [2018-06-24 21:12:25,443 INFO ]: Without dead ends: 2566 [2018-06-24 21:12:25,443 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:12:25,444 INFO ]: Start minimizeSevpa. Operand 2566 states. [2018-06-24 21:12:26,632 INFO ]: Finished minimizeSevpa. Reduced states from 2566 to 476. [2018-06-24 21:12:26,632 INFO ]: Start removeUnreachable. Operand 476 states. [2018-06-24 21:12:26,646 INFO ]: Finished removeUnreachable. Reduced from 476 states to 476 states and 934 transitions. [2018-06-24 21:12:26,646 INFO ]: Start accepts. Automaton has 476 states and 934 transitions. Word has length 12 [2018-06-24 21:12:26,647 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:12:26,647 INFO ]: Abstraction has 476 states and 934 transitions. [2018-06-24 21:12:26,647 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:12:26,647 INFO ]: Start isEmpty. Operand 476 states and 934 transitions. [2018-06-24 21:12:26,706 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 21:12:26,706 INFO ]: Found error trace [2018-06-24 21:12:26,706 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:12:26,707 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:12:26,707 INFO ]: Analyzing trace with hash -664924063, now seen corresponding path program 1 times [2018-06-24 21:12:26,707 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:12:26,707 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:12:26,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:26,707 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:12:26,708 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:26,737 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:12:26,821 INFO ]: Checked inductivity of 21 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-24 21:12:26,821 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:12:26,821 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 21:12:26,831 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 21:12:26,890 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:12:26,903 INFO ]: Computing forward predicates... [2018-06-24 21:12:26,932 INFO ]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-24 21:12:26,971 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:12:26,972 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:12:26,972 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:12:26,972 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:12:26,972 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:12:26,972 INFO ]: Start difference. First operand 476 states and 934 transitions. Second operand 3 states. [2018-06-24 21:12:29,237 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:12:29,237 INFO ]: Finished difference Result 547 states and 1005 transitions. [2018-06-24 21:12:29,238 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:12:29,238 INFO ]: Start accepts. Automaton has 3 states. Word has length 22 [2018-06-24 21:12:29,238 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:12:29,278 INFO ]: With dead ends: 547 [2018-06-24 21:12:29,278 INFO ]: Without dead ends: 547 [2018-06-24 21:12:29,278 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 23 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 21:12:29,279 INFO ]: Start minimizeSevpa. Operand 547 states. [2018-06-24 21:12:29,345 INFO ]: Finished minimizeSevpa. Reduced states from 547 to 547. [2018-06-24 21:12:29,345 INFO ]: Start removeUnreachable. Operand 547 states. [2018-06-24 21:12:29,363 INFO ]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1005 transitions. [2018-06-24 21:12:29,363 INFO ]: Start accepts. Automaton has 547 states and 1005 transitions. Word has length 22 [2018-06-24 21:12:29,363 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:12:29,363 INFO ]: Abstraction has 547 states and 1005 transitions. [2018-06-24 21:12:29,363 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:12:29,363 INFO ]: Start isEmpty. Operand 547 states and 1005 transitions. [2018-06-24 21:12:29,396 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 21:12:29,396 INFO ]: Found error trace [2018-06-24 21:12:29,396 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:12:29,396 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:12:29,396 INFO ]: Analyzing trace with hash -801199173, now seen corresponding path program 1 times [2018-06-24 21:12:29,396 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:12:29,396 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:12:29,397 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:29,397 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:12:29,397 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:29,412 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:12:29,673 INFO ]: Checked inductivity of 12 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-24 21:12:29,673 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:12:29,673 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-24 21:12:29,673 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:12:29,673 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:12:29,673 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:12:29,674 INFO ]: Start difference. First operand 547 states and 1005 transitions. Second operand 7 states. [2018-06-24 21:12:30,064 WARN ]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-24 21:12:33,031 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:12:33,031 INFO ]: Finished difference Result 2276 states and 13450 transitions. [2018-06-24 21:12:33,031 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 21:12:33,031 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-24 21:12:33,031 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:12:33,430 INFO ]: With dead ends: 2276 [2018-06-24 21:12:33,430 INFO ]: Without dead ends: 2276 [2018-06-24 21:12:33,430 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:12:33,431 INFO ]: Start minimizeSevpa. Operand 2276 states. [2018-06-24 21:12:34,182 INFO ]: Finished minimizeSevpa. Reduced states from 2276 to 631. [2018-06-24 21:12:34,182 INFO ]: Start removeUnreachable. Operand 631 states. [2018-06-24 21:12:34,198 INFO ]: Finished removeUnreachable. Reduced from 631 states to 631 states and 1152 transitions. [2018-06-24 21:12:34,198 INFO ]: Start accepts. Automaton has 631 states and 1152 transitions. Word has length 21 [2018-06-24 21:12:34,199 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:12:34,199 INFO ]: Abstraction has 631 states and 1152 transitions. [2018-06-24 21:12:34,199 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:12:34,199 INFO ]: Start isEmpty. Operand 631 states and 1152 transitions. [2018-06-24 21:12:34,231 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 21:12:34,231 INFO ]: Found error trace [2018-06-24 21:12:34,231 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:12:34,231 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:12:34,231 INFO ]: Analyzing trace with hash -1210023398, now seen corresponding path program 1 times [2018-06-24 21:12:34,231 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:12:34,231 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:12:34,232 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:34,232 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:12:34,232 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:34,258 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:12:34,637 INFO ]: Checked inductivity of 12 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 21:12:34,637 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:12:34,637 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 21:12:34,649 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:12:34,692 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:12:34,694 INFO ]: Computing forward predicates... [2018-06-24 21:12:35,048 INFO ]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:12:35,078 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:12:35,079 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 8 [2018-06-24 21:12:35,079 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:12:35,079 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:12:35,079 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:12:35,079 INFO ]: Start difference. First operand 631 states and 1152 transitions. Second operand 8 states. [2018-06-24 21:12:43,284 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:12:43,284 INFO ]: Finished difference Result 1762 states and 7061 transitions. [2018-06-24 21:12:43,284 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 21:12:43,285 INFO ]: Start accepts. Automaton has 8 states. Word has length 21 [2018-06-24 21:12:43,285 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:12:43,494 INFO ]: With dead ends: 1762 [2018-06-24 21:12:43,494 INFO ]: Without dead ends: 1542 [2018-06-24 21:12:43,494 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2018-06-24 21:12:43,495 INFO ]: Start minimizeSevpa. Operand 1542 states. [2018-06-24 21:12:43,764 INFO ]: Finished minimizeSevpa. Reduced states from 1542 to 771. [2018-06-24 21:12:43,764 INFO ]: Start removeUnreachable. Operand 771 states. [2018-06-24 21:12:43,785 INFO ]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1473 transitions. [2018-06-24 21:12:43,785 INFO ]: Start accepts. Automaton has 771 states and 1473 transitions. Word has length 21 [2018-06-24 21:12:43,785 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:12:43,785 INFO ]: Abstraction has 771 states and 1473 transitions. [2018-06-24 21:12:43,785 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:12:43,785 INFO ]: Start isEmpty. Operand 771 states and 1473 transitions. [2018-06-24 21:12:43,820 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-24 21:12:43,820 INFO ]: Found error trace [2018-06-24 21:12:43,820 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:12:43,820 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:12:43,822 INFO ]: Analyzing trace with hash 212907747, now seen corresponding path program 1 times [2018-06-24 21:12:43,822 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:12:43,822 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:12:43,823 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:43,823 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:12:43,823 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:43,841 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:12:44,157 INFO ]: Checked inductivity of 31 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 21:12:44,157 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:12:44,157 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) [2018-06-24 21:12:44,167 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:12:44,217 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:12:44,219 INFO ]: Computing forward predicates... [2018-06-24 21:12:44,228 INFO ]: Checked inductivity of 31 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-24 21:12:44,260 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:12:44,260 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:12:44,260 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:12:44,260 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:12:44,260 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:12:44,260 INFO ]: Start difference. First operand 771 states and 1473 transitions. Second operand 3 states. [2018-06-24 21:12:45,300 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:12:45,301 INFO ]: Finished difference Result 866 states and 1671 transitions. [2018-06-24 21:12:45,301 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:12:45,301 INFO ]: Start accepts. Automaton has 3 states. Word has length 29 [2018-06-24 21:12:45,301 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:12:45,328 INFO ]: With dead ends: 866 [2018-06-24 21:12:45,328 INFO ]: Without dead ends: 866 [2018-06-24 21:12:45,328 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:12:45,329 INFO ]: Start minimizeSevpa. Operand 866 states. [2018-06-24 21:12:45,382 INFO ]: Finished minimizeSevpa. Reduced states from 866 to 866. [2018-06-24 21:12:45,382 INFO ]: Start removeUnreachable. Operand 866 states. [2018-06-24 21:12:45,404 INFO ]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1671 transitions. [2018-06-24 21:12:45,404 INFO ]: Start accepts. Automaton has 866 states and 1671 transitions. Word has length 29 [2018-06-24 21:12:45,404 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:12:45,404 INFO ]: Abstraction has 866 states and 1671 transitions. [2018-06-24 21:12:45,404 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:12:45,404 INFO ]: Start isEmpty. Operand 866 states and 1671 transitions. [2018-06-24 21:12:45,450 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-24 21:12:45,450 INFO ]: Found error trace [2018-06-24 21:12:45,450 INFO ]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:12:45,451 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:12:45,452 INFO ]: Analyzing trace with hash -1088223779, now seen corresponding path program 1 times [2018-06-24 21:12:45,452 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:12:45,452 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:12:45,453 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:45,453 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:12:45,453 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:45,467 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:12:45,532 INFO ]: Checked inductivity of 75 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-06-24 21:12:45,532 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:12:45,532 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) [2018-06-24 21:12:45,542 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:12:45,613 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:12:45,617 INFO ]: Computing forward predicates... [2018-06-24 21:12:45,725 INFO ]: Checked inductivity of 75 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-06-24 21:12:45,753 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:12:45,753 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 6 [2018-06-24 21:12:45,753 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:12:45,753 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:12:45,753 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:12:45,753 INFO ]: Start difference. First operand 866 states and 1671 transitions. Second operand 6 states. [2018-06-24 21:12:48,237 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:12:48,237 INFO ]: Finished difference Result 2219 states and 8759 transitions. [2018-06-24 21:12:48,237 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 21:12:48,237 INFO ]: Start accepts. Automaton has 6 states. Word has length 44 [2018-06-24 21:12:48,237 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:12:48,405 INFO ]: With dead ends: 2219 [2018-06-24 21:12:48,405 INFO ]: Without dead ends: 2219 [2018-06-24 21:12:48,406 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:12:48,407 INFO ]: Start minimizeSevpa. Operand 2219 states. [2018-06-24 21:12:48,655 INFO ]: Finished minimizeSevpa. Reduced states from 2219 to 1001. [2018-06-24 21:12:48,655 INFO ]: Start removeUnreachable. Operand 1001 states. [2018-06-24 21:12:48,675 INFO ]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1915 transitions. [2018-06-24 21:12:48,675 INFO ]: Start accepts. Automaton has 1001 states and 1915 transitions. Word has length 44 [2018-06-24 21:12:48,676 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:12:48,676 INFO ]: Abstraction has 1001 states and 1915 transitions. [2018-06-24 21:12:48,676 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:12:48,676 INFO ]: Start isEmpty. Operand 1001 states and 1915 transitions. [2018-06-24 21:12:48,720 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-24 21:12:48,720 INFO ]: Found error trace [2018-06-24 21:12:48,720 INFO ]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:12:48,720 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:12:48,720 INFO ]: Analyzing trace with hash -308572607, now seen corresponding path program 1 times [2018-06-24 21:12:48,721 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:12:48,721 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:12:48,723 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:48,723 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:12:48,724 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:48,745 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:12:49,661 INFO ]: Checked inductivity of 82 backedges. 22 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-24 21:12:49,661 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:12:49,661 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 21:12:49,672 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:12:49,741 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:12:49,744 INFO ]: Computing forward predicates... [2018-06-24 21:12:49,773 INFO ]: Checked inductivity of 82 backedges. 44 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-24 21:12:49,805 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:12:49,805 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-24 21:12:49,805 INFO ]: Interpolant automaton has 9 states [2018-06-24 21:12:49,806 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 21:12:49,806 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:12:49,806 INFO ]: Start difference. First operand 1001 states and 1915 transitions. Second operand 9 states. [2018-06-24 21:12:53,975 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:12:53,976 INFO ]: Finished difference Result 4021 states and 24451 transitions. [2018-06-24 21:12:53,976 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 21:12:53,976 INFO ]: Start accepts. Automaton has 9 states. Word has length 46 [2018-06-24 21:12:53,976 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:12:54,608 INFO ]: With dead ends: 4021 [2018-06-24 21:12:54,608 INFO ]: Without dead ends: 4021 [2018-06-24 21:12:54,608 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2018-06-24 21:12:54,610 INFO ]: Start minimizeSevpa. Operand 4021 states. [2018-06-24 21:12:56,625 INFO ]: Finished minimizeSevpa. Reduced states from 4021 to 959. [2018-06-24 21:12:56,625 INFO ]: Start removeUnreachable. Operand 959 states. [2018-06-24 21:12:56,644 INFO ]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1953 transitions. [2018-06-24 21:12:56,644 INFO ]: Start accepts. Automaton has 959 states and 1953 transitions. Word has length 46 [2018-06-24 21:12:56,645 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:12:56,645 INFO ]: Abstraction has 959 states and 1953 transitions. [2018-06-24 21:12:56,645 INFO ]: Interpolant automaton has 9 states. [2018-06-24 21:12:56,645 INFO ]: Start isEmpty. Operand 959 states and 1953 transitions. [2018-06-24 21:12:56,685 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-24 21:12:56,685 INFO ]: Found error trace [2018-06-24 21:12:56,685 INFO ]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:12:56,685 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:12:56,686 INFO ]: Analyzing trace with hash 1667258472, now seen corresponding path program 1 times [2018-06-24 21:12:56,686 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:12:56,686 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:12:56,686 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:56,686 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:12:56,686 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:56,698 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:12:56,782 INFO ]: Checked inductivity of 78 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-06-24 21:12:56,783 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:12:56,783 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) [2018-06-24 21:12:56,793 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:12:56,864 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:12:56,867 INFO ]: Computing forward predicates... [2018-06-24 21:12:56,878 INFO ]: Checked inductivity of 78 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-24 21:12:56,911 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:12:56,911 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:12:56,912 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:12:56,912 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:12:56,912 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:12:56,912 INFO ]: Start difference. First operand 959 states and 1953 transitions. Second operand 3 states. [2018-06-24 21:12:57,444 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:12:57,444 INFO ]: Finished difference Result 1050 states and 2124 transitions. [2018-06-24 21:12:57,444 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:12:57,444 INFO ]: Start accepts. Automaton has 3 states. Word has length 46 [2018-06-24 21:12:57,444 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:12:57,465 INFO ]: With dead ends: 1050 [2018-06-24 21:12:57,465 INFO ]: Without dead ends: 1041 [2018-06-24 21:12:57,465 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 47 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 21:12:57,465 INFO ]: Start minimizeSevpa. Operand 1041 states. [2018-06-24 21:12:57,526 INFO ]: Finished minimizeSevpa. Reduced states from 1041 to 1041. [2018-06-24 21:12:57,527 INFO ]: Start removeUnreachable. Operand 1041 states. [2018-06-24 21:12:57,548 INFO ]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 2108 transitions. [2018-06-24 21:12:57,548 INFO ]: Start accepts. Automaton has 1041 states and 2108 transitions. Word has length 46 [2018-06-24 21:12:57,548 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:12:57,548 INFO ]: Abstraction has 1041 states and 2108 transitions. [2018-06-24 21:12:57,548 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:12:57,548 INFO ]: Start isEmpty. Operand 1041 states and 2108 transitions. [2018-06-24 21:12:57,600 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-24 21:12:57,600 INFO ]: Found error trace [2018-06-24 21:12:57,601 INFO ]: trace histogram [5, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:12:57,601 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:12:57,601 INFO ]: Analyzing trace with hash -1945446928, now seen corresponding path program 1 times [2018-06-24 21:12:57,601 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:12:57,601 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:12:57,601 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:57,601 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:12:57,601 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:57,617 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:12:57,696 INFO ]: Checked inductivity of 94 backedges. 23 proven. 5 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-24 21:12:57,696 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:12:57,696 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) [2018-06-24 21:12:57,711 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:12:57,777 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:12:57,780 INFO ]: Computing forward predicates... [2018-06-24 21:12:58,254 INFO ]: Checked inductivity of 94 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-06-24 21:12:58,287 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:12:58,287 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [3] total 7 [2018-06-24 21:12:58,288 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:12:58,288 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:12:58,288 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:12:58,288 INFO ]: Start difference. First operand 1041 states and 2108 transitions. Second operand 7 states. Received shutdown request... [2018-06-24 21:13:03,901 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 21:13:03,901 WARN ]: Verification canceled [2018-06-24 21:13:03,904 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:13:03,905 WARN ]: Timeout [2018-06-24 21:13:03,905 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:13:03 BasicIcfg [2018-06-24 21:13:03,905 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:13:03,906 INFO ]: Toolchain (without parser) took 50935.88 ms. Allocated memory was 308.3 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 245.7 MB in the beginning and 707.2 MB in the end (delta: -461.6 MB). Peak memory consumption was 763.7 MB. Max. memory is 3.6 GB. [2018-06-24 21:13:03,906 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.3 MB. Free memory is still 273.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:13:03,906 INFO ]: ChcToBoogie took 83.56 ms. Allocated memory is still 308.3 MB. Free memory was 245.7 MB in the beginning and 242.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:13:03,907 INFO ]: Boogie Preprocessor took 85.99 ms. Allocated memory is still 308.3 MB. Free memory was 242.7 MB in the beginning and 240.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:13:03,907 INFO ]: RCFGBuilder took 1252.20 ms. Allocated memory is still 308.3 MB. Free memory was 240.7 MB in the beginning and 191.0 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 3.6 GB. [2018-06-24 21:13:03,907 INFO ]: BlockEncodingV2 took 2169.08 ms. Allocated memory was 308.3 MB in the beginning and 325.6 MB in the end (delta: 17.3 MB). Free memory was 191.0 MB in the beginning and 220.2 MB in the end (delta: -29.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 3.6 GB. [2018-06-24 21:13:03,908 INFO ]: TraceAbstraction took 47335.57 ms. Allocated memory was 325.6 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 218.7 MB in the beginning and 707.2 MB in the end (delta: -488.5 MB). Peak memory consumption was 719.4 MB. Max. memory is 3.6 GB. [2018-06-24 21:13:03,910 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 171 locations, 285 edges - StatisticsResult: Encoded RCFG 117 locations, 234 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.3 MB. Free memory is still 273.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 83.56 ms. Allocated memory is still 308.3 MB. Free memory was 245.7 MB in the beginning and 242.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 85.99 ms. Allocated memory is still 308.3 MB. Free memory was 242.7 MB in the beginning and 240.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1252.20 ms. Allocated memory is still 308.3 MB. Free memory was 240.7 MB in the beginning and 191.0 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 2169.08 ms. Allocated memory was 308.3 MB in the beginning and 325.6 MB in the end (delta: 17.3 MB). Free memory was 191.0 MB in the beginning and 220.2 MB in the end (delta: -29.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 3.6 GB. * TraceAbstraction took 47335.57 ms. Allocated memory was 325.6 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 218.7 MB in the beginning and 707.2 MB in the end (delta: -488.5 MB). Peak memory consumption was 719.4 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (1041states) and interpolant automaton (currently 19 states, 7 states before enhancement), while ReachableStatesComputation was computing reachable states (2877 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 117 locations, 1 error locations. TIMEOUT Result, 47.2s OverallTime, 14 OverallIterations, 5 TraceHistogramMax, 36.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9166 SDtfs, 2435 SDslu, 25216 SDs, 0 SdLazy, 17526 SolverSat, 6201 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 423 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1041occurred in iteration=13, 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: 5.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 8786 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 578 NumberOfCodeBlocks, 578 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 557 ConstructedInterpolants, 0 QuantifiedInterpolants, 28017 SizeOfPredicates, 26 NumberOfNonLiveVariables, 2471 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 21 InterpolantComputations, 13 PerfectInterpolantSequences, 768/802 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/a-copy-print.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-13-03-920.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/a-copy-print.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-13-03-920.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/a-copy-print.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-13-03-920.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/a-copy-print.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-13-03-920.csv Completed graceful shutdown