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/HOLA/21.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:40:23,430 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:40:23,432 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:40:23,443 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:40:23,443 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:40:23,444 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:40:23,445 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:40:23,446 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:40:23,448 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:40:23,449 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:40:23,449 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:40:23,449 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:40:23,450 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:40:23,451 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:40:23,452 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:40:23,453 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:40:23,454 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:40:23,458 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:40:23,467 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:40:23,468 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:40:23,469 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:40:23,472 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:40:23,472 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:40:23,472 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:40:23,473 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:40:23,474 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:40:23,474 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:40:23,475 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:40:23,476 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:40:23,476 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:40:23,477 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:40:23,477 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:40:23,478 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:40:23,478 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:40:23,479 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:40:23,479 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:40:23,499 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:40:23,501 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:40:23,501 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:40:23,501 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:40:23,502 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:40:23,502 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:40:23,503 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:40:23,503 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:40:23,503 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:40:23,503 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:40:23,503 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:40:23,504 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:40:23,504 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:40:23,504 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:40:23,504 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:40:23,504 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:40:23,505 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:40:23,506 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:40:23,506 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:40:23,506 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:40:23,506 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:40:23,508 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:40:23,508 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:40:23,557 INFO ]: Repository-Root is: /tmp [2018-06-24 20:40:23,574 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:40:23,579 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:40:23,580 INFO ]: Initializing SmtParser... [2018-06-24 20:40:23,580 INFO ]: SmtParser initialized [2018-06-24 20:40:23,580 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/21.c.smt2 [2018-06-24 20:40:23,581 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:40:23,670 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/21.c.smt2 unknown [2018-06-24 20:40:24,312 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/21.c.smt2 [2018-06-24 20:40:24,317 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:40:24,323 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:40:24,323 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:40:24,324 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:40:24,324 INFO ]: ChcToBoogie initialized [2018-06-24 20:40:24,328 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:40:24" (1/1) ... [2018-06-24 20:40:24,405 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:40:24 Unit [2018-06-24 20:40:24,405 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:40:24,406 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:40:24,406 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:40:24,406 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:40:24,420 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:40:24" (1/1) ... [2018-06-24 20:40:24,420 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:40:24" (1/1) ... [2018-06-24 20:40:24,431 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:40:24" (1/1) ... [2018-06-24 20:40:24,431 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:40:24" (1/1) ... [2018-06-24 20:40:24,440 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:40:24" (1/1) ... [2018-06-24 20:40:24,443 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:40:24" (1/1) ... [2018-06-24 20:40:24,446 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:40:24" (1/1) ... [2018-06-24 20:40:24,451 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:40:24,451 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:40:24,451 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:40:24,451 INFO ]: RCFGBuilder initialized [2018-06-24 20:40:24,452 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:40:24" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:40:24,471 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:40:24,471 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:40:24,471 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:40:24,471 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:40:24,471 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:40:24,471 INFO ]: Found implementation of procedure Ultimate.START [2018-06-24 20:40:25,362 INFO ]: Using library mode [2018-06-24 20:40:25,363 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:40:25 BoogieIcfgContainer [2018-06-24 20:40:25,363 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:40:25,363 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:40:25,363 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:40:25,365 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:40:25,365 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:40:25" (1/1) ... [2018-06-24 20:40:25,387 INFO ]: Initial Icfg 41 locations, 45 edges [2018-06-24 20:40:25,388 INFO ]: Using Remove infeasible edges [2018-06-24 20:40:25,389 INFO ]: Using Maximize final states [2018-06-24 20:40:25,389 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:40:25,389 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:40:25,392 INFO ]: Using Remove sink states [2018-06-24 20:40:25,393 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:40:25,393 INFO ]: Using Use SBE [2018-06-24 20:40:25,410 INFO ]: SBE split 0 edges [2018-06-24 20:40:25,417 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 20:40:25,419 INFO ]: 0 new accepting states [2018-06-24 20:40:26,397 INFO ]: Removed 69 edges and 32 locations by large block encoding [2018-06-24 20:40:26,399 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:40:26,403 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:40:26,403 INFO ]: 0 new accepting states [2018-06-24 20:40:26,403 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:40:26,403 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:40:26,403 INFO ]: Encoded RCFG 7 locations, 11 edges [2018-06-24 20:40:26,403 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:40:26 BasicIcfg [2018-06-24 20:40:26,404 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:40:26,405 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:40:26,405 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:40:26,408 INFO ]: TraceAbstraction initialized [2018-06-24 20:40:26,408 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:40:24" (1/4) ... [2018-06-24 20:40:26,409 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5770e89d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:40:26, skipping insertion in model container [2018-06-24 20:40:26,409 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:40:24" (2/4) ... [2018-06-24 20:40:26,409 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5770e89d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:40:26, skipping insertion in model container [2018-06-24 20:40:26,409 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:40:25" (3/4) ... [2018-06-24 20:40:26,409 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5770e89d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:40:26, skipping insertion in model container [2018-06-24 20:40:26,409 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:40:26" (4/4) ... [2018-06-24 20:40:26,411 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:40:26,420 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:40:26,427 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:40:26,469 INFO ]: Using default assertion order modulation [2018-06-24 20:40:26,469 INFO ]: Interprodecural is true [2018-06-24 20:40:26,469 INFO ]: Hoare is false [2018-06-24 20:40:26,469 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:40:26,469 INFO ]: Backedges is TWOTRACK [2018-06-24 20:40:26,470 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:40:26,470 INFO ]: Difference is false [2018-06-24 20:40:26,470 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:40:26,470 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:40:26,481 INFO ]: Start isEmpty. Operand 7 states. [2018-06-24 20:40:26,490 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:40:26,490 INFO ]: Found error trace [2018-06-24 20:40:26,491 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:40:26,491 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:26,496 INFO ]: Analyzing trace with hash 33951611, now seen corresponding path program 1 times [2018-06-24 20:40:26,498 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:26,498 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:26,543 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:26,543 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:40:26,543 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:26,656 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:26,829 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:40:26,831 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:40:26,831 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:40:26,832 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:40:26,842 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:40:26,842 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:40:26,844 INFO ]: Start difference. First operand 7 states. Second operand 3 states. [2018-06-24 20:40:27,022 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:27,022 INFO ]: Finished difference Result 9 states and 17 transitions. [2018-06-24 20:40:27,022 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:40:27,023 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:40:27,023 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:27,030 INFO ]: With dead ends: 9 [2018-06-24 20:40:27,030 INFO ]: Without dead ends: 9 [2018-06-24 20:40:27,032 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:40:27,047 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 20:40:27,071 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-06-24 20:40:27,072 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 20:40:27,072 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2018-06-24 20:40:27,075 INFO ]: Start accepts. Automaton has 8 states and 14 transitions. Word has length 5 [2018-06-24 20:40:27,075 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:27,075 INFO ]: Abstraction has 8 states and 14 transitions. [2018-06-24 20:40:27,076 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:40:27,076 INFO ]: Start isEmpty. Operand 8 states and 14 transitions. [2018-06-24 20:40:27,076 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:40:27,076 INFO ]: Found error trace [2018-06-24 20:40:27,076 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:40:27,076 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:27,076 INFO ]: Analyzing trace with hash -1743578594, now seen corresponding path program 1 times [2018-06-24 20:40:27,076 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:27,076 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:27,077 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:27,077 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:40:27,077 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:27,143 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:27,520 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:40:27,520 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:27,520 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:40:27,535 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:40:27,740 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:27,760 INFO ]: Computing forward predicates... [2018-06-24 20:40:28,013 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:40:28,047 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:28,047 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-24 20:40:28,047 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:40:28,047 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:40:28,048 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:40:28,048 INFO ]: Start difference. First operand 8 states and 14 transitions. Second operand 7 states. [2018-06-24 20:40:28,504 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:28,504 INFO ]: Finished difference Result 12 states and 26 transitions. [2018-06-24 20:40:28,505 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:40:28,505 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-24 20:40:28,505 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:28,505 INFO ]: With dead ends: 12 [2018-06-24 20:40:28,506 INFO ]: Without dead ends: 12 [2018-06-24 20:40:28,506 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:40:28,506 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 20:40:28,508 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-06-24 20:40:28,508 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:40:28,508 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 20 transitions. [2018-06-24 20:40:28,508 INFO ]: Start accepts. Automaton has 10 states and 20 transitions. Word has length 7 [2018-06-24 20:40:28,508 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:28,508 INFO ]: Abstraction has 10 states and 20 transitions. [2018-06-24 20:40:28,508 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:40:28,509 INFO ]: Start isEmpty. Operand 10 states and 20 transitions. [2018-06-24 20:40:28,509 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:40:28,509 INFO ]: Found error trace [2018-06-24 20:40:28,509 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:40:28,509 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:28,509 INFO ]: Analyzing trace with hash -1742655073, now seen corresponding path program 1 times [2018-06-24 20:40:28,509 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:28,509 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:28,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:28,510 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:40:28,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:28,529 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:28,606 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:28,606 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:40:28,606 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:40:28,606 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:40:28,606 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:40:28,607 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:40:28,607 INFO ]: Start difference. First operand 10 states and 20 transitions. Second operand 3 states. [2018-06-24 20:40:28,664 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:28,664 INFO ]: Finished difference Result 14 states and 30 transitions. [2018-06-24 20:40:28,664 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:40:28,664 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 20:40:28,664 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:28,666 INFO ]: With dead ends: 14 [2018-06-24 20:40:28,667 INFO ]: Without dead ends: 14 [2018-06-24 20:40:28,667 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:40:28,667 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 20:40:28,669 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-06-24 20:40:28,669 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:40:28,670 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 22 transitions. [2018-06-24 20:40:28,670 INFO ]: Start accepts. Automaton has 11 states and 22 transitions. Word has length 7 [2018-06-24 20:40:28,670 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:28,670 INFO ]: Abstraction has 11 states and 22 transitions. [2018-06-24 20:40:28,670 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:40:28,670 INFO ]: Start isEmpty. Operand 11 states and 22 transitions. [2018-06-24 20:40:28,670 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:40:28,670 INFO ]: Found error trace [2018-06-24 20:40:28,670 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:40:28,670 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:28,671 INFO ]: Analyzing trace with hash -1742625282, now seen corresponding path program 1 times [2018-06-24 20:40:28,671 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:28,671 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:28,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:28,671 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:40:28,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:28,689 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:28,733 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:28,733 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:40:28,733 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:40:28,733 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:40:28,733 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:40:28,733 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:40:28,734 INFO ]: Start difference. First operand 11 states and 22 transitions. Second operand 3 states. [2018-06-24 20:40:28,770 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:28,770 INFO ]: Finished difference Result 12 states and 22 transitions. [2018-06-24 20:40:28,771 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:40:28,771 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 20:40:28,771 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:28,771 INFO ]: With dead ends: 12 [2018-06-24 20:40:28,771 INFO ]: Without dead ends: 11 [2018-06-24 20:40:28,771 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:40:28,771 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 20:40:28,773 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-24 20:40:28,773 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:40:28,773 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-06-24 20:40:28,773 INFO ]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 7 [2018-06-24 20:40:28,773 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:28,773 INFO ]: Abstraction has 11 states and 19 transitions. [2018-06-24 20:40:28,773 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:40:28,773 INFO ]: Start isEmpty. Operand 11 states and 19 transitions. [2018-06-24 20:40:28,773 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:40:28,773 INFO ]: Found error trace [2018-06-24 20:40:28,774 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:40:28,774 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:28,774 INFO ]: Analyzing trace with hash -1741701761, now seen corresponding path program 1 times [2018-06-24 20:40:28,774 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:28,774 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:28,774 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:28,774 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:40:28,774 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:28,800 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:28,946 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:40:28,946 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:28,946 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:40:28,952 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:40:29,147 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:29,154 INFO ]: Computing forward predicates... [2018-06-24 20:40:29,385 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:40:29,405 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:29,405 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-24 20:40:29,405 INFO ]: Interpolant automaton has 8 states [2018-06-24 20:40:29,406 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 20:40:29,406 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:40:29,406 INFO ]: Start difference. First operand 11 states and 19 transitions. Second operand 8 states. [2018-06-24 20:40:29,644 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:29,644 INFO ]: Finished difference Result 18 states and 35 transitions. [2018-06-24 20:40:29,644 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:40:29,644 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-24 20:40:29,644 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:29,645 INFO ]: With dead ends: 18 [2018-06-24 20:40:29,645 INFO ]: Without dead ends: 18 [2018-06-24 20:40:29,645 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:40:29,645 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 20:40:29,647 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 13. [2018-06-24 20:40:29,647 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:40:29,647 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-06-24 20:40:29,647 INFO ]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 7 [2018-06-24 20:40:29,647 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:29,647 INFO ]: Abstraction has 13 states and 23 transitions. [2018-06-24 20:40:29,647 INFO ]: Interpolant automaton has 8 states. [2018-06-24 20:40:29,648 INFO ]: Start isEmpty. Operand 13 states and 23 transitions. [2018-06-24 20:40:29,648 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:40:29,648 INFO ]: Found error trace [2018-06-24 20:40:29,648 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2018-06-24 20:40:29,648 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:29,648 INFO ]: Analyzing trace with hash -553121791, now seen corresponding path program 2 times [2018-06-24 20:40:29,648 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:29,648 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:29,649 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:29,649 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:40:29,649 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:29,682 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:29,835 INFO ]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:29,835 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:29,835 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:29,846 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:40:30,019 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:40:30,019 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:30,029 INFO ]: Computing forward predicates... [2018-06-24 20:40:30,262 INFO ]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:30,282 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:30,282 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-24 20:40:30,282 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:40:30,283 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:40:30,283 INFO ]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:40:30,283 INFO ]: Start difference. First operand 13 states and 23 transitions. Second operand 12 states. [2018-06-24 20:40:30,893 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:30,894 INFO ]: Finished difference Result 19 states and 37 transitions. [2018-06-24 20:40:30,894 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:40:30,894 INFO ]: Start accepts. Automaton has 12 states. Word has length 9 [2018-06-24 20:40:30,894 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:30,894 INFO ]: With dead ends: 19 [2018-06-24 20:40:30,895 INFO ]: Without dead ends: 19 [2018-06-24 20:40:30,895 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:40:30,895 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 20:40:30,897 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 15. [2018-06-24 20:40:30,897 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 20:40:30,897 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 28 transitions. [2018-06-24 20:40:30,898 INFO ]: Start accepts. Automaton has 15 states and 28 transitions. Word has length 9 [2018-06-24 20:40:30,898 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:30,898 INFO ]: Abstraction has 15 states and 28 transitions. [2018-06-24 20:40:30,898 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:40:30,898 INFO ]: Start isEmpty. Operand 15 states and 28 transitions. [2018-06-24 20:40:30,898 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:40:30,898 INFO ]: Found error trace [2018-06-24 20:40:30,898 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:40:30,898 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:30,898 INFO ]: Analyzing trace with hash -551244958, now seen corresponding path program 1 times [2018-06-24 20:40:30,898 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:30,898 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:30,899 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:30,899 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:30,899 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:30,928 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:31,104 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:31,105 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:40:31,105 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:40:31,105 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:40:31,105 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:40:31,105 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:40:31,105 INFO ]: Start difference. First operand 15 states and 28 transitions. Second operand 4 states. [2018-06-24 20:40:31,145 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:31,145 INFO ]: Finished difference Result 22 states and 38 transitions. [2018-06-24 20:40:31,145 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:40:31,145 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-24 20:40:31,145 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:31,146 INFO ]: With dead ends: 22 [2018-06-24 20:40:31,146 INFO ]: Without dead ends: 21 [2018-06-24 20:40:31,146 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:40:31,146 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 20:40:31,149 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-06-24 20:40:31,149 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 20:40:31,149 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2018-06-24 20:40:31,149 INFO ]: Start accepts. Automaton has 20 states and 34 transitions. Word has length 9 [2018-06-24 20:40:31,149 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:31,149 INFO ]: Abstraction has 20 states and 34 transitions. [2018-06-24 20:40:31,149 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:40:31,149 INFO ]: Start isEmpty. Operand 20 states and 34 transitions. [2018-06-24 20:40:31,150 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:40:31,150 INFO ]: Found error trace [2018-06-24 20:40:31,150 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:40:31,150 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:31,150 INFO ]: Analyzing trace with hash -522615807, now seen corresponding path program 1 times [2018-06-24 20:40:31,150 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:31,150 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:31,151 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:31,151 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:40:31,151 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:31,167 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:31,237 INFO ]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:40:31,237 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:40:31,237 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:40:31,237 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:40:31,237 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:40:31,237 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:40:31,237 INFO ]: Start difference. First operand 20 states and 34 transitions. Second operand 3 states. [2018-06-24 20:40:31,305 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:31,305 INFO ]: Finished difference Result 15 states and 18 transitions. [2018-06-24 20:40:31,305 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:40:31,305 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-24 20:40:31,305 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:31,306 INFO ]: With dead ends: 15 [2018-06-24 20:40:31,306 INFO ]: Without dead ends: 15 [2018-06-24 20:40:31,306 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:40:31,306 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 20:40:31,307 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-06-24 20:40:31,307 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:40:31,308 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-06-24 20:40:31,308 INFO ]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 9 [2018-06-24 20:40:31,308 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:31,308 INFO ]: Abstraction has 14 states and 17 transitions. [2018-06-24 20:40:31,308 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:40:31,308 INFO ]: Start isEmpty. Operand 14 states and 17 transitions. [2018-06-24 20:40:31,308 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:40:31,308 INFO ]: Found error trace [2018-06-24 20:40:31,308 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:40:31,308 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:31,308 INFO ]: Analyzing trace with hash 1250514722, now seen corresponding path program 2 times [2018-06-24 20:40:31,308 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:31,308 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:31,309 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:31,309 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:40:31,309 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:31,331 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:31,485 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:31,485 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:40:31,540 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:40:31,541 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:40:31,541 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:40:31,541 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:40:31,541 INFO ]: Start difference. First operand 14 states and 17 transitions. Second operand 4 states. [2018-06-24 20:40:31,864 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:31,864 INFO ]: Finished difference Result 16 states and 19 transitions. [2018-06-24 20:40:31,864 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:40:31,864 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-24 20:40:31,864 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:31,864 INFO ]: With dead ends: 16 [2018-06-24 20:40:31,864 INFO ]: Without dead ends: 12 [2018-06-24 20:40:31,865 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:40:31,865 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 20:40:31,866 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-24 20:40:31,866 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 20:40:31,866 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-06-24 20:40:31,866 INFO ]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2018-06-24 20:40:31,866 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:31,866 INFO ]: Abstraction has 12 states and 12 transitions. [2018-06-24 20:40:31,866 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:40:31,866 INFO ]: Start isEmpty. Operand 12 states and 12 transitions. [2018-06-24 20:40:31,867 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:40:31,867 INFO ]: Found error trace [2018-06-24 20:40:31,867 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1] [2018-06-24 20:40:31,867 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:31,868 INFO ]: Analyzing trace with hash 1014565156, now seen corresponding path program 3 times [2018-06-24 20:40:31,868 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:31,868 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:31,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:31,869 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:31,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:31,903 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:32,154 INFO ]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:32,154 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:32,154 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:40:32,162 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:40:32,430 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 20:40:32,430 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:32,446 INFO ]: Computing forward predicates... [2018-06-24 20:40:32,750 INFO ]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:32,770 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:32,770 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-24 20:40:32,771 INFO ]: Interpolant automaton has 16 states [2018-06-24 20:40:32,771 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 20:40:32,771 INFO ]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:40:32,771 INFO ]: Start difference. First operand 12 states and 12 transitions. Second operand 16 states. [2018-06-24 20:40:33,297 WARN ]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-06-24 20:40:33,406 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:33,406 INFO ]: Finished difference Result 15 states and 15 transitions. [2018-06-24 20:40:33,407 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:40:33,407 INFO ]: Start accepts. Automaton has 16 states. Word has length 11 [2018-06-24 20:40:33,407 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:33,407 INFO ]: With dead ends: 15 [2018-06-24 20:40:33,407 INFO ]: Without dead ends: 15 [2018-06-24 20:40:33,408 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:40:33,408 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 20:40:33,409 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-06-24 20:40:33,409 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:40:33,410 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-06-24 20:40:33,410 INFO ]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-06-24 20:40:33,410 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:33,410 INFO ]: Abstraction has 14 states and 14 transitions. [2018-06-24 20:40:33,410 INFO ]: Interpolant automaton has 16 states. [2018-06-24 20:40:33,410 INFO ]: Start isEmpty. Operand 14 states and 14 transitions. [2018-06-24 20:40:33,410 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:40:33,410 INFO ]: Found error trace [2018-06-24 20:40:33,410 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1] [2018-06-24 20:40:33,410 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:33,410 INFO ]: Analyzing trace with hash 28200327, now seen corresponding path program 4 times [2018-06-24 20:40:33,410 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:33,410 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:33,411 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:33,411 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:33,411 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:33,449 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:33,717 INFO ]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:33,718 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:33,718 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:33,725 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:40:33,992 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:40:33,992 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:34,010 INFO ]: Computing forward predicates... [2018-06-24 20:40:34,364 INFO ]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:34,386 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:34,386 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-06-24 20:40:34,386 INFO ]: Interpolant automaton has 20 states [2018-06-24 20:40:34,386 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 20:40:34,386 INFO ]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:40:34,386 INFO ]: Start difference. First operand 14 states and 14 transitions. Second operand 20 states. [2018-06-24 20:40:35,284 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:35,284 INFO ]: Finished difference Result 17 states and 17 transitions. [2018-06-24 20:40:35,285 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:40:35,285 INFO ]: Start accepts. Automaton has 20 states. Word has length 13 [2018-06-24 20:40:35,285 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:35,285 INFO ]: With dead ends: 17 [2018-06-24 20:40:35,285 INFO ]: Without dead ends: 17 [2018-06-24 20:40:35,286 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2018-06-24 20:40:35,286 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 20:40:35,286 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-06-24 20:40:35,286 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:40:35,287 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-06-24 20:40:35,287 INFO ]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-06-24 20:40:35,287 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:35,287 INFO ]: Abstraction has 16 states and 16 transitions. [2018-06-24 20:40:35,287 INFO ]: Interpolant automaton has 20 states. [2018-06-24 20:40:35,287 INFO ]: Start isEmpty. Operand 16 states and 16 transitions. [2018-06-24 20:40:35,287 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:40:35,287 INFO ]: Found error trace [2018-06-24 20:40:35,287 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1] [2018-06-24 20:40:35,287 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:35,287 INFO ]: Analyzing trace with hash 1319372074, now seen corresponding path program 5 times [2018-06-24 20:40:35,287 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:35,287 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:35,288 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:35,288 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:35,288 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:35,343 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:36,366 INFO ]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:36,366 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:36,366 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:40:36,383 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:36,677 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-24 20:40:36,677 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:36,700 INFO ]: Computing forward predicates... [2018-06-24 20:40:37,138 INFO ]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:37,160 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:37,160 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2018-06-24 20:40:37,160 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:40:37,160 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:40:37,160 INFO ]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:40:37,160 INFO ]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-06-24 20:40:37,377 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:37,377 INFO ]: Finished difference Result 19 states and 19 transitions. [2018-06-24 20:40:37,378 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 20:40:37,378 INFO ]: Start accepts. Automaton has 15 states. Word has length 15 [2018-06-24 20:40:37,378 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:37,378 INFO ]: With dead ends: 19 [2018-06-24 20:40:37,378 INFO ]: Without dead ends: 19 [2018-06-24 20:40:37,379 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:40:37,379 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 20:40:37,380 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-06-24 20:40:37,380 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 20:40:37,380 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-06-24 20:40:37,380 INFO ]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-06-24 20:40:37,380 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:37,381 INFO ]: Abstraction has 18 states and 18 transitions. [2018-06-24 20:40:37,381 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:40:37,381 INFO ]: Start isEmpty. Operand 18 states and 18 transitions. [2018-06-24 20:40:37,381 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:40:37,381 INFO ]: Found error trace [2018-06-24 20:40:37,381 INFO ]: trace histogram [6, 6, 1, 1, 1, 1, 1] [2018-06-24 20:40:37,381 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:37,381 INFO ]: Analyzing trace with hash 889872397, now seen corresponding path program 6 times [2018-06-24 20:40:37,381 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:37,381 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:37,382 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:37,382 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:37,382 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:37,429 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:38,074 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:40:38,074 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:38,074 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:38,080 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:40:38,453 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-24 20:40:38,453 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:38,480 INFO ]: Computing forward predicates... [2018-06-24 20:40:38,833 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:40:38,859 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:38,859 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2018-06-24 20:40:38,859 INFO ]: Interpolant automaton has 17 states [2018-06-24 20:40:38,859 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 20:40:38,859 INFO ]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:40:38,860 INFO ]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-06-24 20:40:39,136 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:39,136 INFO ]: Finished difference Result 21 states and 21 transitions. [2018-06-24 20:40:39,137 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 20:40:39,137 INFO ]: Start accepts. Automaton has 17 states. Word has length 17 [2018-06-24 20:40:39,137 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:39,138 INFO ]: With dead ends: 21 [2018-06-24 20:40:39,138 INFO ]: Without dead ends: 21 [2018-06-24 20:40:39,139 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 8 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=728, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:40:39,139 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 20:40:39,140 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-06-24 20:40:39,140 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 20:40:39,141 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-06-24 20:40:39,141 INFO ]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-06-24 20:40:39,141 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:39,141 INFO ]: Abstraction has 20 states and 20 transitions. [2018-06-24 20:40:39,141 INFO ]: Interpolant automaton has 17 states. [2018-06-24 20:40:39,141 INFO ]: Start isEmpty. Operand 20 states and 20 transitions. [2018-06-24 20:40:39,141 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 20:40:39,141 INFO ]: Found error trace [2018-06-24 20:40:39,141 INFO ]: trace histogram [7, 7, 1, 1, 1, 1, 1] [2018-06-24 20:40:39,141 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:39,141 INFO ]: Analyzing trace with hash 457543216, now seen corresponding path program 7 times [2018-06-24 20:40:39,141 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:39,141 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:39,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:39,142 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:39,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:39,184 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:39,471 INFO ]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:39,471 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:39,471 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:40:39,477 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:40:39,808 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:39,827 INFO ]: Computing forward predicates... [2018-06-24 20:40:41,050 INFO ]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:41,072 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:41,072 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-06-24 20:40:41,072 INFO ]: Interpolant automaton has 32 states [2018-06-24 20:40:41,072 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-24 20:40:41,073 INFO ]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:40:41,073 INFO ]: Start difference. First operand 20 states and 20 transitions. Second operand 32 states. [2018-06-24 20:40:43,033 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:43,033 INFO ]: Finished difference Result 23 states and 23 transitions. [2018-06-24 20:40:43,033 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 20:40:43,033 INFO ]: Start accepts. Automaton has 32 states. Word has length 19 [2018-06-24 20:40:43,034 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:43,034 INFO ]: With dead ends: 23 [2018-06-24 20:40:43,034 INFO ]: Without dead ends: 23 [2018-06-24 20:40:43,034 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=155, Invalid=2101, Unknown=0, NotChecked=0, Total=2256 [2018-06-24 20:40:43,034 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-24 20:40:43,036 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-06-24 20:40:43,036 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-24 20:40:43,036 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-06-24 20:40:43,036 INFO ]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-06-24 20:40:43,036 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:43,036 INFO ]: Abstraction has 22 states and 22 transitions. [2018-06-24 20:40:43,036 INFO ]: Interpolant automaton has 32 states. [2018-06-24 20:40:43,036 INFO ]: Start isEmpty. Operand 22 states and 22 transitions. [2018-06-24 20:40:43,037 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 20:40:43,037 INFO ]: Found error trace [2018-06-24 20:40:43,037 INFO ]: trace histogram [8, 8, 1, 1, 1, 1, 1] [2018-06-24 20:40:43,037 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:43,037 INFO ]: Analyzing trace with hash 1601027987, now seen corresponding path program 8 times [2018-06-24 20:40:43,037 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:43,037 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:43,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:43,038 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:40:43,038 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:43,086 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:43,712 INFO ]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:43,712 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:43,712 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:40:43,717 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:40:44,056 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:40:44,056 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:44,082 INFO ]: Computing forward predicates... [2018-06-24 20:40:45,267 INFO ]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:45,303 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:45,303 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2018-06-24 20:40:45,303 INFO ]: Interpolant automaton has 36 states [2018-06-24 20:40:45,303 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-24 20:40:45,303 INFO ]: CoverageRelationStatistics Valid=76, Invalid=1184, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:40:45,304 INFO ]: Start difference. First operand 22 states and 22 transitions. Second operand 36 states. [2018-06-24 20:40:47,683 WARN ]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-06-24 20:40:51,819 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:51,820 INFO ]: Finished difference Result 25 states and 25 transitions. [2018-06-24 20:40:51,820 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 20:40:51,821 INFO ]: Start accepts. Automaton has 36 states. Word has length 21 [2018-06-24 20:40:51,821 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:51,821 INFO ]: With dead ends: 25 [2018-06-24 20:40:51,821 INFO ]: Without dead ends: 25 [2018-06-24 20:40:51,822 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=196, Invalid=2666, Unknown=0, NotChecked=0, Total=2862 [2018-06-24 20:40:51,822 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-24 20:40:51,823 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-06-24 20:40:51,824 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 20:40:51,824 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-06-24 20:40:51,824 INFO ]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-06-24 20:40:51,824 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:51,824 INFO ]: Abstraction has 24 states and 24 transitions. [2018-06-24 20:40:51,824 INFO ]: Interpolant automaton has 36 states. [2018-06-24 20:40:51,824 INFO ]: Start isEmpty. Operand 24 states and 24 transitions. [2018-06-24 20:40:51,825 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 20:40:51,825 INFO ]: Found error trace [2018-06-24 20:40:51,825 INFO ]: trace histogram [9, 9, 1, 1, 1, 1, 1] [2018-06-24 20:40:51,825 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:51,825 INFO ]: Analyzing trace with hash 978265142, now seen corresponding path program 9 times [2018-06-24 20:40:51,825 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:51,825 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:51,825 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:51,825 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:51,825 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:51,886 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:52,930 INFO ]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:52,930 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:52,930 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:40:52,935 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:40:53,423 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-06-24 20:40:53,423 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:53,459 INFO ]: Computing forward predicates... [2018-06-24 20:40:56,466 INFO ]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:56,490 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:56,490 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2018-06-24 20:40:56,490 INFO ]: Interpolant automaton has 40 states [2018-06-24 20:40:56,491 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-24 20:40:56,491 INFO ]: CoverageRelationStatistics Valid=85, Invalid=1475, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 20:40:56,491 INFO ]: Start difference. First operand 24 states and 24 transitions. Second operand 40 states. [2018-06-24 20:41:12,428 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:12,428 INFO ]: Finished difference Result 27 states and 27 transitions. [2018-06-24 20:41:12,483 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 20:41:12,483 INFO ]: Start accepts. Automaton has 40 states. Word has length 23 [2018-06-24 20:41:12,483 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:12,484 INFO ]: With dead ends: 27 [2018-06-24 20:41:12,484 INFO ]: Without dead ends: 27 [2018-06-24 20:41:12,485 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=219, Invalid=3321, Unknown=0, NotChecked=0, Total=3540 [2018-06-24 20:41:12,485 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-24 20:41:12,487 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-06-24 20:41:12,487 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-24 20:41:12,487 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-06-24 20:41:12,487 INFO ]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2018-06-24 20:41:12,487 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:12,487 INFO ]: Abstraction has 26 states and 26 transitions. [2018-06-24 20:41:12,487 INFO ]: Interpolant automaton has 40 states. [2018-06-24 20:41:12,488 INFO ]: Start isEmpty. Operand 26 states and 26 transitions. [2018-06-24 20:41:12,488 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:41:12,488 INFO ]: Found error trace [2018-06-24 20:41:12,488 INFO ]: trace histogram [10, 10, 1, 1, 1, 1, 1] [2018-06-24 20:41:12,488 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:12,488 INFO ]: Analyzing trace with hash -496374759, now seen corresponding path program 10 times [2018-06-24 20:41:12,488 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:12,488 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:12,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:12,489 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:41:12,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:12,545 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:12,964 INFO ]: Checked inductivity of 100 backedges. 91 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:12,965 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:12,965 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:41:12,970 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:41:13,419 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:41:13,419 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:13,450 INFO ]: Computing forward predicates... [2018-06-24 20:41:15,026 INFO ]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:15,060 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:15,060 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 42 [2018-06-24 20:41:15,060 INFO ]: Interpolant automaton has 42 states [2018-06-24 20:41:15,060 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-24 20:41:15,060 INFO ]: CoverageRelationStatistics Valid=153, Invalid=1569, Unknown=0, NotChecked=0, Total=1722 [2018-06-24 20:41:15,061 INFO ]: Start difference. First operand 26 states and 26 transitions. Second operand 42 states. Received shutdown request... [2018-06-24 20:41:30,171 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:41:30,172 WARN ]: Verification canceled [2018-06-24 20:41:30,173 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:41:30,174 WARN ]: Timeout [2018-06-24 20:41:30,174 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:41:30 BasicIcfg [2018-06-24 20:41:30,174 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:41:30,175 INFO ]: Toolchain (without parser) took 65857.73 ms. Allocated memory was 308.8 MB in the beginning and 749.2 MB in the end (delta: 440.4 MB). Free memory was 232.1 MB in the beginning and 292.6 MB in the end (delta: -60.5 MB). Peak memory consumption was 379.9 MB. Max. memory is 3.6 GB. [2018-06-24 20:41:30,176 INFO ]: SmtParser took 0.05 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:41:30,176 INFO ]: ChcToBoogie took 82.20 ms. Allocated memory is still 308.8 MB. Free memory was 232.1 MB in the beginning and 229.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:41:30,176 INFO ]: Boogie Preprocessor took 44.90 ms. Allocated memory is still 308.8 MB. Free memory was 229.1 MB in the beginning and 227.1 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:41:30,177 INFO ]: RCFGBuilder took 911.42 ms. Allocated memory was 308.8 MB in the beginning and 326.6 MB in the end (delta: 17.8 MB). Free memory was 227.1 MB in the beginning and 272.9 MB in the end (delta: -45.8 MB). Peak memory consumption was 45.2 MB. Max. memory is 3.6 GB. [2018-06-24 20:41:30,177 INFO ]: BlockEncodingV2 took 1040.48 ms. Allocated memory was 326.6 MB in the beginning and 359.1 MB in the end (delta: 32.5 MB). Free memory was 272.9 MB in the beginning and 329.6 MB in the end (delta: -56.6 MB). Peak memory consumption was 97.8 MB. Max. memory is 3.6 GB. [2018-06-24 20:41:30,177 INFO ]: TraceAbstraction took 63769.51 ms. Allocated memory was 359.1 MB in the beginning and 749.2 MB in the end (delta: 390.1 MB). Free memory was 329.6 MB in the beginning and 292.6 MB in the end (delta: 37.0 MB). Peak memory consumption was 427.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:41:30,181 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 41 locations, 45 edges - StatisticsResult: Encoded RCFG 7 locations, 11 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.05 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 82.20 ms. Allocated memory is still 308.8 MB. Free memory was 232.1 MB in the beginning and 229.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 44.90 ms. Allocated memory is still 308.8 MB. Free memory was 229.1 MB in the beginning and 227.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 911.42 ms. Allocated memory was 308.8 MB in the beginning and 326.6 MB in the end (delta: 17.8 MB). Free memory was 227.1 MB in the beginning and 272.9 MB in the end (delta: -45.8 MB). Peak memory consumption was 45.2 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 1040.48 ms. Allocated memory was 326.6 MB in the beginning and 359.1 MB in the end (delta: 32.5 MB). Free memory was 272.9 MB in the beginning and 329.6 MB in the end (delta: -56.6 MB). Peak memory consumption was 97.8 MB. Max. memory is 3.6 GB. * TraceAbstraction took 63769.51 ms. Allocated memory was 359.1 MB in the beginning and 749.2 MB in the end (delta: 390.1 MB). Free memory was 329.6 MB in the beginning and 292.6 MB in the end (delta: 37.0 MB). Peak memory consumption was 427.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 (26states) and interpolant automaton (currently 12 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 51 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 7 locations, 1 error locations. TIMEOUT Result, 63.7s OverallTime, 17 OverallIterations, 10 TraceHistogramMax, 43.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 135 SDtfs, 32 SDslu, 760 SDs, 0 SdLazy, 2949 SolverSat, 296 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 28.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 444 GetRequests, 78 SyntacticMatches, 14 SemanticMatches, 351 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1345 ImplicationChecksByTransitivity, 27.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 24 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 380 NumberOfCodeBlocks, 380 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 352 ConstructedInterpolants, 76 QuantifiedInterpolants, 51830 SizeOfPredicates, 2021 NumberOfNonLiveVariables, 28738 ConjunctsInSsa, 2116 ConjunctsInUnsatCore, 28 InterpolantComputations, 6 PerfectInterpolantSequences, 105/786 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/21.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-41-30-191.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/21.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-41-30-191.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/21.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-41-30-191.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/21.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-41-30-191.csv Completed graceful shutdown