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/fib_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:49:18,314 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:49:18,316 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:49:18,327 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:49:18,328 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:49:18,329 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:49:18,330 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:49:18,331 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:49:18,333 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:49:18,334 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:49:18,335 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:49:18,335 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:49:18,336 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:49:18,337 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:49:18,337 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:49:18,338 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:49:18,340 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:49:18,342 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:49:18,343 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:49:18,345 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:49:18,346 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:49:18,348 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:49:18,349 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:49:18,349 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:49:18,350 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:49:18,351 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:49:18,352 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:49:18,352 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:49:18,353 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:49:18,354 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:49:18,354 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:49:18,355 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:49:18,355 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:49:18,356 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:49:18,357 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:49:18,357 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:49:18,371 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:49:18,371 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:49:18,372 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:49:18,372 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:49:18,373 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:49:18,373 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:49:18,373 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:49:18,374 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:49:18,374 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:49:18,374 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:49:18,375 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:49:18,375 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:49:18,375 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:49:18,375 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:49:18,376 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:49:18,376 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:49:18,376 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:49:18,376 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:49:18,377 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:49:18,377 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:49:18,377 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:49:18,379 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:49:18,379 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:49:18,411 INFO ]: Repository-Root is: /tmp [2018-06-24 20:49:18,426 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:49:18,430 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:49:18,431 INFO ]: Initializing SmtParser... [2018-06-24 20:49:18,432 INFO ]: SmtParser initialized [2018-06-24 20:49:18,432 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/fib_merged_safe.c-1.smt2 [2018-06-24 20:49:18,434 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:49:18,525 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/fib_merged_safe.c-1.smt2 unknown [2018-06-24 20:49:18,725 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/fib_merged_safe.c-1.smt2 [2018-06-24 20:49:18,730 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:49:18,737 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:49:18,737 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:49:18,737 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:49:18,737 INFO ]: ChcToBoogie initialized [2018-06-24 20:49:18,740 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:49:18" (1/1) ... [2018-06-24 20:49:18,798 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:49:18 Unit [2018-06-24 20:49:18,798 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:49:18,799 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:49:18,799 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:49:18,799 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:49:18,820 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:49:18" (1/1) ... [2018-06-24 20:49:18,820 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:49:18" (1/1) ... [2018-06-24 20:49:18,825 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:49:18" (1/1) ... [2018-06-24 20:49:18,825 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:49:18" (1/1) ... [2018-06-24 20:49:18,828 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:49:18" (1/1) ... [2018-06-24 20:49:18,829 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:49:18" (1/1) ... [2018-06-24 20:49:18,830 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:49:18" (1/1) ... [2018-06-24 20:49:18,832 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:49:18,832 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:49:18,832 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:49:18,832 INFO ]: RCFGBuilder initialized [2018-06-24 20:49:18,833 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:49:18" (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:49:18,848 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:49:18,848 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:49:18,848 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:49:18,849 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:49:18,849 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:49:18,849 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:49:19,103 INFO ]: Using library mode [2018-06-24 20:49:19,103 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:49:19 BoogieIcfgContainer [2018-06-24 20:49:19,103 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:49:19,104 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:49:19,104 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:49:19,108 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:49:19,109 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:49:19" (1/1) ... [2018-06-24 20:49:19,127 INFO ]: Initial Icfg 11 locations, 11 edges [2018-06-24 20:49:19,128 INFO ]: Using Remove infeasible edges [2018-06-24 20:49:19,130 INFO ]: Using Maximize final states [2018-06-24 20:49:19,130 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:49:19,130 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:49:19,132 INFO ]: Using Remove sink states [2018-06-24 20:49:19,134 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:49:19,134 INFO ]: Using Use SBE [2018-06-24 20:49:19,140 INFO ]: SBE split 0 edges [2018-06-24 20:49:19,148 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 20:49:19,150 INFO ]: 0 new accepting states [2018-06-24 20:49:19,222 INFO ]: Removed 7 edges and 3 locations by large block encoding [2018-06-24 20:49:19,224 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:49:19,227 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:49:19,227 INFO ]: 0 new accepting states [2018-06-24 20:49:19,228 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:49:19,228 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:49:19,228 INFO ]: Encoded RCFG 6 locations, 6 edges [2018-06-24 20:49:19,228 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:49:19 BasicIcfg [2018-06-24 20:49:19,228 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:49:19,230 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:49:19,230 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:49:19,233 INFO ]: TraceAbstraction initialized [2018-06-24 20:49:19,233 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:49:18" (1/4) ... [2018-06-24 20:49:19,234 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36630a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:49:19, skipping insertion in model container [2018-06-24 20:49:19,234 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:49:18" (2/4) ... [2018-06-24 20:49:19,234 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36630a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:49:19, skipping insertion in model container [2018-06-24 20:49:19,234 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:49:19" (3/4) ... [2018-06-24 20:49:19,234 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36630a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:49:19, skipping insertion in model container [2018-06-24 20:49:19,234 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:49:19" (4/4) ... [2018-06-24 20:49:19,236 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:49:19,245 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:49:19,254 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:49:19,299 INFO ]: Using default assertion order modulation [2018-06-24 20:49:19,300 INFO ]: Interprodecural is true [2018-06-24 20:49:19,300 INFO ]: Hoare is false [2018-06-24 20:49:19,300 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:49:19,300 INFO ]: Backedges is TWOTRACK [2018-06-24 20:49:19,300 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:49:19,300 INFO ]: Difference is false [2018-06-24 20:49:19,300 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:49:19,300 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:49:19,310 INFO ]: Start isEmpty. Operand 6 states. [2018-06-24 20:49:19,319 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:49:19,319 INFO ]: Found error trace [2018-06-24 20:49:19,320 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:49:19,320 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:19,324 INFO ]: Analyzing trace with hash 36418371, now seen corresponding path program 1 times [2018-06-24 20:49:19,325 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:19,325 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:19,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:19,362 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:19,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:19,414 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:19,520 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:49:19,522 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:49:19,522 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:49:19,523 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:49:19,533 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:49:19,534 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:49:19,535 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-24 20:49:19,617 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:19,617 INFO ]: Finished difference Result 7 states and 7 transitions. [2018-06-24 20:49:19,617 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:49:19,619 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:49:19,619 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:19,626 INFO ]: With dead ends: 7 [2018-06-24 20:49:19,626 INFO ]: Without dead ends: 7 [2018-06-24 20:49:19,628 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:49:19,642 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 20:49:19,661 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 20:49:19,662 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 20:49:19,663 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-06-24 20:49:19,664 INFO ]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-06-24 20:49:19,664 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:19,664 INFO ]: Abstraction has 7 states and 7 transitions. [2018-06-24 20:49:19,664 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:49:19,664 INFO ]: Start isEmpty. Operand 7 states and 7 transitions. [2018-06-24 20:49:19,664 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:49:19,664 INFO ]: Found error trace [2018-06-24 20:49:19,664 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:49:19,666 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:19,666 INFO ]: Analyzing trace with hash 1128913923, now seen corresponding path program 1 times [2018-06-24 20:49:19,666 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:19,666 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:19,667 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:19,667 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:19,667 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:19,697 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:19,999 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:49:19,999 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:20,000 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:49:20,007 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:20,052 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:20,063 INFO ]: Computing forward predicates... [2018-06-24 20:49:20,125 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:49:20,152 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:20,153 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-24 20:49:20,153 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:49:20,153 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:49:20,153 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:49:20,154 INFO ]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-06-24 20:49:20,243 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:20,243 INFO ]: Finished difference Result 8 states and 8 transitions. [2018-06-24 20:49:20,243 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:49:20,244 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 20:49:20,244 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:20,244 INFO ]: With dead ends: 8 [2018-06-24 20:49:20,244 INFO ]: Without dead ends: 8 [2018-06-24 20:49:20,245 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:49:20,245 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 20:49:20,246 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 20:49:20,246 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 20:49:20,246 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-06-24 20:49:20,246 INFO ]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-06-24 20:49:20,246 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:20,246 INFO ]: Abstraction has 8 states and 8 transitions. [2018-06-24 20:49:20,246 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:49:20,247 INFO ]: Start isEmpty. Operand 8 states and 8 transitions. [2018-06-24 20:49:20,247 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:49:20,247 INFO ]: Found error trace [2018-06-24 20:49:20,247 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-24 20:49:20,247 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:20,247 INFO ]: Analyzing trace with hash 636537667, now seen corresponding path program 2 times [2018-06-24 20:49:20,247 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:20,247 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:20,248 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:20,248 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:20,248 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:20,268 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:20,565 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:20,565 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:20,565 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:49:20,572 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:49:20,646 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:49:20,646 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:20,650 INFO ]: Computing forward predicates... [2018-06-24 20:49:20,680 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:20,707 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:20,708 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 20:49:20,708 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:49:20,708 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:49:20,708 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:49:20,708 INFO ]: Start difference. First operand 8 states and 8 transitions. Second operand 5 states. [2018-06-24 20:49:20,757 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:20,757 INFO ]: Finished difference Result 9 states and 9 transitions. [2018-06-24 20:49:20,757 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:49:20,757 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-24 20:49:20,757 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:20,757 INFO ]: With dead ends: 9 [2018-06-24 20:49:20,757 INFO ]: Without dead ends: 9 [2018-06-24 20:49:20,758 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:49:20,758 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 20:49:20,759 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 20:49:20,759 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 20:49:20,759 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-06-24 20:49:20,759 INFO ]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-06-24 20:49:20,759 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:20,759 INFO ]: Abstraction has 9 states and 9 transitions. [2018-06-24 20:49:20,759 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:49:20,759 INFO ]: Start isEmpty. Operand 9 states and 9 transitions. [2018-06-24 20:49:20,760 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:49:20,760 INFO ]: Found error trace [2018-06-24 20:49:20,760 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-24 20:49:20,760 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:20,760 INFO ]: Analyzing trace with hash -1742224381, now seen corresponding path program 3 times [2018-06-24 20:49:20,760 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:20,760 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:20,761 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:20,761 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:20,761 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:20,783 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:21,238 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:49:21,238 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:21,238 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 20:49:21,254 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:49:21,326 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 20:49:21,326 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:21,330 INFO ]: Computing forward predicates... [2018-06-24 20:49:21,404 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:49:21,428 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:21,428 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-24 20:49:21,429 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:49:21,429 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:49:21,429 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:49:21,429 INFO ]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-06-24 20:49:21,632 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:21,632 INFO ]: Finished difference Result 10 states and 10 transitions. [2018-06-24 20:49:21,632 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:49:21,632 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-24 20:49:21,632 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:21,633 INFO ]: With dead ends: 10 [2018-06-24 20:49:21,633 INFO ]: Without dead ends: 10 [2018-06-24 20:49:21,633 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:49:21,633 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 20:49:21,634 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-24 20:49:21,634 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:49:21,635 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-06-24 20:49:21,635 INFO ]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-06-24 20:49:21,635 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:21,635 INFO ]: Abstraction has 10 states and 10 transitions. [2018-06-24 20:49:21,635 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:49:21,635 INFO ]: Start isEmpty. Operand 10 states and 10 transitions. [2018-06-24 20:49:21,635 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:49:21,635 INFO ]: Found error trace [2018-06-24 20:49:21,635 INFO ]: trace histogram [4, 1, 1, 1, 1, 1] [2018-06-24 20:49:21,636 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:21,636 INFO ]: Analyzing trace with hash 1825563459, now seen corresponding path program 4 times [2018-06-24 20:49:21,636 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:21,636 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:21,636 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:21,636 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:21,636 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:21,670 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:22,006 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:22,006 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:22,006 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:49:22,014 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:49:22,045 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:49:22,045 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:22,049 INFO ]: Computing forward predicates... [2018-06-24 20:49:22,072 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:22,099 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:22,099 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-24 20:49:22,099 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:49:22,099 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:49:22,099 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:49:22,099 INFO ]: Start difference. First operand 10 states and 10 transitions. Second operand 7 states. [2018-06-24 20:49:22,135 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:22,135 INFO ]: Finished difference Result 11 states and 11 transitions. [2018-06-24 20:49:22,139 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:49:22,139 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-24 20:49:22,139 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:22,139 INFO ]: With dead ends: 11 [2018-06-24 20:49:22,139 INFO ]: Without dead ends: 11 [2018-06-24 20:49:22,139 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:49:22,140 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 20:49:22,141 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-24 20:49:22,141 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:49:22,141 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-06-24 20:49:22,141 INFO ]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-06-24 20:49:22,141 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:22,141 INFO ]: Abstraction has 11 states and 11 transitions. [2018-06-24 20:49:22,141 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:49:22,141 INFO ]: Start isEmpty. Operand 11 states and 11 transitions. [2018-06-24 20:49:22,142 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:49:22,142 INFO ]: Found error trace [2018-06-24 20:49:22,142 INFO ]: trace histogram [5, 1, 1, 1, 1, 1] [2018-06-24 20:49:22,142 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:22,142 INFO ]: Analyzing trace with hash 757836803, now seen corresponding path program 5 times [2018-06-24 20:49:22,142 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:22,142 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:22,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:22,143 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:22,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:22,163 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:22,591 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:49:22,592 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:22,592 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:49:22,608 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:49:22,706 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 20:49:22,706 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:22,713 INFO ]: Computing forward predicates... [2018-06-24 20:49:22,793 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:49:22,824 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:22,824 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-24 20:49:22,824 INFO ]: Interpolant automaton has 8 states [2018-06-24 20:49:22,824 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 20:49:22,824 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:49:22,825 INFO ]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2018-06-24 20:49:23,073 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:23,074 INFO ]: Finished difference Result 12 states and 12 transitions. [2018-06-24 20:49:23,074 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 20:49:23,074 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-24 20:49:23,074 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:23,075 INFO ]: With dead ends: 12 [2018-06-24 20:49:23,075 INFO ]: Without dead ends: 12 [2018-06-24 20:49:23,075 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:49:23,075 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 20:49:23,076 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-24 20:49:23,076 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 20:49:23,077 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-06-24 20:49:23,077 INFO ]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-06-24 20:49:23,077 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:23,077 INFO ]: Abstraction has 12 states and 12 transitions. [2018-06-24 20:49:23,077 INFO ]: Interpolant automaton has 8 states. [2018-06-24 20:49:23,077 INFO ]: Start isEmpty. Operand 12 states and 12 transitions. [2018-06-24 20:49:23,077 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:49:23,077 INFO ]: Found error trace [2018-06-24 20:49:23,077 INFO ]: trace histogram [6, 1, 1, 1, 1, 1] [2018-06-24 20:49:23,077 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:23,078 INFO ]: Analyzing trace with hash 2018048835, now seen corresponding path program 6 times [2018-06-24 20:49:23,078 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:23,078 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:23,078 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:23,078 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:23,078 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:23,096 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:23,730 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:23,730 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:23,730 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 20:49:23,743 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:49:23,838 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-24 20:49:23,839 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:23,844 INFO ]: Computing forward predicates... [2018-06-24 20:49:23,929 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:23,960 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:23,961 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-24 20:49:23,961 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:49:23,961 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:49:23,961 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:49:23,961 INFO ]: Start difference. First operand 12 states and 12 transitions. Second operand 9 states. [2018-06-24 20:49:24,128 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:24,128 INFO ]: Finished difference Result 13 states and 13 transitions. [2018-06-24 20:49:24,128 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:49:24,128 INFO ]: Start accepts. Automaton has 9 states. Word has length 11 [2018-06-24 20:49:24,128 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:24,129 INFO ]: With dead ends: 13 [2018-06-24 20:49:24,129 INFO ]: Without dead ends: 13 [2018-06-24 20:49:24,129 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:49:24,129 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 20:49:24,130 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-24 20:49:24,130 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:49:24,131 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-06-24 20:49:24,131 INFO ]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-06-24 20:49:24,131 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:24,131 INFO ]: Abstraction has 13 states and 13 transitions. [2018-06-24 20:49:24,131 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:49:24,131 INFO ]: Start isEmpty. Operand 13 states and 13 transitions. [2018-06-24 20:49:24,131 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:49:24,131 INFO ]: Found error trace [2018-06-24 20:49:24,131 INFO ]: trace histogram [7, 1, 1, 1, 1, 1] [2018-06-24 20:49:24,131 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:24,131 INFO ]: Analyzing trace with hash -1865051133, now seen corresponding path program 7 times [2018-06-24 20:49:24,131 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:24,131 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:24,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:24,132 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:24,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:24,149 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:24,313 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:49:24,313 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:24,313 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 20:49:24,330 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 20:49:24,386 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:24,392 INFO ]: Computing forward predicates... [2018-06-24 20:49:24,442 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:49:24,474 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:24,474 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-24 20:49:24,475 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:49:24,475 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:49:24,475 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:49:24,475 INFO ]: Start difference. First operand 13 states and 13 transitions. Second operand 10 states. [2018-06-24 20:49:24,685 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:24,685 INFO ]: Finished difference Result 14 states and 14 transitions. [2018-06-24 20:49:24,686 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:49:24,686 INFO ]: Start accepts. Automaton has 10 states. Word has length 12 [2018-06-24 20:49:24,686 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:24,686 INFO ]: With dead ends: 14 [2018-06-24 20:49:24,686 INFO ]: Without dead ends: 14 [2018-06-24 20:49:24,687 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:49:24,687 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 20:49:24,688 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-24 20:49:24,688 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:49:24,688 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-06-24 20:49:24,688 INFO ]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-06-24 20:49:24,689 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:24,689 INFO ]: Abstraction has 14 states and 14 transitions. [2018-06-24 20:49:24,689 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:49:24,689 INFO ]: Start isEmpty. Operand 14 states and 14 transitions. [2018-06-24 20:49:24,689 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:49:24,689 INFO ]: Found error trace [2018-06-24 20:49:24,689 INFO ]: trace histogram [8, 1, 1, 1, 1, 1] [2018-06-24 20:49:24,689 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:24,689 INFO ]: Analyzing trace with hash -1982065853, now seen corresponding path program 8 times [2018-06-24 20:49:24,689 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:24,689 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:24,690 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:24,690 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:24,690 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:24,707 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:24,964 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:24,964 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:24,964 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:49:24,974 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:49:25,021 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:49:25,021 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:25,026 INFO ]: Computing forward predicates... [2018-06-24 20:49:25,107 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:25,130 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:25,131 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-24 20:49:25,131 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:49:25,131 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:49:25,131 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:49:25,131 INFO ]: Start difference. First operand 14 states and 14 transitions. Second operand 11 states. [2018-06-24 20:49:25,206 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:25,206 INFO ]: Finished difference Result 15 states and 15 transitions. [2018-06-24 20:49:25,207 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:49:25,207 INFO ]: Start accepts. Automaton has 11 states. Word has length 13 [2018-06-24 20:49:25,207 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:25,207 INFO ]: With dead ends: 15 [2018-06-24 20:49:25,207 INFO ]: Without dead ends: 15 [2018-06-24 20:49:25,208 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:49:25,208 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 20:49:25,209 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-24 20:49:25,209 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 20:49:25,209 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-06-24 20:49:25,210 INFO ]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-06-24 20:49:25,210 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:25,210 INFO ]: Abstraction has 15 states and 15 transitions. [2018-06-24 20:49:25,210 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:49:25,210 INFO ]: Start isEmpty. Operand 15 states and 15 transitions. [2018-06-24 20:49:25,210 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:49:25,210 INFO ]: Found error trace [2018-06-24 20:49:25,210 INFO ]: trace histogram [9, 1, 1, 1, 1, 1] [2018-06-24 20:49:25,210 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:25,210 INFO ]: Analyzing trace with hash -1314554877, now seen corresponding path program 9 times [2018-06-24 20:49:25,210 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:25,210 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:25,211 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:25,211 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:25,211 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:25,244 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:25,458 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:25,458 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:25,458 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) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:49:25,464 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:49:25,538 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 20:49:25,538 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:25,544 INFO ]: Computing forward predicates... [2018-06-24 20:49:25,576 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:25,597 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:25,597 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-24 20:49:25,597 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:49:25,597 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:49:25,597 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:49:25,598 INFO ]: Start difference. First operand 15 states and 15 transitions. Second operand 12 states. [2018-06-24 20:49:25,692 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:25,692 INFO ]: Finished difference Result 16 states and 16 transitions. [2018-06-24 20:49:25,692 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:49:25,692 INFO ]: Start accepts. Automaton has 12 states. Word has length 14 [2018-06-24 20:49:25,692 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:25,692 INFO ]: With dead ends: 16 [2018-06-24 20:49:25,693 INFO ]: Without dead ends: 16 [2018-06-24 20:49:25,693 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:49:25,693 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 20:49:25,694 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-24 20:49:25,694 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:49:25,695 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-06-24 20:49:25,695 INFO ]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-06-24 20:49:25,695 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:25,695 INFO ]: Abstraction has 16 states and 16 transitions. [2018-06-24 20:49:25,695 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:49:25,695 INFO ]: Start isEmpty. Operand 16 states and 16 transitions. [2018-06-24 20:49:25,695 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:49:25,695 INFO ]: Found error trace [2018-06-24 20:49:25,695 INFO ]: trace histogram [10, 1, 1, 1, 1, 1] [2018-06-24 20:49:25,695 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:25,695 INFO ]: Analyzing trace with hash -2096551101, now seen corresponding path program 10 times [2018-06-24 20:49:25,695 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:25,695 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:25,696 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:25,696 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:25,696 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:25,720 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:26,014 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:26,014 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:26,014 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:49:26,020 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:49:26,086 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:49:26,086 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:26,094 INFO ]: Computing forward predicates... [2018-06-24 20:49:26,127 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:26,147 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:26,147 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-24 20:49:26,147 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:49:26,147 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:49:26,147 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:49:26,147 INFO ]: Start difference. First operand 16 states and 16 transitions. Second operand 13 states. [2018-06-24 20:49:26,276 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:26,277 INFO ]: Finished difference Result 17 states and 17 transitions. [2018-06-24 20:49:26,277 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:49:26,277 INFO ]: Start accepts. Automaton has 13 states. Word has length 15 [2018-06-24 20:49:26,277 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:26,277 INFO ]: With dead ends: 17 [2018-06-24 20:49:26,277 INFO ]: Without dead ends: 17 [2018-06-24 20:49:26,277 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:49:26,277 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 20:49:26,279 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-24 20:49:26,279 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 20:49:26,279 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-06-24 20:49:26,279 INFO ]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-06-24 20:49:26,279 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:26,279 INFO ]: Abstraction has 17 states and 17 transitions. [2018-06-24 20:49:26,279 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:49:26,280 INFO ]: Start isEmpty. Operand 17 states and 17 transitions. [2018-06-24 20:49:26,280 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:49:26,280 INFO ]: Found error trace [2018-06-24 20:49:26,280 INFO ]: trace histogram [11, 1, 1, 1, 1, 1] [2018-06-24 20:49:26,280 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:26,280 INFO ]: Analyzing trace with hash -568630269, now seen corresponding path program 11 times [2018-06-24 20:49:26,280 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:26,280 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:26,281 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:26,281 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:26,281 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:26,301 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:26,590 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:26,590 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:26,590 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:49:26,596 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:49:26,696 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-24 20:49:26,696 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:26,707 INFO ]: Computing forward predicates... [2018-06-24 20:49:26,737 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:26,770 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:26,771 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-24 20:49:26,771 INFO ]: Interpolant automaton has 14 states [2018-06-24 20:49:26,771 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 20:49:26,771 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:49:26,771 INFO ]: Start difference. First operand 17 states and 17 transitions. Second operand 14 states. [2018-06-24 20:49:26,881 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:26,881 INFO ]: Finished difference Result 18 states and 18 transitions. [2018-06-24 20:49:26,881 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 20:49:26,881 INFO ]: Start accepts. Automaton has 14 states. Word has length 16 [2018-06-24 20:49:26,881 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:26,882 INFO ]: With dead ends: 18 [2018-06-24 20:49:26,882 INFO ]: Without dead ends: 18 [2018-06-24 20:49:26,882 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:49:26,882 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 20:49:26,883 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-24 20:49:26,883 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 20:49:26,884 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-06-24 20:49:26,884 INFO ]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-06-24 20:49:26,884 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:26,884 INFO ]: Abstraction has 18 states and 18 transitions. [2018-06-24 20:49:26,884 INFO ]: Interpolant automaton has 14 states. [2018-06-24 20:49:26,884 INFO ]: Start isEmpty. Operand 18 states and 18 transitions. [2018-06-24 20:49:26,884 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:49:26,884 INFO ]: Found error trace [2018-06-24 20:49:26,884 INFO ]: trace histogram [12, 1, 1, 1, 1, 1] [2018-06-24 20:49:26,884 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:26,884 INFO ]: Analyzing trace with hash -447724733, now seen corresponding path program 12 times [2018-06-24 20:49:26,885 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:26,885 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:26,885 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:26,885 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:26,885 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:26,906 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:27,410 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:27,410 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:27,410 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:49:27,416 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:49:27,485 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-24 20:49:27,485 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:27,492 INFO ]: Computing forward predicates... [2018-06-24 20:49:27,551 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:27,583 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:27,583 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-24 20:49:27,583 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:49:27,584 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:49:27,584 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:49:27,584 INFO ]: Start difference. First operand 18 states and 18 transitions. Second operand 15 states. [2018-06-24 20:49:27,812 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:27,812 INFO ]: Finished difference Result 19 states and 19 transitions. [2018-06-24 20:49:27,812 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 20:49:27,812 INFO ]: Start accepts. Automaton has 15 states. Word has length 17 [2018-06-24 20:49:27,812 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:27,812 INFO ]: With dead ends: 19 [2018-06-24 20:49:27,812 INFO ]: Without dead ends: 19 [2018-06-24 20:49:27,813 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:49:27,813 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 20:49:27,814 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-24 20:49:27,814 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 20:49:27,814 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-06-24 20:49:27,814 INFO ]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-06-24 20:49:27,814 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:27,815 INFO ]: Abstraction has 19 states and 19 transitions. [2018-06-24 20:49:27,815 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:49:27,815 INFO ]: Start isEmpty. Operand 19 states and 19 transitions. [2018-06-24 20:49:27,815 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:49:27,815 INFO ]: Found error trace [2018-06-24 20:49:27,815 INFO ]: trace histogram [13, 1, 1, 1, 1, 1] [2018-06-24 20:49:27,815 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:27,815 INFO ]: Analyzing trace with hash -994620413, now seen corresponding path program 13 times [2018-06-24 20:49:27,815 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:27,815 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:27,816 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:27,816 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:27,816 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:27,839 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:28,227 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:28,227 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:28,227 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:49:28,234 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:28,311 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:28,321 INFO ]: Computing forward predicates... [2018-06-24 20:49:28,385 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:28,418 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:28,418 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-06-24 20:49:28,418 INFO ]: Interpolant automaton has 16 states [2018-06-24 20:49:28,418 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 20:49:28,418 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:49:28,419 INFO ]: Start difference. First operand 19 states and 19 transitions. Second operand 16 states. [2018-06-24 20:49:28,760 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:28,760 INFO ]: Finished difference Result 20 states and 20 transitions. [2018-06-24 20:49:28,760 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 20:49:28,760 INFO ]: Start accepts. Automaton has 16 states. Word has length 18 [2018-06-24 20:49:28,761 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:28,761 INFO ]: With dead ends: 20 [2018-06-24 20:49:28,761 INFO ]: Without dead ends: 20 [2018-06-24 20:49:28,761 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:49:28,761 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 20:49:28,763 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-24 20:49:28,763 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 20:49:28,763 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-06-24 20:49:28,763 INFO ]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-06-24 20:49:28,763 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:28,763 INFO ]: Abstraction has 20 states and 20 transitions. [2018-06-24 20:49:28,763 INFO ]: Interpolant automaton has 16 states. [2018-06-24 20:49:28,763 INFO ]: Start isEmpty. Operand 20 states and 20 transitions. [2018-06-24 20:49:28,764 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 20:49:28,764 INFO ]: Found error trace [2018-06-24 20:49:28,764 INFO ]: trace histogram [14, 1, 1, 1, 1, 1] [2018-06-24 20:49:28,764 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:28,764 INFO ]: Analyzing trace with hash -768517309, now seen corresponding path program 14 times [2018-06-24 20:49:28,764 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:28,764 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:28,765 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:28,765 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:28,765 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:28,791 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:29,278 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:29,278 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:29,278 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:49:29,284 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:49:29,349 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:49:29,349 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:29,357 INFO ]: Computing forward predicates... [2018-06-24 20:49:29,381 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:29,401 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:29,401 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-06-24 20:49:29,401 INFO ]: Interpolant automaton has 17 states [2018-06-24 20:49:29,401 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 20:49:29,401 INFO ]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:49:29,402 INFO ]: Start difference. First operand 20 states and 20 transitions. Second operand 17 states. [2018-06-24 20:49:29,608 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:29,608 INFO ]: Finished difference Result 21 states and 21 transitions. [2018-06-24 20:49:29,609 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:49:29,609 INFO ]: Start accepts. Automaton has 17 states. Word has length 19 [2018-06-24 20:49:29,609 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:29,609 INFO ]: With dead ends: 21 [2018-06-24 20:49:29,609 INFO ]: Without dead ends: 21 [2018-06-24 20:49:29,609 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:49:29,609 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 20:49:29,611 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-24 20:49:29,611 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 20:49:29,611 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-06-24 20:49:29,612 INFO ]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-06-24 20:49:29,612 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:29,612 INFO ]: Abstraction has 21 states and 21 transitions. [2018-06-24 20:49:29,612 INFO ]: Interpolant automaton has 17 states. [2018-06-24 20:49:29,612 INFO ]: Start isEmpty. Operand 21 states and 21 transitions. [2018-06-24 20:49:29,612 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:49:29,612 INFO ]: Found error trace [2018-06-24 20:49:29,612 INFO ]: trace histogram [15, 1, 1, 1, 1, 1] [2018-06-24 20:49:29,612 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:29,612 INFO ]: Analyzing trace with hash 1945711619, now seen corresponding path program 15 times [2018-06-24 20:49:29,612 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:29,612 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:29,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:29,613 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:29,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:29,639 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:30,261 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:30,261 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:30,261 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:49:30,267 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:49:30,359 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-24 20:49:30,359 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:30,368 INFO ]: Computing forward predicates... [2018-06-24 20:49:30,404 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:30,423 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:30,423 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-06-24 20:49:30,423 INFO ]: Interpolant automaton has 18 states [2018-06-24 20:49:30,424 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 20:49:30,424 INFO ]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:49:30,424 INFO ]: Start difference. First operand 21 states and 21 transitions. Second operand 18 states. [2018-06-24 20:49:30,599 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:30,599 INFO ]: Finished difference Result 22 states and 22 transitions. [2018-06-24 20:49:30,599 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 20:49:30,599 INFO ]: Start accepts. Automaton has 18 states. Word has length 20 [2018-06-24 20:49:30,599 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:30,599 INFO ]: With dead ends: 22 [2018-06-24 20:49:30,599 INFO ]: Without dead ends: 22 [2018-06-24 20:49:30,600 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:49:30,600 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 20:49:30,601 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-24 20:49:30,601 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-24 20:49:30,602 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-06-24 20:49:30,602 INFO ]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-06-24 20:49:30,602 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:30,602 INFO ]: Abstraction has 22 states and 22 transitions. [2018-06-24 20:49:30,602 INFO ]: Interpolant automaton has 18 states. [2018-06-24 20:49:30,602 INFO ]: Start isEmpty. Operand 22 states and 22 transitions. [2018-06-24 20:49:30,602 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 20:49:30,602 INFO ]: Found error trace [2018-06-24 20:49:30,602 INFO ]: trace histogram [16, 1, 1, 1, 1, 1] [2018-06-24 20:49:30,603 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:30,603 INFO ]: Analyzing trace with hash 187462467, now seen corresponding path program 16 times [2018-06-24 20:49:30,603 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:30,603 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:30,603 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:30,603 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:30,603 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:30,628 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:31,070 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:31,070 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:31,070 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 20:49:31,084 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:49:31,158 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:49:31,158 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:31,167 INFO ]: Computing forward predicates... [2018-06-24 20:49:31,213 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:31,245 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:31,245 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-06-24 20:49:31,245 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:49:31,245 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:49:31,245 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:49:31,245 INFO ]: Start difference. First operand 22 states and 22 transitions. Second operand 19 states. [2018-06-24 20:49:31,536 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:31,536 INFO ]: Finished difference Result 23 states and 23 transitions. [2018-06-24 20:49:31,536 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:49:31,536 INFO ]: Start accepts. Automaton has 19 states. Word has length 21 [2018-06-24 20:49:31,536 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:31,537 INFO ]: With dead ends: 23 [2018-06-24 20:49:31,537 INFO ]: Without dead ends: 23 [2018-06-24 20:49:31,537 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:49:31,537 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-24 20:49:31,539 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-24 20:49:31,539 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 20:49:31,539 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-06-24 20:49:31,539 INFO ]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-06-24 20:49:31,539 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:31,539 INFO ]: Abstraction has 23 states and 23 transitions. [2018-06-24 20:49:31,539 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:49:31,539 INFO ]: Start isEmpty. Operand 23 states and 23 transitions. [2018-06-24 20:49:31,540 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 20:49:31,540 INFO ]: Found error trace [2018-06-24 20:49:31,540 INFO ]: trace histogram [17, 1, 1, 1, 1, 1] [2018-06-24 20:49:31,540 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:31,540 INFO ]: Analyzing trace with hash 1516313603, now seen corresponding path program 17 times [2018-06-24 20:49:31,540 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:31,540 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:31,541 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:31,541 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:31,541 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:31,575 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:32,020 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:32,020 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:32,020 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:49:32,025 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:49:32,129 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-24 20:49:32,129 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:32,148 INFO ]: Computing forward predicates... [2018-06-24 20:49:32,173 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:32,205 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:32,205 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-06-24 20:49:32,206 INFO ]: Interpolant automaton has 20 states [2018-06-24 20:49:32,206 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 20:49:32,206 INFO ]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:49:32,206 INFO ]: Start difference. First operand 23 states and 23 transitions. Second operand 20 states. [2018-06-24 20:49:32,519 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:32,519 INFO ]: Finished difference Result 24 states and 24 transitions. [2018-06-24 20:49:32,520 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 20:49:32,520 INFO ]: Start accepts. Automaton has 20 states. Word has length 22 [2018-06-24 20:49:32,520 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:32,521 INFO ]: With dead ends: 24 [2018-06-24 20:49:32,521 INFO ]: Without dead ends: 24 [2018-06-24 20:49:32,523 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:49:32,524 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-24 20:49:32,537 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-24 20:49:32,537 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 20:49:32,538 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-06-24 20:49:32,538 INFO ]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-06-24 20:49:32,538 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:32,538 INFO ]: Abstraction has 24 states and 24 transitions. [2018-06-24 20:49:32,538 INFO ]: Interpolant automaton has 20 states. [2018-06-24 20:49:32,538 INFO ]: Start isEmpty. Operand 24 states and 24 transitions. [2018-06-24 20:49:32,538 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 20:49:32,538 INFO ]: Found error trace [2018-06-24 20:49:32,538 INFO ]: trace histogram [18, 1, 1, 1, 1, 1] [2018-06-24 20:49:32,538 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:32,538 INFO ]: Analyzing trace with hash -238974141, now seen corresponding path program 18 times [2018-06-24 20:49:32,538 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:32,538 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:32,539 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:32,539 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:32,539 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:32,572 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:33,069 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:33,069 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:33,069 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:49:33,075 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:49:33,171 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-24 20:49:33,171 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:33,182 INFO ]: Computing forward predicates... [2018-06-24 20:49:33,210 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:33,243 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:33,243 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-06-24 20:49:33,243 INFO ]: Interpolant automaton has 21 states [2018-06-24 20:49:33,243 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 20:49:33,244 INFO ]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:49:33,244 INFO ]: Start difference. First operand 24 states and 24 transitions. Second operand 21 states. [2018-06-24 20:49:34,051 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:34,051 INFO ]: Finished difference Result 25 states and 25 transitions. [2018-06-24 20:49:34,053 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 20:49:34,053 INFO ]: Start accepts. Automaton has 21 states. Word has length 23 [2018-06-24 20:49:34,053 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:34,053 INFO ]: With dead ends: 25 [2018-06-24 20:49:34,053 INFO ]: Without dead ends: 25 [2018-06-24 20:49:34,054 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:49:34,054 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-24 20:49:34,055 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-24 20:49:34,056 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 20:49:34,056 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-06-24 20:49:34,056 INFO ]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-06-24 20:49:34,056 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:34,056 INFO ]: Abstraction has 25 states and 25 transitions. [2018-06-24 20:49:34,056 INFO ]: Interpolant automaton has 21 states. [2018-06-24 20:49:34,056 INFO ]: Start isEmpty. Operand 25 states and 25 transitions. [2018-06-24 20:49:34,057 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 20:49:34,057 INFO ]: Found error trace [2018-06-24 20:49:34,057 INFO ]: trace histogram [19, 1, 1, 1, 1, 1] [2018-06-24 20:49:34,057 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:34,057 INFO ]: Analyzing trace with hash 1181680643, now seen corresponding path program 19 times [2018-06-24 20:49:34,057 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:34,057 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:34,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:34,057 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:34,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:34,089 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:34,474 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:34,474 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:34,474 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:49:34,481 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:34,592 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:34,604 INFO ]: Computing forward predicates... [2018-06-24 20:49:34,651 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:34,671 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:34,671 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-06-24 20:49:34,671 INFO ]: Interpolant automaton has 22 states [2018-06-24 20:49:34,671 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 20:49:34,671 INFO ]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:49:34,671 INFO ]: Start difference. First operand 25 states and 25 transitions. Second operand 22 states. [2018-06-24 20:49:34,944 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:34,944 INFO ]: Finished difference Result 26 states and 26 transitions. [2018-06-24 20:49:34,944 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 20:49:34,944 INFO ]: Start accepts. Automaton has 22 states. Word has length 24 [2018-06-24 20:49:34,944 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:34,945 INFO ]: With dead ends: 26 [2018-06-24 20:49:34,945 INFO ]: Without dead ends: 26 [2018-06-24 20:49:34,945 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:49:34,945 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-24 20:49:34,947 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-24 20:49:34,947 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-24 20:49:34,947 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-06-24 20:49:34,947 INFO ]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-06-24 20:49:34,947 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:34,947 INFO ]: Abstraction has 26 states and 26 transitions. [2018-06-24 20:49:34,947 INFO ]: Interpolant automaton has 22 states. [2018-06-24 20:49:34,947 INFO ]: Start isEmpty. Operand 26 states and 26 transitions. [2018-06-24 20:49:34,948 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:49:34,948 INFO ]: Found error trace [2018-06-24 20:49:34,948 INFO ]: trace histogram [20, 1, 1, 1, 1, 1] [2018-06-24 20:49:34,948 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:34,948 INFO ]: Analyzing trace with hash -2022661309, now seen corresponding path program 20 times [2018-06-24 20:49:34,948 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:34,948 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:34,948 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:34,948 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:34,948 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:34,981 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:35,439 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:35,440 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:35,440 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:49:35,445 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:49:35,539 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:49:35,539 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:35,550 INFO ]: Computing forward predicates... [2018-06-24 20:49:35,602 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:35,632 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:35,632 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-06-24 20:49:35,632 INFO ]: Interpolant automaton has 23 states [2018-06-24 20:49:35,632 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 20:49:35,632 INFO ]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:49:35,632 INFO ]: Start difference. First operand 26 states and 26 transitions. Second operand 23 states. [2018-06-24 20:49:35,983 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:35,983 INFO ]: Finished difference Result 27 states and 27 transitions. [2018-06-24 20:49:35,983 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 20:49:35,983 INFO ]: Start accepts. Automaton has 23 states. Word has length 25 [2018-06-24 20:49:35,983 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:35,983 INFO ]: With dead ends: 27 [2018-06-24 20:49:35,983 INFO ]: Without dead ends: 27 [2018-06-24 20:49:35,984 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:49:35,984 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-24 20:49:35,985 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-24 20:49:35,985 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-24 20:49:35,986 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-06-24 20:49:35,986 INFO ]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-06-24 20:49:35,986 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:35,986 INFO ]: Abstraction has 27 states and 27 transitions. [2018-06-24 20:49:35,986 INFO ]: Interpolant automaton has 23 states. [2018-06-24 20:49:35,986 INFO ]: Start isEmpty. Operand 27 states and 27 transitions. [2018-06-24 20:49:35,986 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 20:49:35,986 INFO ]: Found error trace [2018-06-24 20:49:35,986 INFO ]: trace histogram [21, 1, 1, 1, 1, 1] [2018-06-24 20:49:35,986 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:35,987 INFO ]: Analyzing trace with hash 1721953283, now seen corresponding path program 21 times [2018-06-24 20:49:35,987 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:35,987 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:35,987 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:35,987 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:35,987 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:36,019 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:36,655 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:36,655 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:36,655 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:49:36,661 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:49:36,802 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-06-24 20:49:36,802 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:36,818 INFO ]: Computing forward predicates... [2018-06-24 20:49:36,843 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:36,866 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:36,866 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-06-24 20:49:36,866 INFO ]: Interpolant automaton has 24 states [2018-06-24 20:49:36,866 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 20:49:36,866 INFO ]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:49:36,867 INFO ]: Start difference. First operand 27 states and 27 transitions. Second operand 24 states. [2018-06-24 20:49:37,310 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:37,310 INFO ]: Finished difference Result 28 states and 28 transitions. [2018-06-24 20:49:37,314 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 20:49:37,314 INFO ]: Start accepts. Automaton has 24 states. Word has length 26 [2018-06-24 20:49:37,314 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:37,315 INFO ]: With dead ends: 28 [2018-06-24 20:49:37,315 INFO ]: Without dead ends: 28 [2018-06-24 20:49:37,315 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:49:37,315 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-24 20:49:37,316 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-24 20:49:37,316 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 20:49:37,317 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-06-24 20:49:37,317 INFO ]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-06-24 20:49:37,317 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:37,317 INFO ]: Abstraction has 28 states and 28 transitions. [2018-06-24 20:49:37,317 INFO ]: Interpolant automaton has 24 states. [2018-06-24 20:49:37,317 INFO ]: Start isEmpty. Operand 28 states and 28 transitions. [2018-06-24 20:49:37,317 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 20:49:37,317 INFO ]: Found error trace [2018-06-24 20:49:37,317 INFO ]: trace histogram [22, 1, 1, 1, 1, 1] [2018-06-24 20:49:37,317 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:37,317 INFO ]: Analyzing trace with hash 1840888643, now seen corresponding path program 22 times [2018-06-24 20:49:37,317 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:37,318 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:37,318 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:37,318 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:37,318 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:37,354 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:38,620 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:38,620 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:38,620 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:49:38,626 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:49:38,733 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:49:38,733 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:38,746 INFO ]: Computing forward predicates... [2018-06-24 20:49:38,777 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:38,796 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:38,797 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-06-24 20:49:38,797 INFO ]: Interpolant automaton has 25 states [2018-06-24 20:49:38,797 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 20:49:38,797 INFO ]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:49:38,797 INFO ]: Start difference. First operand 28 states and 28 transitions. Second operand 25 states. [2018-06-24 20:49:39,494 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:39,495 INFO ]: Finished difference Result 29 states and 29 transitions. [2018-06-24 20:49:39,497 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 20:49:39,497 INFO ]: Start accepts. Automaton has 25 states. Word has length 27 [2018-06-24 20:49:39,497 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:39,497 INFO ]: With dead ends: 29 [2018-06-24 20:49:39,497 INFO ]: Without dead ends: 29 [2018-06-24 20:49:39,497 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:49:39,497 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 20:49:39,499 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-24 20:49:39,499 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 20:49:39,499 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-06-24 20:49:39,499 INFO ]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-06-24 20:49:39,499 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:39,499 INFO ]: Abstraction has 29 states and 29 transitions. [2018-06-24 20:49:39,499 INFO ]: Interpolant automaton has 25 states. [2018-06-24 20:49:39,499 INFO ]: Start isEmpty. Operand 29 states and 29 transitions. [2018-06-24 20:49:39,499 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 20:49:39,499 INFO ]: Found error trace [2018-06-24 20:49:39,500 INFO ]: trace histogram [23, 1, 1, 1, 1, 1] [2018-06-24 20:49:39,500 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:39,500 INFO ]: Analyzing trace with hash 1232917507, now seen corresponding path program 23 times [2018-06-24 20:49:39,500 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:39,500 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:39,500 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:39,500 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:39,500 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:39,540 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:40,496 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:40,496 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:40,516 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:49:40,521 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:49:40,757 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-06-24 20:49:40,757 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:40,876 INFO ]: Computing forward predicates... [2018-06-24 20:49:40,911 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:40,941 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:40,941 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-06-24 20:49:40,942 INFO ]: Interpolant automaton has 26 states [2018-06-24 20:49:40,942 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 20:49:40,942 INFO ]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:49:40,942 INFO ]: Start difference. First operand 29 states and 29 transitions. Second operand 26 states. [2018-06-24 20:49:41,507 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:41,507 INFO ]: Finished difference Result 30 states and 30 transitions. [2018-06-24 20:49:41,508 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 20:49:41,508 INFO ]: Start accepts. Automaton has 26 states. Word has length 28 [2018-06-24 20:49:41,508 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:41,508 INFO ]: With dead ends: 30 [2018-06-24 20:49:41,508 INFO ]: Without dead ends: 30 [2018-06-24 20:49:41,508 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:49:41,508 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-24 20:49:41,510 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-24 20:49:41,510 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-24 20:49:41,511 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-06-24 20:49:41,511 INFO ]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-06-24 20:49:41,511 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:41,511 INFO ]: Abstraction has 30 states and 30 transitions. [2018-06-24 20:49:41,511 INFO ]: Interpolant automaton has 26 states. [2018-06-24 20:49:41,511 INFO ]: Start isEmpty. Operand 30 states and 30 transitions. [2018-06-24 20:49:41,513 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-24 20:49:41,513 INFO ]: Found error trace [2018-06-24 20:49:41,514 INFO ]: trace histogram [24, 1, 1, 1, 1, 1] [2018-06-24 20:49:41,514 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:41,514 INFO ]: Analyzing trace with hash -434318525, now seen corresponding path program 24 times [2018-06-24 20:49:41,514 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:41,514 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:41,514 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:41,514 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:41,514 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:41,590 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:43,093 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:43,093 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:43,093 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:49:43,099 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:49:43,234 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-06-24 20:49:43,234 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:43,249 INFO ]: Computing forward predicates... [2018-06-24 20:49:43,280 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:43,308 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:43,308 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-06-24 20:49:43,309 INFO ]: Interpolant automaton has 27 states [2018-06-24 20:49:43,309 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 20:49:43,309 INFO ]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:49:43,309 INFO ]: Start difference. First operand 30 states and 30 transitions. Second operand 27 states. [2018-06-24 20:49:43,775 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:43,775 INFO ]: Finished difference Result 31 states and 31 transitions. [2018-06-24 20:49:43,775 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-24 20:49:43,775 INFO ]: Start accepts. Automaton has 27 states. Word has length 29 [2018-06-24 20:49:43,775 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:43,775 INFO ]: With dead ends: 31 [2018-06-24 20:49:43,775 INFO ]: Without dead ends: 31 [2018-06-24 20:49:43,776 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:49:43,776 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 20:49:43,777 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-24 20:49:43,777 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 20:49:43,778 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-06-24 20:49:43,778 INFO ]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-06-24 20:49:43,778 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:43,778 INFO ]: Abstraction has 31 states and 31 transitions. [2018-06-24 20:49:43,778 INFO ]: Interpolant automaton has 27 states. [2018-06-24 20:49:43,778 INFO ]: Start isEmpty. Operand 31 states and 31 transitions. [2018-06-24 20:49:43,778 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-24 20:49:43,778 INFO ]: Found error trace [2018-06-24 20:49:43,778 INFO ]: trace histogram [25, 1, 1, 1, 1, 1] [2018-06-24 20:49:43,778 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:43,779 INFO ]: Analyzing trace with hash -579027965, now seen corresponding path program 25 times [2018-06-24 20:49:43,779 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:43,779 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:43,779 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:43,779 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:43,779 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:43,828 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:45,517 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:45,517 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:45,538 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:49:45,544 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:45,676 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:45,691 INFO ]: Computing forward predicates... [2018-06-24 20:49:45,726 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:45,751 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:45,751 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-06-24 20:49:45,751 INFO ]: Interpolant automaton has 28 states [2018-06-24 20:49:45,751 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-24 20:49:45,751 INFO ]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:49:45,751 INFO ]: Start difference. First operand 31 states and 31 transitions. Second operand 28 states. [2018-06-24 20:49:46,239 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:46,239 INFO ]: Finished difference Result 32 states and 32 transitions. [2018-06-24 20:49:46,239 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-24 20:49:46,239 INFO ]: Start accepts. Automaton has 28 states. Word has length 30 [2018-06-24 20:49:46,239 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:46,240 INFO ]: With dead ends: 32 [2018-06-24 20:49:46,240 INFO ]: Without dead ends: 32 [2018-06-24 20:49:46,240 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:49:46,240 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-24 20:49:46,241 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-24 20:49:46,241 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-24 20:49:46,242 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-06-24 20:49:46,242 INFO ]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-06-24 20:49:46,242 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:46,242 INFO ]: Abstraction has 32 states and 32 transitions. [2018-06-24 20:49:46,242 INFO ]: Interpolant automaton has 28 states. [2018-06-24 20:49:46,242 INFO ]: Start isEmpty. Operand 32 states and 32 transitions. [2018-06-24 20:49:46,243 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-24 20:49:46,243 INFO ]: Found error trace [2018-06-24 20:49:46,243 INFO ]: trace histogram [26, 1, 1, 1, 1, 1] [2018-06-24 20:49:46,243 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:46,243 INFO ]: Analyzing trace with hash -770053309, now seen corresponding path program 26 times [2018-06-24 20:49:46,243 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:46,243 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:46,243 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:46,243 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:46,243 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:46,287 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:46,981 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:46,982 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:46,982 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:49:46,994 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:49:47,108 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:49:47,108 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:47,123 INFO ]: Computing forward predicates... [2018-06-24 20:49:47,154 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:47,174 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:47,174 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-06-24 20:49:47,174 INFO ]: Interpolant automaton has 29 states [2018-06-24 20:49:47,174 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-24 20:49:47,174 INFO ]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:49:47,175 INFO ]: Start difference. First operand 32 states and 32 transitions. Second operand 29 states. [2018-06-24 20:49:47,762 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:47,762 INFO ]: Finished difference Result 33 states and 33 transitions. [2018-06-24 20:49:47,762 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-24 20:49:47,762 INFO ]: Start accepts. Automaton has 29 states. Word has length 31 [2018-06-24 20:49:47,762 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:47,762 INFO ]: With dead ends: 33 [2018-06-24 20:49:47,762 INFO ]: Without dead ends: 33 [2018-06-24 20:49:47,763 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:49:47,763 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-24 20:49:47,765 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-24 20:49:47,765 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-24 20:49:47,765 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-06-24 20:49:47,765 INFO ]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-06-24 20:49:47,765 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:47,765 INFO ]: Abstraction has 33 states and 33 transitions. [2018-06-24 20:49:47,765 INFO ]: Interpolant automaton has 29 states. [2018-06-24 20:49:47,765 INFO ]: Start isEmpty. Operand 33 states and 33 transitions. [2018-06-24 20:49:47,766 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 20:49:47,766 INFO ]: Found error trace [2018-06-24 20:49:47,766 INFO ]: trace histogram [27, 1, 1, 1, 1, 1] [2018-06-24 20:49:47,766 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:47,766 INFO ]: Analyzing trace with hash 1898095619, now seen corresponding path program 27 times [2018-06-24 20:49:47,766 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:47,766 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:47,766 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:47,766 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:47,766 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:47,819 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:48,867 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:48,867 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:48,867 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:49:48,873 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:49:49,077 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-06-24 20:49:49,077 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:49,102 INFO ]: Computing forward predicates... [2018-06-24 20:49:49,132 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:49,151 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:49,151 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-06-24 20:49:49,152 INFO ]: Interpolant automaton has 30 states [2018-06-24 20:49:49,152 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-24 20:49:49,152 INFO ]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-06-24 20:49:49,152 INFO ]: Start difference. First operand 33 states and 33 transitions. Second operand 30 states. [2018-06-24 20:49:49,800 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:49,800 INFO ]: Finished difference Result 34 states and 34 transitions. [2018-06-24 20:49:49,802 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-24 20:49:49,802 INFO ]: Start accepts. Automaton has 30 states. Word has length 32 [2018-06-24 20:49:49,802 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:49,802 INFO ]: With dead ends: 34 [2018-06-24 20:49:49,802 INFO ]: Without dead ends: 34 [2018-06-24 20:49:49,802 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-06-24 20:49:49,802 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-24 20:49:49,804 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-24 20:49:49,804 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 20:49:49,804 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-06-24 20:49:49,805 INFO ]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-06-24 20:49:49,805 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:49,805 INFO ]: Abstraction has 34 states and 34 transitions. [2018-06-24 20:49:49,805 INFO ]: Interpolant automaton has 30 states. [2018-06-24 20:49:49,805 INFO ]: Start isEmpty. Operand 34 states and 34 transitions. [2018-06-24 20:49:49,805 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-24 20:49:49,805 INFO ]: Found error trace [2018-06-24 20:49:49,805 INFO ]: trace histogram [28, 1, 1, 1, 1, 1] [2018-06-24 20:49:49,805 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:49,805 INFO ]: Analyzing trace with hash -1288633533, now seen corresponding path program 28 times [2018-06-24 20:49:49,805 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:49,805 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:49,806 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:49,806 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:49,806 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:49,846 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:50,725 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:50,725 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:50,725 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:49:50,730 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:49:50,852 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:49:50,852 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:50,870 INFO ]: Computing forward predicates... [2018-06-24 20:49:50,912 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:50,944 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:50,944 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-06-24 20:49:50,944 INFO ]: Interpolant automaton has 31 states [2018-06-24 20:49:50,944 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-24 20:49:50,945 INFO ]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:49:50,945 INFO ]: Start difference. First operand 34 states and 34 transitions. Second operand 31 states. [2018-06-24 20:49:51,682 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:51,683 INFO ]: Finished difference Result 35 states and 35 transitions. [2018-06-24 20:49:51,683 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 20:49:51,683 INFO ]: Start accepts. Automaton has 31 states. Word has length 33 [2018-06-24 20:49:51,683 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:51,683 INFO ]: With dead ends: 35 [2018-06-24 20:49:51,683 INFO ]: Without dead ends: 35 [2018-06-24 20:49:51,683 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:49:51,684 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 20:49:51,685 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-24 20:49:51,685 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 20:49:51,685 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-06-24 20:49:51,685 INFO ]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-06-24 20:49:51,686 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:51,686 INFO ]: Abstraction has 35 states and 35 transitions. [2018-06-24 20:49:51,686 INFO ]: Interpolant automaton has 31 states. [2018-06-24 20:49:51,686 INFO ]: Start isEmpty. Operand 35 states and 35 transitions. [2018-06-24 20:49:51,686 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 20:49:51,686 INFO ]: Found error trace [2018-06-24 20:49:51,686 INFO ]: trace histogram [29, 1, 1, 1, 1, 1] [2018-06-24 20:49:51,686 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:51,686 INFO ]: Analyzing trace with hash -1292989437, now seen corresponding path program 29 times [2018-06-24 20:49:51,686 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:51,686 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:51,687 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:51,687 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:51,687 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:51,739 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:52,555 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:52,555 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:52,555 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:49:52,561 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:49:53,161 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-06-24 20:49:53,161 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:53,563 INFO ]: Computing forward predicates... [2018-06-24 20:49:53,614 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:53,634 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:53,634 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-06-24 20:49:53,634 INFO ]: Interpolant automaton has 32 states [2018-06-24 20:49:53,634 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-24 20:49:53,634 INFO ]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:49:53,634 INFO ]: Start difference. First operand 35 states and 35 transitions. Second operand 32 states. [2018-06-24 20:49:54,588 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:54,588 INFO ]: Finished difference Result 36 states and 36 transitions. [2018-06-24 20:49:54,588 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-24 20:49:54,588 INFO ]: Start accepts. Automaton has 32 states. Word has length 34 [2018-06-24 20:49:54,588 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:54,588 INFO ]: With dead ends: 36 [2018-06-24 20:49:54,588 INFO ]: Without dead ends: 36 [2018-06-24 20:49:54,589 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:49:54,589 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-24 20:49:54,590 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-24 20:49:54,590 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-24 20:49:54,591 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-06-24 20:49:54,591 INFO ]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-06-24 20:49:54,591 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:54,591 INFO ]: Abstraction has 36 states and 36 transitions. [2018-06-24 20:49:54,591 INFO ]: Interpolant automaton has 32 states. [2018-06-24 20:49:54,591 INFO ]: Start isEmpty. Operand 36 states and 36 transitions. [2018-06-24 20:49:54,591 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-24 20:49:54,591 INFO ]: Found error trace [2018-06-24 20:49:54,591 INFO ]: trace histogram [30, 1, 1, 1, 1, 1] [2018-06-24 20:49:54,591 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:54,591 INFO ]: Analyzing trace with hash -1428022461, now seen corresponding path program 30 times [2018-06-24 20:49:54,592 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:54,592 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:54,592 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:54,592 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:54,592 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:54,644 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:56,007 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:56,007 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:56,007 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:49:56,013 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:49:56,193 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-06-24 20:49:56,193 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:56,214 INFO ]: Computing forward predicates... [2018-06-24 20:49:56,257 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:56,290 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:56,290 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-06-24 20:49:56,290 INFO ]: Interpolant automaton has 33 states [2018-06-24 20:49:56,290 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-24 20:49:56,290 INFO ]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:49:56,291 INFO ]: Start difference. First operand 36 states and 36 transitions. Second operand 33 states. [2018-06-24 20:49:57,274 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:57,274 INFO ]: Finished difference Result 37 states and 37 transitions. [2018-06-24 20:49:57,274 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-24 20:49:57,274 INFO ]: Start accepts. Automaton has 33 states. Word has length 35 [2018-06-24 20:49:57,274 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:57,275 INFO ]: With dead ends: 37 [2018-06-24 20:49:57,275 INFO ]: Without dead ends: 37 [2018-06-24 20:49:57,275 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:49:57,275 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-24 20:49:57,276 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-24 20:49:57,277 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-24 20:49:57,277 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-06-24 20:49:57,277 INFO ]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-06-24 20:49:57,277 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:57,277 INFO ]: Abstraction has 37 states and 37 transitions. [2018-06-24 20:49:57,277 INFO ]: Interpolant automaton has 33 states. [2018-06-24 20:49:57,277 INFO ]: Start isEmpty. Operand 37 states and 37 transitions. [2018-06-24 20:49:57,277 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-24 20:49:57,277 INFO ]: Found error trace [2018-06-24 20:49:57,277 INFO ]: trace histogram [31, 1, 1, 1, 1, 1] [2018-06-24 20:49:57,277 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:57,277 INFO ]: Analyzing trace with hash -1319078909, now seen corresponding path program 31 times [2018-06-24 20:49:57,277 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:57,277 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:57,278 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:57,278 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:57,278 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:57,335 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:58,878 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:58,878 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:58,878 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:49:58,883 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:59,015 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:59,035 INFO ]: Computing forward predicates... [2018-06-24 20:49:59,064 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:59,083 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:59,083 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-06-24 20:49:59,083 INFO ]: Interpolant automaton has 34 states [2018-06-24 20:49:59,083 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-24 20:49:59,084 INFO ]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:49:59,084 INFO ]: Start difference. First operand 37 states and 37 transitions. Second operand 34 states. [2018-06-24 20:49:59,980 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:59,980 INFO ]: Finished difference Result 38 states and 38 transitions. [2018-06-24 20:49:59,981 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-24 20:49:59,981 INFO ]: Start accepts. Automaton has 34 states. Word has length 36 [2018-06-24 20:49:59,981 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:59,981 INFO ]: With dead ends: 38 [2018-06-24 20:49:59,981 INFO ]: Without dead ends: 38 [2018-06-24 20:49:59,981 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:49:59,981 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-24 20:49:59,983 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-24 20:49:59,983 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-24 20:49:59,983 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-06-24 20:49:59,983 INFO ]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-06-24 20:49:59,983 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:59,983 INFO ]: Abstraction has 38 states and 38 transitions. [2018-06-24 20:49:59,983 INFO ]: Interpolant automaton has 34 states. [2018-06-24 20:49:59,983 INFO ]: Start isEmpty. Operand 38 states and 38 transitions. [2018-06-24 20:49:59,984 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-24 20:49:59,984 INFO ]: Found error trace [2018-06-24 20:49:59,984 INFO ]: trace histogram [32, 1, 1, 1, 1, 1] [2018-06-24 20:49:59,984 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:59,984 INFO ]: Analyzing trace with hash 2058171203, now seen corresponding path program 32 times [2018-06-24 20:49:59,984 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:59,984 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:59,985 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:59,985 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:59,985 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:00,049 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:00,940 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:00,941 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:00,941 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:00,946 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:50:01,091 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:50:01,091 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:01,123 INFO ]: Computing forward predicates... [2018-06-24 20:50:01,202 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:01,235 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:01,235 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-06-24 20:50:01,235 INFO ]: Interpolant automaton has 35 states [2018-06-24 20:50:01,236 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-24 20:50:01,236 INFO ]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 20:50:01,236 INFO ]: Start difference. First operand 38 states and 38 transitions. Second operand 35 states. [2018-06-24 20:50:02,192 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:02,192 INFO ]: Finished difference Result 39 states and 39 transitions. [2018-06-24 20:50:02,192 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-24 20:50:02,192 INFO ]: Start accepts. Automaton has 35 states. Word has length 37 [2018-06-24 20:50:02,192 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:02,192 INFO ]: With dead ends: 39 [2018-06-24 20:50:02,192 INFO ]: Without dead ends: 39 [2018-06-24 20:50:02,193 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 20:50:02,193 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-24 20:50:02,194 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-24 20:50:02,194 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-24 20:50:02,194 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-06-24 20:50:02,194 INFO ]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-06-24 20:50:02,194 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:02,194 INFO ]: Abstraction has 39 states and 39 transitions. [2018-06-24 20:50:02,194 INFO ]: Interpolant automaton has 35 states. [2018-06-24 20:50:02,194 INFO ]: Start isEmpty. Operand 39 states and 39 transitions. [2018-06-24 20:50:02,195 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-24 20:50:02,195 INFO ]: Found error trace [2018-06-24 20:50:02,195 INFO ]: trace histogram [33, 1, 1, 1, 1, 1] [2018-06-24 20:50:02,195 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:02,195 INFO ]: Analyzing trace with hash -621257725, now seen corresponding path program 33 times [2018-06-24 20:50:02,195 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:02,195 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:02,195 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:02,195 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:02,195 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:02,229 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:03,891 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:03,891 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:03,891 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:03,896 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:50:04,207 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-06-24 20:50:04,207 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:04,252 INFO ]: Computing forward predicates... [2018-06-24 20:50:04,292 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:04,327 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:04,327 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-06-24 20:50:04,327 INFO ]: Interpolant automaton has 36 states [2018-06-24 20:50:04,327 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-24 20:50:04,328 INFO ]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:50:04,328 INFO ]: Start difference. First operand 39 states and 39 transitions. Second operand 36 states. [2018-06-24 20:50:05,509 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:05,509 INFO ]: Finished difference Result 40 states and 40 transitions. [2018-06-24 20:50:05,509 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-24 20:50:05,509 INFO ]: Start accepts. Automaton has 36 states. Word has length 38 [2018-06-24 20:50:05,509 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:05,510 INFO ]: With dead ends: 40 [2018-06-24 20:50:05,510 INFO ]: Without dead ends: 40 [2018-06-24 20:50:05,510 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:50:05,510 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-24 20:50:05,511 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-24 20:50:05,511 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-24 20:50:05,512 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-06-24 20:50:05,512 INFO ]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-06-24 20:50:05,512 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:05,512 INFO ]: Abstraction has 40 states and 40 transitions. [2018-06-24 20:50:05,512 INFO ]: Interpolant automaton has 36 states. [2018-06-24 20:50:05,512 INFO ]: Start isEmpty. Operand 40 states and 40 transitions. [2018-06-24 20:50:05,512 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-24 20:50:05,512 INFO ]: Found error trace [2018-06-24 20:50:05,512 INFO ]: trace histogram [34, 1, 1, 1, 1, 1] [2018-06-24 20:50:05,512 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:05,512 INFO ]: Analyzing trace with hash -2079175869, now seen corresponding path program 34 times [2018-06-24 20:50:05,512 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:05,512 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:05,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:05,513 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:05,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:05,575 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:07,039 INFO ]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:07,039 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:07,039 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:07,045 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:50:07,196 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:50:07,196 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:07,219 INFO ]: Computing forward predicates... [2018-06-24 20:50:07,251 INFO ]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:07,272 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:07,272 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-06-24 20:50:07,272 INFO ]: Interpolant automaton has 37 states [2018-06-24 20:50:07,272 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-24 20:50:07,272 INFO ]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:50:07,272 INFO ]: Start difference. First operand 40 states and 40 transitions. Second operand 37 states. [2018-06-24 20:50:08,326 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:08,326 INFO ]: Finished difference Result 41 states and 41 transitions. [2018-06-24 20:50:08,326 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-24 20:50:08,326 INFO ]: Start accepts. Automaton has 37 states. Word has length 39 [2018-06-24 20:50:08,326 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:08,326 INFO ]: With dead ends: 41 [2018-06-24 20:50:08,326 INFO ]: Without dead ends: 41 [2018-06-24 20:50:08,327 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:50:08,327 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-24 20:50:08,328 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-24 20:50:08,328 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-24 20:50:08,328 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-06-24 20:50:08,328 INFO ]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-06-24 20:50:08,328 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:08,328 INFO ]: Abstraction has 41 states and 41 transitions. [2018-06-24 20:50:08,328 INFO ]: Interpolant automaton has 37 states. [2018-06-24 20:50:08,328 INFO ]: Start isEmpty. Operand 41 states and 41 transitions. [2018-06-24 20:50:08,328 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-24 20:50:08,328 INFO ]: Found error trace [2018-06-24 20:50:08,328 INFO ]: trace histogram [35, 1, 1, 1, 1, 1] [2018-06-24 20:50:08,328 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:08,328 INFO ]: Analyzing trace with hash -29998077, now seen corresponding path program 35 times [2018-06-24 20:50:08,328 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:08,328 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:08,329 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:08,329 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:08,329 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:08,394 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:09,481 INFO ]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:09,481 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:09,481 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:09,487 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:50:10,618 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-06-24 20:50:10,618 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:11,174 INFO ]: Computing forward predicates... [2018-06-24 20:50:11,275 INFO ]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:11,308 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:11,308 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-06-24 20:50:11,308 INFO ]: Interpolant automaton has 38 states [2018-06-24 20:50:11,308 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-24 20:50:11,308 INFO ]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 20:50:11,308 INFO ]: Start difference. First operand 41 states and 41 transitions. Second operand 38 states. [2018-06-24 20:50:12,289 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:12,289 INFO ]: Finished difference Result 42 states and 42 transitions. [2018-06-24 20:50:12,290 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-24 20:50:12,290 INFO ]: Start accepts. Automaton has 38 states. Word has length 40 [2018-06-24 20:50:12,290 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:12,290 INFO ]: With dead ends: 42 [2018-06-24 20:50:12,290 INFO ]: Without dead ends: 42 [2018-06-24 20:50:12,290 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 20:50:12,290 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-24 20:50:12,291 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-24 20:50:12,291 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-24 20:50:12,292 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-06-24 20:50:12,292 INFO ]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-06-24 20:50:12,292 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:12,292 INFO ]: Abstraction has 42 states and 42 transitions. [2018-06-24 20:50:12,292 INFO ]: Interpolant automaton has 38 states. [2018-06-24 20:50:12,292 INFO ]: Start isEmpty. Operand 42 states and 42 transitions. [2018-06-24 20:50:12,292 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-24 20:50:12,292 INFO ]: Found error trace [2018-06-24 20:50:12,292 INFO ]: trace histogram [36, 1, 1, 1, 1, 1] [2018-06-24 20:50:12,292 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:12,292 INFO ]: Analyzing trace with hash -929995965, now seen corresponding path program 36 times [2018-06-24 20:50:12,292 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:12,292 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:12,293 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:12,293 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:12,293 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:12,360 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:13,865 INFO ]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:13,865 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:13,865 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:13,871 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:50:14,136 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-06-24 20:50:14,136 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:14,176 INFO ]: Computing forward predicates... [2018-06-24 20:50:14,286 INFO ]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:14,312 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:14,312 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-06-24 20:50:14,312 INFO ]: Interpolant automaton has 39 states [2018-06-24 20:50:14,312 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-24 20:50:14,312 INFO ]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-06-24 20:50:14,312 INFO ]: Start difference. First operand 42 states and 42 transitions. Second operand 39 states. [2018-06-24 20:50:15,492 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:15,492 INFO ]: Finished difference Result 43 states and 43 transitions. [2018-06-24 20:50:15,492 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-24 20:50:15,492 INFO ]: Start accepts. Automaton has 39 states. Word has length 41 [2018-06-24 20:50:15,492 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:15,492 INFO ]: With dead ends: 43 [2018-06-24 20:50:15,492 INFO ]: Without dead ends: 43 [2018-06-24 20:50:15,493 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-06-24 20:50:15,493 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-24 20:50:15,494 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-06-24 20:50:15,494 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-24 20:50:15,494 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-06-24 20:50:15,494 INFO ]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-06-24 20:50:15,494 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:15,494 INFO ]: Abstraction has 43 states and 43 transitions. [2018-06-24 20:50:15,494 INFO ]: Interpolant automaton has 39 states. [2018-06-24 20:50:15,494 INFO ]: Start isEmpty. Operand 43 states and 43 transitions. [2018-06-24 20:50:15,495 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-24 20:50:15,495 INFO ]: Found error trace [2018-06-24 20:50:15,495 INFO ]: trace histogram [37, 1, 1, 1, 1, 1] [2018-06-24 20:50:15,495 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:15,495 INFO ]: Analyzing trace with hash 1234840579, now seen corresponding path program 37 times [2018-06-24 20:50:15,495 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:15,495 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:15,495 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:15,495 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:15,495 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:15,563 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:17,027 INFO ]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:17,027 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:17,027 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:17,032 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:17,195 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:17,222 INFO ]: Computing forward predicates... [2018-06-24 20:50:17,274 INFO ]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:17,307 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:17,307 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-06-24 20:50:17,307 INFO ]: Interpolant automaton has 40 states [2018-06-24 20:50:17,307 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-24 20:50:17,307 INFO ]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 20:50:17,308 INFO ]: Start difference. First operand 43 states and 43 transitions. Second operand 40 states. Received shutdown request... [2018-06-24 20:50:18,358 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 20:50:18,358 WARN ]: Verification canceled [2018-06-24 20:50:18,360 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:50:18,362 WARN ]: Timeout [2018-06-24 20:50:18,362 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:50:18 BasicIcfg [2018-06-24 20:50:18,362 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:50:18,363 INFO ]: Toolchain (without parser) took 59631.64 ms. Allocated memory was 304.1 MB in the beginning and 733.0 MB in the end (delta: 428.9 MB). Free memory was 260.6 MB in the beginning and 347.5 MB in the end (delta: -86.9 MB). Peak memory consumption was 342.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:50:18,364 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 304.1 MB. Free memory is still 269.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:50:18,365 INFO ]: ChcToBoogie took 61.34 ms. Allocated memory is still 304.1 MB. Free memory was 260.6 MB in the beginning and 258.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:50:18,365 INFO ]: Boogie Preprocessor took 32.98 ms. Allocated memory is still 304.1 MB. Free memory was 258.6 MB in the beginning and 256.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:50:18,365 INFO ]: RCFGBuilder took 271.06 ms. Allocated memory is still 304.1 MB. Free memory was 256.6 MB in the beginning and 249.6 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:50:18,366 INFO ]: BlockEncodingV2 took 124.70 ms. Allocated memory is still 304.1 MB. Free memory was 249.6 MB in the beginning and 245.6 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:50:18,366 INFO ]: TraceAbstraction took 59132.15 ms. Allocated memory was 304.1 MB in the beginning and 733.0 MB in the end (delta: 428.9 MB). Free memory was 244.6 MB in the beginning and 347.5 MB in the end (delta: -102.9 MB). Peak memory consumption was 326.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:50:18,373 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 11 locations, 11 edges - StatisticsResult: Encoded RCFG 6 locations, 6 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 304.1 MB. Free memory is still 269.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 61.34 ms. Allocated memory is still 304.1 MB. Free memory was 260.6 MB in the beginning and 258.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 32.98 ms. Allocated memory is still 304.1 MB. Free memory was 258.6 MB in the beginning and 256.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 271.06 ms. Allocated memory is still 304.1 MB. Free memory was 256.6 MB in the beginning and 249.6 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 124.70 ms. Allocated memory is still 304.1 MB. Free memory was 249.6 MB in the beginning and 245.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 59132.15 ms. Allocated memory was 304.1 MB in the beginning and 733.0 MB in the end (delta: 428.9 MB). Free memory was 244.6 MB in the beginning and 347.5 MB in the end (delta: -102.9 MB). Peak memory consumption was 326.0 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 (43states) and interpolant automaton (currently 14 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (13 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 59.0s OverallTime, 38 OverallIterations, 37 TraceHistogramMax, 18.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 187 SDtfs, 0 SDslu, 2147 SDs, 0 SdLazy, 19436 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1668 GetRequests, 890 SyntacticMatches, 37 SemanticMatches, 741 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 37 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 6.4s SatisfiabilityAnalysisTime, 31.7s InterpolantComputationTime, 1781 NumberOfCodeBlocks, 1781 NumberOfCodeBlocksAsserted, 264 NumberOfCheckSat, 1706 ConstructedInterpolants, 0 QuantifiedInterpolants, 1379662 SizeOfPredicates, 3108 NumberOfNonLiveVariables, 30229 ConjunctsInSsa, 15059 ConjunctsInUnsatCore, 75 InterpolantComputations, 1 PerfectInterpolantSequences, 0/18278 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/fib_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-50-18-482.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fib_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-50-18-482.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fib_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-50-18-482.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fib_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-50-18-482.csv Completed graceful shutdown