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/upcount_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:53:54,967 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:53:54,969 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:53:54,981 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:53:54,982 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:53:54,983 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:53:54,984 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:53:54,991 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:53:54,992 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:53:54,993 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:53:54,995 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:53:54,995 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:53:54,996 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:53:54,997 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:53:54,997 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:53:55,000 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:53:55,001 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:53:55,012 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:53:55,013 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:53:55,014 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:53:55,015 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:53:55,017 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:53:55,021 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:53:55,022 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:53:55,022 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:53:55,023 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:53:55,024 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:53:55,024 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:53:55,025 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:53:55,026 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:53:55,028 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:53:55,029 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:53:55,029 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:53:55,030 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:53:55,030 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:53:55,032 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:53:55,045 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:53:55,045 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:53:55,045 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:53:55,045 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:53:55,046 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:53:55,046 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:53:55,047 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:53:55,048 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:53:55,048 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:53:55,048 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:53:55,048 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:53:55,049 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:53:55,049 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:53:55,049 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:53:55,049 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:53:55,049 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:53:55,050 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:53:55,050 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:53:55,050 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:53:55,050 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:53:55,050 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:53:55,051 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:53:55,053 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:53:55,097 INFO ]: Repository-Root is: /tmp [2018-06-24 20:53:55,114 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:53:55,117 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:53:55,119 INFO ]: Initializing SmtParser... [2018-06-24 20:53:55,119 INFO ]: SmtParser initialized [2018-06-24 20:53:55,120 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/upcount_merged_safe.c-1.smt2 [2018-06-24 20:53:55,121 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:53:55,190 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/upcount_merged_safe.c-1.smt2 unknown [2018-06-24 20:53:55,404 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/upcount_merged_safe.c-1.smt2 [2018-06-24 20:53:55,409 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:53:55,414 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:53:55,415 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:53:55,415 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:53:55,415 INFO ]: ChcToBoogie initialized [2018-06-24 20:53:55,418 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:53:55" (1/1) ... [2018-06-24 20:53:55,478 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:53:55 Unit [2018-06-24 20:53:55,478 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:53:55,479 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:53:55,479 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:53:55,479 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:53:55,500 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:53:55" (1/1) ... [2018-06-24 20:53:55,500 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:53:55" (1/1) ... [2018-06-24 20:53:55,505 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:53:55" (1/1) ... [2018-06-24 20:53:55,505 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:53:55" (1/1) ... [2018-06-24 20:53:55,507 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:53:55" (1/1) ... [2018-06-24 20:53:55,510 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:53:55" (1/1) ... [2018-06-24 20:53:55,511 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:53:55" (1/1) ... [2018-06-24 20:53:55,512 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:53:55,513 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:53:55,513 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:53:55,513 INFO ]: RCFGBuilder initialized [2018-06-24 20:53:55,514 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:53:55" (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:53:55,526 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:53:55,526 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:53:55,526 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:53:55,526 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:53:55,527 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:53:55,527 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:53:55,804 INFO ]: Using library mode [2018-06-24 20:53:55,804 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:53:55 BoogieIcfgContainer [2018-06-24 20:53:55,804 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:53:55,805 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:53:55,805 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:53:55,806 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:53:55,806 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:53:55" (1/1) ... [2018-06-24 20:53:55,835 INFO ]: Initial Icfg 13 locations, 14 edges [2018-06-24 20:53:55,836 INFO ]: Using Remove infeasible edges [2018-06-24 20:53:55,836 INFO ]: Using Maximize final states [2018-06-24 20:53:55,837 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:53:55,837 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:53:55,844 INFO ]: Using Remove sink states [2018-06-24 20:53:55,845 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:53:55,845 INFO ]: Using Use SBE [2018-06-24 20:53:55,860 INFO ]: SBE split 0 edges [2018-06-24 20:53:55,864 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 20:53:55,866 INFO ]: 0 new accepting states [2018-06-24 20:53:55,935 INFO ]: Removed 8 edges and 4 locations by large block encoding [2018-06-24 20:53:55,937 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:53:55,943 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:53:55,943 INFO ]: 0 new accepting states [2018-06-24 20:53:55,943 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:53:55,943 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:53:55,944 INFO ]: Encoded RCFG 7 locations, 8 edges [2018-06-24 20:53:55,944 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:53:55 BasicIcfg [2018-06-24 20:53:55,944 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:53:55,945 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:53:55,945 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:53:55,948 INFO ]: TraceAbstraction initialized [2018-06-24 20:53:55,948 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:53:55" (1/4) ... [2018-06-24 20:53:55,949 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1970deae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:53:55, skipping insertion in model container [2018-06-24 20:53:55,949 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:53:55" (2/4) ... [2018-06-24 20:53:55,949 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1970deae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:53:55, skipping insertion in model container [2018-06-24 20:53:55,949 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:53:55" (3/4) ... [2018-06-24 20:53:55,949 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1970deae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:53:55, skipping insertion in model container [2018-06-24 20:53:55,949 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:53:55" (4/4) ... [2018-06-24 20:53:55,951 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:53:55,960 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:53:55,968 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:53:56,008 INFO ]: Using default assertion order modulation [2018-06-24 20:53:56,009 INFO ]: Interprodecural is true [2018-06-24 20:53:56,009 INFO ]: Hoare is false [2018-06-24 20:53:56,009 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:53:56,009 INFO ]: Backedges is TWOTRACK [2018-06-24 20:53:56,009 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:53:56,009 INFO ]: Difference is false [2018-06-24 20:53:56,009 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:53:56,009 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:53:56,018 INFO ]: Start isEmpty. Operand 7 states. [2018-06-24 20:53:56,026 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:53:56,026 INFO ]: Found error trace [2018-06-24 20:53:56,027 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:53:56,027 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:56,032 INFO ]: Analyzing trace with hash 987439445, now seen corresponding path program 1 times [2018-06-24 20:53:56,034 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:56,035 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:56,067 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:56,067 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:53:56,067 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:56,109 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:56,208 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:53:56,210 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:53:56,210 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:53:56,211 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:53:56,221 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:53:56,221 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:53:56,223 INFO ]: Start difference. First operand 7 states. Second operand 4 states. [2018-06-24 20:53:56,305 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:56,305 INFO ]: Finished difference Result 8 states and 9 transitions. [2018-06-24 20:53:56,305 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:53:56,306 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 20:53:56,306 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:56,312 INFO ]: With dead ends: 8 [2018-06-24 20:53:56,312 INFO ]: Without dead ends: 8 [2018-06-24 20:53:56,314 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:53:56,328 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 20:53:56,346 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 20:53:56,357 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 20:53:56,357 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-06-24 20:53:56,358 INFO ]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2018-06-24 20:53:56,358 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:56,358 INFO ]: Abstraction has 8 states and 9 transitions. [2018-06-24 20:53:56,358 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:53:56,358 INFO ]: Start isEmpty. Operand 8 states and 9 transitions. [2018-06-24 20:53:56,359 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:53:56,359 INFO ]: Found error trace [2018-06-24 20:53:56,359 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:56,359 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:56,359 INFO ]: Analyzing trace with hash 545379014, now seen corresponding path program 1 times [2018-06-24 20:53:56,359 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:56,359 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:56,364 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:56,364 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:53:56,364 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:56,383 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:56,699 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:53:56,699 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:56,699 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:53:56,706 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:53:56,751 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:56,760 INFO ]: Computing forward predicates... [2018-06-24 20:53:56,906 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:53:56,939 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:56,939 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-24 20:53:56,940 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:53:56,940 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:53:56,940 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:53:56,940 INFO ]: Start difference. First operand 8 states and 9 transitions. Second operand 6 states. [2018-06-24 20:53:57,189 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:57,190 INFO ]: Finished difference Result 13 states and 16 transitions. [2018-06-24 20:53:57,190 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:53:57,190 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-24 20:53:57,190 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:57,192 INFO ]: With dead ends: 13 [2018-06-24 20:53:57,192 INFO ]: Without dead ends: 13 [2018-06-24 20:53:57,193 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:53:57,193 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 20:53:57,195 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-06-24 20:53:57,195 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:53:57,196 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-06-24 20:53:57,196 INFO ]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 7 [2018-06-24 20:53:57,196 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:57,196 INFO ]: Abstraction has 10 states and 12 transitions. [2018-06-24 20:53:57,196 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:53:57,196 INFO ]: Start isEmpty. Operand 10 states and 12 transitions. [2018-06-24 20:53:57,196 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:53:57,196 INFO ]: Found error trace [2018-06-24 20:53:57,196 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:57,196 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:57,197 INFO ]: Analyzing trace with hash -273592459, now seen corresponding path program 2 times [2018-06-24 20:53:57,197 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:57,197 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:57,198 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:57,198 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:53:57,198 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:57,210 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:57,362 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:53:57,362 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:57,362 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:53:57,372 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:53:57,394 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:53:57,394 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:57,396 INFO ]: Computing forward predicates... [2018-06-24 20:53:57,562 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:53:57,586 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:53:57,586 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-06-24 20:53:57,586 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:53:57,586 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:53:57,587 INFO ]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:53:57,587 INFO ]: Start difference. First operand 10 states and 12 transitions. Second operand 10 states. [2018-06-24 20:53:57,880 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:57,880 INFO ]: Finished difference Result 12 states and 14 transitions. [2018-06-24 20:53:57,880 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:53:57,880 INFO ]: Start accepts. Automaton has 10 states. Word has length 8 [2018-06-24 20:53:57,893 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:57,893 INFO ]: With dead ends: 12 [2018-06-24 20:53:57,893 INFO ]: Without dead ends: 9 [2018-06-24 20:53:57,894 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:53:57,894 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 20:53:57,895 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 20:53:57,895 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 20:53:57,895 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-06-24 20:53:57,895 INFO ]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 8 [2018-06-24 20:53:57,895 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:57,895 INFO ]: Abstraction has 9 states and 10 transitions. [2018-06-24 20:53:57,895 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:53:57,895 INFO ]: Start isEmpty. Operand 9 states and 10 transitions. [2018-06-24 20:53:57,895 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:53:57,895 INFO ]: Found error trace [2018-06-24 20:53:57,896 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:57,896 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:57,896 INFO ]: Analyzing trace with hash -240345703, now seen corresponding path program 1 times [2018-06-24 20:53:57,896 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:57,896 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:57,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:57,897 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:57,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:57,909 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:57,987 INFO ]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:53:57,987 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:57,987 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:53:57,994 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:53:58,017 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:58,018 INFO ]: Computing forward predicates... [2018-06-24 20:53:58,058 INFO ]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:53:58,078 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:58,078 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-24 20:53:58,078 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:53:58,078 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:53:58,078 INFO ]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:53:58,079 INFO ]: Start difference. First operand 9 states and 10 transitions. Second operand 7 states. [2018-06-24 20:53:58,441 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:58,441 INFO ]: Finished difference Result 10 states and 11 transitions. [2018-06-24 20:53:58,442 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:53:58,442 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-24 20:53:58,442 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:58,442 INFO ]: With dead ends: 10 [2018-06-24 20:53:58,442 INFO ]: Without dead ends: 10 [2018-06-24 20:53:58,443 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:53:58,443 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 20:53:58,444 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-24 20:53:58,444 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:53:58,444 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-06-24 20:53:58,444 INFO ]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2018-06-24 20:53:58,445 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:58,445 INFO ]: Abstraction has 10 states and 11 transitions. [2018-06-24 20:53:58,445 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:53:58,445 INFO ]: Start isEmpty. Operand 10 states and 11 transitions. [2018-06-24 20:53:58,445 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:53:58,445 INFO ]: Found error trace [2018-06-24 20:53:58,445 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:58,445 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:58,445 INFO ]: Analyzing trace with hash 1138745090, now seen corresponding path program 2 times [2018-06-24 20:53:58,445 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:58,445 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:58,446 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:58,446 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:53:58,446 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:58,465 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:58,546 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:53:58,546 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:58,546 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:53:58,555 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:53:58,596 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:53:58,596 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:58,598 INFO ]: Computing forward predicates... [2018-06-24 20:53:58,658 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:53:58,679 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:58,679 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-24 20:53:58,679 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:53:58,679 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:53:58,679 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:53:58,679 INFO ]: Start difference. First operand 10 states and 11 transitions. Second operand 7 states. [2018-06-24 20:53:58,791 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:58,791 INFO ]: Finished difference Result 16 states and 19 transitions. [2018-06-24 20:53:58,791 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:53:58,791 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-24 20:53:58,791 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:58,791 INFO ]: With dead ends: 16 [2018-06-24 20:53:58,791 INFO ]: Without dead ends: 16 [2018-06-24 20:53:58,792 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:53:58,792 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 20:53:58,793 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-06-24 20:53:58,793 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 20:53:58,794 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-06-24 20:53:58,794 INFO ]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2018-06-24 20:53:58,794 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:58,794 INFO ]: Abstraction has 12 states and 14 transitions. [2018-06-24 20:53:58,794 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:53:58,794 INFO ]: Start isEmpty. Operand 12 states and 14 transitions. [2018-06-24 20:53:58,794 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:53:58,794 INFO ]: Found error trace [2018-06-24 20:53:58,794 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:58,794 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:58,794 INFO ]: Analyzing trace with hash 940886713, now seen corresponding path program 3 times [2018-06-24 20:53:58,794 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:58,794 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:58,795 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:58,795 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:58,795 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:58,808 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:58,876 INFO ]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:53:58,876 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:58,876 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:53:58,886 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:53:58,917 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 20:53:58,917 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:58,919 INFO ]: Computing forward predicates... [2018-06-24 20:53:58,973 INFO ]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:53:58,992 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:58,992 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-24 20:53:58,992 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:53:58,992 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:53:58,992 INFO ]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:53:58,993 INFO ]: Start difference. First operand 12 states and 14 transitions. Second operand 11 states. [2018-06-24 20:53:59,078 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:59,078 INFO ]: Finished difference Result 15 states and 17 transitions. [2018-06-24 20:53:59,079 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:53:59,079 INFO ]: Start accepts. Automaton has 11 states. Word has length 10 [2018-06-24 20:53:59,079 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:59,079 INFO ]: With dead ends: 15 [2018-06-24 20:53:59,079 INFO ]: Without dead ends: 11 [2018-06-24 20:53:59,080 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:53:59,080 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 20:53:59,081 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-24 20:53:59,081 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:53:59,081 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-06-24 20:53:59,081 INFO ]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 10 [2018-06-24 20:53:59,081 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:59,081 INFO ]: Abstraction has 11 states and 12 transitions. [2018-06-24 20:53:59,081 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:53:59,081 INFO ]: Start isEmpty. Operand 11 states and 12 transitions. [2018-06-24 20:53:59,082 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:53:59,082 INFO ]: Found error trace [2018-06-24 20:53:59,082 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:59,082 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:59,082 INFO ]: Analyzing trace with hash 1971536149, now seen corresponding path program 4 times [2018-06-24 20:53:59,082 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:59,082 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:59,086 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:59,086 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:59,086 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:59,104 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:59,224 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:53:59,224 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:59,224 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:59,233 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:53:59,254 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:53:59,254 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:59,256 INFO ]: Computing forward predicates... [2018-06-24 20:53:59,449 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:53:59,468 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:59,468 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-24 20:53:59,468 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:53:59,468 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:53:59,468 INFO ]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:53:59,468 INFO ]: Start difference. First operand 11 states and 12 transitions. Second operand 10 states. [2018-06-24 20:53:59,528 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:59,529 INFO ]: Finished difference Result 12 states and 13 transitions. [2018-06-24 20:53:59,529 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:53:59,529 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-24 20:53:59,529 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:59,529 INFO ]: With dead ends: 12 [2018-06-24 20:53:59,529 INFO ]: Without dead ends: 12 [2018-06-24 20:53:59,529 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:53:59,529 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 20:53:59,530 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-24 20:53:59,530 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 20:53:59,531 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-06-24 20:53:59,531 INFO ]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2018-06-24 20:53:59,531 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:59,531 INFO ]: Abstraction has 12 states and 13 transitions. [2018-06-24 20:53:59,531 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:53:59,531 INFO ]: Start isEmpty. Operand 12 states and 13 transitions. [2018-06-24 20:53:59,531 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:53:59,531 INFO ]: Found error trace [2018-06-24 20:53:59,531 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:59,531 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:59,531 INFO ]: Analyzing trace with hash 987605766, now seen corresponding path program 5 times [2018-06-24 20:53:59,531 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:59,531 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:59,532 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:59,532 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:59,532 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:59,544 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:59,678 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:53:59,678 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:59,678 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:53:59,686 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:53:59,722 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-24 20:53:59,722 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:59,724 INFO ]: Computing forward predicates... [2018-06-24 20:53:59,760 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:53:59,778 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:59,778 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-24 20:53:59,778 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:53:59,779 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:53:59,779 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:53:59,779 INFO ]: Start difference. First operand 12 states and 13 transitions. Second operand 9 states. [2018-06-24 20:53:59,886 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:59,886 INFO ]: Finished difference Result 19 states and 22 transitions. [2018-06-24 20:53:59,886 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:53:59,886 INFO ]: Start accepts. Automaton has 9 states. Word has length 11 [2018-06-24 20:53:59,886 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:59,886 INFO ]: With dead ends: 19 [2018-06-24 20:53:59,886 INFO ]: Without dead ends: 19 [2018-06-24 20:53:59,887 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:53:59,887 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 20:53:59,888 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-06-24 20:53:59,888 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:53:59,888 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-06-24 20:53:59,889 INFO ]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2018-06-24 20:53:59,889 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:59,889 INFO ]: Abstraction has 14 states and 16 transitions. [2018-06-24 20:53:59,889 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:53:59,889 INFO ]: Start isEmpty. Operand 14 states and 16 transitions. [2018-06-24 20:53:59,889 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:53:59,889 INFO ]: Found error trace [2018-06-24 20:53:59,889 INFO ]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:59,889 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:59,889 INFO ]: Analyzing trace with hash 550534965, now seen corresponding path program 6 times [2018-06-24 20:53:59,889 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:59,889 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:59,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:59,890 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:59,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:59,900 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:00,179 INFO ]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:00,179 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:00,180 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) [2018-06-24 20:54:00,194 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:00,258 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-24 20:54:00,258 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:00,260 INFO ]: Computing forward predicates... [2018-06-24 20:54:00,391 INFO ]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:00,412 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:00,412 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-06-24 20:54:00,413 INFO ]: Interpolant automaton has 14 states [2018-06-24 20:54:00,413 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 20:54:00,413 INFO ]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:54:00,413 INFO ]: Start difference. First operand 14 states and 16 transitions. Second operand 14 states. [2018-06-24 20:54:00,477 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:00,477 INFO ]: Finished difference Result 18 states and 20 transitions. [2018-06-24 20:54:00,477 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:54:00,477 INFO ]: Start accepts. Automaton has 14 states. Word has length 12 [2018-06-24 20:54:00,477 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:00,478 INFO ]: With dead ends: 18 [2018-06-24 20:54:00,478 INFO ]: Without dead ends: 13 [2018-06-24 20:54:00,478 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:54:00,478 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 20:54:00,479 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-24 20:54:00,479 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:54:00,480 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-06-24 20:54:00,480 INFO ]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 12 [2018-06-24 20:54:00,480 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:00,480 INFO ]: Abstraction has 13 states and 14 transitions. [2018-06-24 20:54:00,480 INFO ]: Interpolant automaton has 14 states. [2018-06-24 20:54:00,480 INFO ]: Start isEmpty. Operand 13 states and 14 transitions. [2018-06-24 20:54:00,480 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:54:00,480 INFO ]: Found error trace [2018-06-24 20:54:00,480 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:00,480 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:00,480 INFO ]: Analyzing trace with hash -1859070887, now seen corresponding path program 7 times [2018-06-24 20:54:00,480 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:00,480 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:00,481 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:00,481 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:00,481 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:00,491 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:00,587 INFO ]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:00,587 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:00,587 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:54:00,593 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:00,610 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:00,611 INFO ]: Computing forward predicates... [2018-06-24 20:54:00,648 INFO ]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:00,667 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:00,667 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-24 20:54:00,668 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:54:00,668 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:54:00,668 INFO ]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:54:00,668 INFO ]: Start difference. First operand 13 states and 14 transitions. Second operand 13 states. [2018-06-24 20:54:00,726 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:00,726 INFO ]: Finished difference Result 14 states and 15 transitions. [2018-06-24 20:54:00,728 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:54:00,728 INFO ]: Start accepts. Automaton has 13 states. Word has length 12 [2018-06-24 20:54:00,728 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:00,728 INFO ]: With dead ends: 14 [2018-06-24 20:54:00,728 INFO ]: Without dead ends: 14 [2018-06-24 20:54:00,729 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:54:00,729 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 20:54:00,730 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-24 20:54:00,730 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:54:00,730 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-06-24 20:54:00,730 INFO ]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2018-06-24 20:54:00,730 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:00,730 INFO ]: Abstraction has 14 states and 15 transitions. [2018-06-24 20:54:00,730 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:54:00,730 INFO ]: Start isEmpty. Operand 14 states and 15 transitions. [2018-06-24 20:54:00,731 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:54:00,731 INFO ]: Found error trace [2018-06-24 20:54:00,731 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:00,731 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:00,731 INFO ]: Analyzing trace with hash -1797095358, now seen corresponding path program 8 times [2018-06-24 20:54:00,731 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:00,731 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:00,732 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:00,732 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:00,732 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:00,743 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:00,849 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:54:00,849 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:00,849 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) [2018-06-24 20:54:00,864 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:00,911 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:54:00,911 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:00,914 INFO ]: Computing forward predicates... [2018-06-24 20:54:01,001 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:54:01,020 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:01,020 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-24 20:54:01,020 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:54:01,020 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:54:01,020 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:54:01,020 INFO ]: Start difference. First operand 14 states and 15 transitions. Second operand 11 states. [2018-06-24 20:54:01,197 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:01,197 INFO ]: Finished difference Result 22 states and 25 transitions. [2018-06-24 20:54:01,197 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:54:01,197 INFO ]: Start accepts. Automaton has 11 states. Word has length 13 [2018-06-24 20:54:01,197 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:01,198 INFO ]: With dead ends: 22 [2018-06-24 20:54:01,198 INFO ]: Without dead ends: 22 [2018-06-24 20:54:01,198 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:54:01,198 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 20:54:01,200 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 16. [2018-06-24 20:54:01,200 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:54:01,200 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-06-24 20:54:01,200 INFO ]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2018-06-24 20:54:01,200 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:01,200 INFO ]: Abstraction has 16 states and 18 transitions. [2018-06-24 20:54:01,200 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:54:01,200 INFO ]: Start isEmpty. Operand 16 states and 18 transitions. [2018-06-24 20:54:01,201 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:54:01,201 INFO ]: Found error trace [2018-06-24 20:54:01,201 INFO ]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:01,201 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:01,201 INFO ]: Analyzing trace with hash 124146041, now seen corresponding path program 9 times [2018-06-24 20:54:01,201 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:01,201 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:01,202 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:01,202 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:01,202 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:01,213 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:01,351 INFO ]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:01,351 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:01,351 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:54:01,357 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:54:01,377 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 20:54:01,378 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:01,380 INFO ]: Computing forward predicates... [2018-06-24 20:54:01,563 INFO ]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:01,583 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:01,583 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-06-24 20:54:01,583 INFO ]: Interpolant automaton has 17 states [2018-06-24 20:54:01,583 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 20:54:01,583 INFO ]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:54:01,583 INFO ]: Start difference. First operand 16 states and 18 transitions. Second operand 17 states. [2018-06-24 20:54:01,807 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:01,807 INFO ]: Finished difference Result 21 states and 23 transitions. [2018-06-24 20:54:01,865 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:54:01,865 INFO ]: Start accepts. Automaton has 17 states. Word has length 14 [2018-06-24 20:54:01,865 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:01,865 INFO ]: With dead ends: 21 [2018-06-24 20:54:01,865 INFO ]: Without dead ends: 15 [2018-06-24 20:54:01,866 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:54:01,866 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 20:54:01,867 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-24 20:54:01,867 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 20:54:01,867 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-06-24 20:54:01,867 INFO ]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 14 [2018-06-24 20:54:01,867 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:01,867 INFO ]: Abstraction has 15 states and 16 transitions. [2018-06-24 20:54:01,867 INFO ]: Interpolant automaton has 17 states. [2018-06-24 20:54:01,867 INFO ]: Start isEmpty. Operand 15 states and 16 transitions. [2018-06-24 20:54:01,868 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:54:01,868 INFO ]: Found error trace [2018-06-24 20:54:01,868 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:01,868 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:01,868 INFO ]: Analyzing trace with hash -1559191339, now seen corresponding path program 10 times [2018-06-24 20:54:01,868 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:01,868 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:01,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:01,869 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:01,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:01,876 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:01,964 INFO ]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:01,964 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:01,964 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:54:01,970 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:54:01,989 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:54:01,989 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:01,991 INFO ]: Computing forward predicates... [2018-06-24 20:54:02,110 INFO ]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:02,130 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:02,131 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-06-24 20:54:02,131 INFO ]: Interpolant automaton has 16 states [2018-06-24 20:54:02,131 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 20:54:02,131 INFO ]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:54:02,131 INFO ]: Start difference. First operand 15 states and 16 transitions. Second operand 16 states. [2018-06-24 20:54:02,236 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:02,236 INFO ]: Finished difference Result 16 states and 17 transitions. [2018-06-24 20:54:02,237 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:54:02,237 INFO ]: Start accepts. Automaton has 16 states. Word has length 14 [2018-06-24 20:54:02,237 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:02,237 INFO ]: With dead ends: 16 [2018-06-24 20:54:02,237 INFO ]: Without dead ends: 16 [2018-06-24 20:54:02,237 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:54:02,238 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 20:54:02,239 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-24 20:54:02,239 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:54:02,239 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-06-24 20:54:02,239 INFO ]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2018-06-24 20:54:02,239 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:02,239 INFO ]: Abstraction has 16 states and 17 transitions. [2018-06-24 20:54:02,239 INFO ]: Interpolant automaton has 16 states. [2018-06-24 20:54:02,239 INFO ]: Start isEmpty. Operand 16 states and 17 transitions. [2018-06-24 20:54:02,240 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:54:02,240 INFO ]: Found error trace [2018-06-24 20:54:02,240 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:02,242 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:02,242 INFO ]: Analyzing trace with hash -1090763962, now seen corresponding path program 11 times [2018-06-24 20:54:02,242 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:02,242 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:02,242 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:02,242 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:02,242 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:02,262 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:02,385 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:54:02,385 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:02,385 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:54:02,391 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:54:02,412 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 20:54:02,412 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:02,414 INFO ]: Computing forward predicates... [2018-06-24 20:54:02,532 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:54:02,553 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:02,553 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-24 20:54:02,553 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:54:02,553 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:54:02,553 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:54:02,553 INFO ]: Start difference. First operand 16 states and 17 transitions. Second operand 13 states. [2018-06-24 20:54:02,729 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:02,729 INFO ]: Finished difference Result 25 states and 28 transitions. [2018-06-24 20:54:02,729 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 20:54:02,730 INFO ]: Start accepts. Automaton has 13 states. Word has length 15 [2018-06-24 20:54:02,730 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:02,730 INFO ]: With dead ends: 25 [2018-06-24 20:54:02,730 INFO ]: Without dead ends: 25 [2018-06-24 20:54:02,730 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:54:02,731 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-24 20:54:02,733 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 18. [2018-06-24 20:54:02,733 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 20:54:02,733 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-06-24 20:54:02,733 INFO ]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2018-06-24 20:54:02,733 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:02,733 INFO ]: Abstraction has 18 states and 20 transitions. [2018-06-24 20:54:02,733 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:54:02,733 INFO ]: Start isEmpty. Operand 18 states and 20 transitions. [2018-06-24 20:54:02,733 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:54:02,733 INFO ]: Found error trace [2018-06-24 20:54:02,734 INFO ]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:02,734 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:02,734 INFO ]: Analyzing trace with hash 545582837, now seen corresponding path program 12 times [2018-06-24 20:54:02,734 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:02,734 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:02,734 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:02,734 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:02,734 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:02,744 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:02,868 INFO ]: Checked inductivity of 31 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:02,868 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:02,869 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:54:02,874 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:54:02,916 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-24 20:54:02,916 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:02,919 INFO ]: Computing forward predicates... [2018-06-24 20:54:03,031 INFO ]: Checked inductivity of 31 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:03,049 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:03,049 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2018-06-24 20:54:03,049 INFO ]: Interpolant automaton has 20 states [2018-06-24 20:54:03,049 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 20:54:03,049 INFO ]: CoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:54:03,050 INFO ]: Start difference. First operand 18 states and 20 transitions. Second operand 20 states. [2018-06-24 20:54:03,154 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:03,154 INFO ]: Finished difference Result 24 states and 26 transitions. [2018-06-24 20:54:03,155 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 20:54:03,155 INFO ]: Start accepts. Automaton has 20 states. Word has length 16 [2018-06-24 20:54:03,155 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:03,155 INFO ]: With dead ends: 24 [2018-06-24 20:54:03,155 INFO ]: Without dead ends: 17 [2018-06-24 20:54:03,155 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:54:03,155 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 20:54:03,157 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-24 20:54:03,157 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 20:54:03,157 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-06-24 20:54:03,157 INFO ]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 16 [2018-06-24 20:54:03,157 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:03,157 INFO ]: Abstraction has 17 states and 18 transitions. [2018-06-24 20:54:03,157 INFO ]: Interpolant automaton has 20 states. [2018-06-24 20:54:03,157 INFO ]: Start isEmpty. Operand 17 states and 18 transitions. [2018-06-24 20:54:03,157 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:54:03,157 INFO ]: Found error trace [2018-06-24 20:54:03,157 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:03,158 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:03,158 INFO ]: Analyzing trace with hash -98268391, now seen corresponding path program 13 times [2018-06-24 20:54:03,158 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:03,158 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:03,158 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:03,158 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:03,158 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:03,167 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:03,278 INFO ]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:03,278 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:03,278 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:54:03,283 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:03,304 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:03,307 INFO ]: Computing forward predicates... [2018-06-24 20:54:03,523 INFO ]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:03,543 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:03,543 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2018-06-24 20:54:03,543 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:54:03,543 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:54:03,543 INFO ]: CoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:54:03,543 INFO ]: Start difference. First operand 17 states and 18 transitions. Second operand 19 states. [2018-06-24 20:54:03,761 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:03,761 INFO ]: Finished difference Result 18 states and 19 transitions. [2018-06-24 20:54:03,761 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:54:03,761 INFO ]: Start accepts. Automaton has 19 states. Word has length 16 [2018-06-24 20:54:03,761 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:03,761 INFO ]: With dead ends: 18 [2018-06-24 20:54:03,761 INFO ]: Without dead ends: 18 [2018-06-24 20:54:03,762 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:54:03,762 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 20:54:03,763 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-24 20:54:03,763 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 20:54:03,763 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-06-24 20:54:03,763 INFO ]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2018-06-24 20:54:03,763 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:03,763 INFO ]: Abstraction has 18 states and 19 transitions. [2018-06-24 20:54:03,763 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:54:03,763 INFO ]: Start isEmpty. Operand 18 states and 19 transitions. [2018-06-24 20:54:03,764 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:54:03,764 INFO ]: Found error trace [2018-06-24 20:54:03,764 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:03,764 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:03,764 INFO ]: Analyzing trace with hash 1248174466, now seen corresponding path program 14 times [2018-06-24 20:54:03,764 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:03,764 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:03,765 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:03,765 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:03,765 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:03,775 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:04,096 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:54:04,096 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:04,096 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) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:04,112 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:54:04,153 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:54:04,153 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:04,156 INFO ]: Computing forward predicates... [2018-06-24 20:54:04,437 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:54:04,458 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:04,458 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-24 20:54:04,458 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:54:04,458 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:54:04,458 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:54:04,458 INFO ]: Start difference. First operand 18 states and 19 transitions. Second operand 15 states. [2018-06-24 20:54:04,667 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:04,667 INFO ]: Finished difference Result 28 states and 31 transitions. [2018-06-24 20:54:04,667 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:54:04,667 INFO ]: Start accepts. Automaton has 15 states. Word has length 17 [2018-06-24 20:54:04,667 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:04,668 INFO ]: With dead ends: 28 [2018-06-24 20:54:04,668 INFO ]: Without dead ends: 28 [2018-06-24 20:54:04,668 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:54:04,668 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-24 20:54:04,670 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 20. [2018-06-24 20:54:04,670 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 20:54:04,670 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-06-24 20:54:04,670 INFO ]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2018-06-24 20:54:04,671 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:04,671 INFO ]: Abstraction has 20 states and 22 transitions. [2018-06-24 20:54:04,671 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:54:04,671 INFO ]: Start isEmpty. Operand 20 states and 22 transitions. [2018-06-24 20:54:04,671 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:54:04,671 INFO ]: Found error trace [2018-06-24 20:54:04,671 INFO ]: trace histogram [7, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:04,671 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:04,671 INFO ]: Analyzing trace with hash 38230073, now seen corresponding path program 15 times [2018-06-24 20:54:04,671 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:04,671 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:04,673 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:04,673 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:04,673 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:04,681 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:04,891 INFO ]: Checked inductivity of 43 backedges. 15 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:04,892 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:04,892 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:54:04,897 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:54:04,925 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-24 20:54:04,925 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:04,927 INFO ]: Computing forward predicates... [2018-06-24 20:54:05,028 INFO ]: Checked inductivity of 43 backedges. 28 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:05,047 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:05,048 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 23 [2018-06-24 20:54:05,048 INFO ]: Interpolant automaton has 23 states [2018-06-24 20:54:05,048 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 20:54:05,048 INFO ]: CoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:54:05,048 INFO ]: Start difference. First operand 20 states and 22 transitions. Second operand 23 states. [2018-06-24 20:54:05,158 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:05,158 INFO ]: Finished difference Result 27 states and 29 transitions. [2018-06-24 20:54:05,159 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:54:05,159 INFO ]: Start accepts. Automaton has 23 states. Word has length 18 [2018-06-24 20:54:05,159 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:05,159 INFO ]: With dead ends: 27 [2018-06-24 20:54:05,159 INFO ]: Without dead ends: 19 [2018-06-24 20:54:05,160 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=245, Invalid=685, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:54:05,160 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 20:54:05,161 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-24 20:54:05,161 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 20:54:05,161 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-06-24 20:54:05,161 INFO ]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 18 [2018-06-24 20:54:05,162 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:05,162 INFO ]: Abstraction has 19 states and 20 transitions. [2018-06-24 20:54:05,162 INFO ]: Interpolant automaton has 23 states. [2018-06-24 20:54:05,162 INFO ]: Start isEmpty. Operand 19 states and 20 transitions. [2018-06-24 20:54:05,162 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:54:05,162 INFO ]: Found error trace [2018-06-24 20:54:05,162 INFO ]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:05,162 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:05,162 INFO ]: Analyzing trace with hash 1553678485, now seen corresponding path program 16 times [2018-06-24 20:54:05,162 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:05,162 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:05,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:05,164 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:05,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:05,176 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:05,395 INFO ]: Checked inductivity of 42 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:05,396 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:05,396 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:54:05,402 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:54:05,427 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:54:05,427 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:05,429 INFO ]: Computing forward predicates... [2018-06-24 20:54:05,572 INFO ]: Checked inductivity of 42 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:05,592 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:05,592 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2018-06-24 20:54:05,592 INFO ]: Interpolant automaton has 22 states [2018-06-24 20:54:05,592 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 20:54:05,593 INFO ]: CoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:54:05,593 INFO ]: Start difference. First operand 19 states and 20 transitions. Second operand 22 states. [2018-06-24 20:54:05,707 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:05,707 INFO ]: Finished difference Result 20 states and 21 transitions. [2018-06-24 20:54:05,707 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 20:54:05,707 INFO ]: Start accepts. Automaton has 22 states. Word has length 18 [2018-06-24 20:54:05,707 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:05,707 INFO ]: With dead ends: 20 [2018-06-24 20:54:05,707 INFO ]: Without dead ends: 20 [2018-06-24 20:54:05,707 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=553, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:54:05,707 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 20:54:05,709 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-24 20:54:05,709 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 20:54:05,709 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-06-24 20:54:05,709 INFO ]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2018-06-24 20:54:05,709 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:05,709 INFO ]: Abstraction has 20 states and 21 transitions. [2018-06-24 20:54:05,709 INFO ]: Interpolant automaton has 22 states. [2018-06-24 20:54:05,709 INFO ]: Start isEmpty. Operand 20 states and 21 transitions. [2018-06-24 20:54:05,710 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 20:54:05,710 INFO ]: Found error trace [2018-06-24 20:54:05,710 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:05,710 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:05,710 INFO ]: Analyzing trace with hash 918920070, now seen corresponding path program 17 times [2018-06-24 20:54:05,710 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:05,710 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:05,710 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:05,710 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:05,710 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:05,720 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:05,988 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:54:05,988 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:05,988 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) [2018-06-24 20:54:06,004 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:06,034 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-24 20:54:06,034 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:06,037 INFO ]: Computing forward predicates... [2018-06-24 20:54:06,146 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:54:06,166 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:06,166 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-06-24 20:54:06,166 INFO ]: Interpolant automaton has 17 states [2018-06-24 20:54:06,166 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 20:54:06,166 INFO ]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:54:06,166 INFO ]: Start difference. First operand 20 states and 21 transitions. Second operand 17 states. [2018-06-24 20:54:06,534 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:06,534 INFO ]: Finished difference Result 31 states and 34 transitions. [2018-06-24 20:54:06,534 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:54:06,534 INFO ]: Start accepts. Automaton has 17 states. Word has length 19 [2018-06-24 20:54:06,534 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:06,534 INFO ]: With dead ends: 31 [2018-06-24 20:54:06,534 INFO ]: Without dead ends: 31 [2018-06-24 20:54:06,535 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:54:06,535 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 20:54:06,536 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 22. [2018-06-24 20:54:06,537 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-24 20:54:06,537 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-06-24 20:54:06,537 INFO ]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2018-06-24 20:54:06,537 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:06,537 INFO ]: Abstraction has 22 states and 24 transitions. [2018-06-24 20:54:06,537 INFO ]: Interpolant automaton has 17 states. [2018-06-24 20:54:06,537 INFO ]: Start isEmpty. Operand 22 states and 24 transitions. [2018-06-24 20:54:06,538 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:54:06,538 INFO ]: Found error trace [2018-06-24 20:54:06,538 INFO ]: trace histogram [8, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:06,538 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:06,538 INFO ]: Analyzing trace with hash -1578721611, now seen corresponding path program 18 times [2018-06-24 20:54:06,538 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:06,538 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:06,538 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:06,538 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:06,538 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:06,553 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:07,360 INFO ]: Checked inductivity of 57 backedges. 21 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:07,360 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:07,360 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:54:07,368 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:54:07,398 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-24 20:54:07,398 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:07,400 INFO ]: Computing forward predicates... [2018-06-24 20:54:07,552 INFO ]: Checked inductivity of 57 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:07,570 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:07,571 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 26 [2018-06-24 20:54:07,571 INFO ]: Interpolant automaton has 26 states [2018-06-24 20:54:07,571 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 20:54:07,571 INFO ]: CoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:54:07,571 INFO ]: Start difference. First operand 22 states and 24 transitions. Second operand 26 states. [2018-06-24 20:54:07,712 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:07,712 INFO ]: Finished difference Result 30 states and 32 transitions. [2018-06-24 20:54:07,713 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:54:07,713 INFO ]: Start accepts. Automaton has 26 states. Word has length 20 [2018-06-24 20:54:07,713 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:07,713 INFO ]: With dead ends: 30 [2018-06-24 20:54:07,713 INFO ]: Without dead ends: 21 [2018-06-24 20:54:07,713 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=307, Invalid=883, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 20:54:07,713 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 20:54:07,715 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-24 20:54:07,715 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 20:54:07,715 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-06-24 20:54:07,715 INFO ]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 20 [2018-06-24 20:54:07,715 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:07,715 INFO ]: Abstraction has 21 states and 22 transitions. [2018-06-24 20:54:07,715 INFO ]: Interpolant automaton has 26 states. [2018-06-24 20:54:07,715 INFO ]: Start isEmpty. Operand 21 states and 22 transitions. [2018-06-24 20:54:07,716 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:54:07,716 INFO ]: Found error trace [2018-06-24 20:54:07,716 INFO ]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:07,716 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:07,716 INFO ]: Analyzing trace with hash -1844461095, now seen corresponding path program 19 times [2018-06-24 20:54:07,716 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:07,716 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:07,716 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:07,716 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:07,717 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:07,727 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:08,048 INFO ]: Checked inductivity of 56 backedges. 28 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:08,048 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:08,048 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:54:08,054 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:08,079 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:08,081 INFO ]: Computing forward predicates... [2018-06-24 20:54:08,222 INFO ]: Checked inductivity of 56 backedges. 28 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:08,241 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:08,241 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2018-06-24 20:54:08,241 INFO ]: Interpolant automaton has 25 states [2018-06-24 20:54:08,241 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 20:54:08,241 INFO ]: CoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:54:08,241 INFO ]: Start difference. First operand 21 states and 22 transitions. Second operand 25 states. [2018-06-24 20:54:08,370 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:08,370 INFO ]: Finished difference Result 22 states and 23 transitions. [2018-06-24 20:54:08,372 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:54:08,372 INFO ]: Start accepts. Automaton has 25 states. Word has length 20 [2018-06-24 20:54:08,372 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:08,372 INFO ]: With dead ends: 22 [2018-06-24 20:54:08,372 INFO ]: Without dead ends: 22 [2018-06-24 20:54:08,373 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=332, Invalid=724, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:54:08,373 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 20:54:08,373 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-24 20:54:08,374 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-24 20:54:08,374 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-06-24 20:54:08,374 INFO ]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2018-06-24 20:54:08,374 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:08,374 INFO ]: Abstraction has 22 states and 23 transitions. [2018-06-24 20:54:08,374 INFO ]: Interpolant automaton has 25 states. [2018-06-24 20:54:08,374 INFO ]: Start isEmpty. Operand 22 states and 23 transitions. [2018-06-24 20:54:08,374 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 20:54:08,374 INFO ]: Found error trace [2018-06-24 20:54:08,374 INFO ]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:08,374 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:08,375 INFO ]: Analyzing trace with hash -1344191806, now seen corresponding path program 20 times [2018-06-24 20:54:08,375 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:08,375 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:08,375 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:08,375 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:08,375 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:08,386 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:08,686 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:54:08,686 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:08,686 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:54:08,691 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:54:08,719 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:54:08,719 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:08,722 INFO ]: Computing forward predicates... [2018-06-24 20:54:08,808 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:54:08,828 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:08,828 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-06-24 20:54:08,829 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:54:08,829 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:54:08,829 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:54:08,829 INFO ]: Start difference. First operand 22 states and 23 transitions. Second operand 19 states. [2018-06-24 20:54:09,248 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:09,249 INFO ]: Finished difference Result 34 states and 37 transitions. [2018-06-24 20:54:09,249 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 20:54:09,249 INFO ]: Start accepts. Automaton has 19 states. Word has length 21 [2018-06-24 20:54:09,249 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:09,249 INFO ]: With dead ends: 34 [2018-06-24 20:54:09,249 INFO ]: Without dead ends: 34 [2018-06-24 20:54:09,249 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 15 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=769, Unknown=0, NotChecked=0, Total=870 [2018-06-24 20:54:09,250 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-24 20:54:09,254 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 24. [2018-06-24 20:54:09,254 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 20:54:09,254 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-06-24 20:54:09,254 INFO ]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2018-06-24 20:54:09,254 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:09,254 INFO ]: Abstraction has 24 states and 26 transitions. [2018-06-24 20:54:09,254 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:54:09,254 INFO ]: Start isEmpty. Operand 24 states and 26 transitions. [2018-06-24 20:54:09,255 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 20:54:09,255 INFO ]: Found error trace [2018-06-24 20:54:09,255 INFO ]: trace histogram [9, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:09,255 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:09,255 INFO ]: Analyzing trace with hash 1279254265, now seen corresponding path program 21 times [2018-06-24 20:54:09,255 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:09,255 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:09,255 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:09,255 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:09,255 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:09,268 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:09,446 INFO ]: Checked inductivity of 73 backedges. 28 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:09,447 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:09,447 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:54:09,452 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:54:09,484 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 20:54:09,484 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:09,486 INFO ]: Computing forward predicates... [2018-06-24 20:54:09,753 INFO ]: Checked inductivity of 73 backedges. 45 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:09,772 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:09,772 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 29 [2018-06-24 20:54:09,772 INFO ]: Interpolant automaton has 29 states [2018-06-24 20:54:09,772 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-24 20:54:09,772 INFO ]: CoverageRelationStatistics Valid=201, Invalid=611, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:54:09,773 INFO ]: Start difference. First operand 24 states and 26 transitions. Second operand 29 states. [2018-06-24 20:54:10,299 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:10,299 INFO ]: Finished difference Result 33 states and 35 transitions. [2018-06-24 20:54:10,299 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 20:54:10,300 INFO ]: Start accepts. Automaton has 29 states. Word has length 22 [2018-06-24 20:54:10,300 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:10,300 INFO ]: With dead ends: 33 [2018-06-24 20:54:10,300 INFO ]: Without dead ends: 23 [2018-06-24 20:54:10,300 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=376, Invalid=1106, Unknown=0, NotChecked=0, Total=1482 [2018-06-24 20:54:10,300 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-24 20:54:10,302 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-24 20:54:10,302 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 20:54:10,302 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-06-24 20:54:10,302 INFO ]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 22 [2018-06-24 20:54:10,302 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:10,302 INFO ]: Abstraction has 23 states and 24 transitions. [2018-06-24 20:54:10,302 INFO ]: Interpolant automaton has 29 states. [2018-06-24 20:54:10,302 INFO ]: Start isEmpty. Operand 23 states and 24 transitions. [2018-06-24 20:54:10,302 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 20:54:10,302 INFO ]: Found error trace [2018-06-24 20:54:10,303 INFO ]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:10,303 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:10,303 INFO ]: Analyzing trace with hash 1631264853, now seen corresponding path program 22 times [2018-06-24 20:54:10,303 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:10,303 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:10,303 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:10,303 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:10,303 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:10,313 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:10,852 INFO ]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:10,852 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:10,852 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:54:10,858 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:54:10,887 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:54:10,887 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:10,889 INFO ]: Computing forward predicates... [2018-06-24 20:54:11,031 INFO ]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:11,051 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:11,051 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 28 [2018-06-24 20:54:11,051 INFO ]: Interpolant automaton has 28 states [2018-06-24 20:54:11,051 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-24 20:54:11,051 INFO ]: CoverageRelationStatistics Valid=198, Invalid=558, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:54:11,051 INFO ]: Start difference. First operand 23 states and 24 transitions. Second operand 28 states. [2018-06-24 20:54:11,215 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:11,215 INFO ]: Finished difference Result 24 states and 25 transitions. [2018-06-24 20:54:11,215 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:54:11,215 INFO ]: Start accepts. Automaton has 28 states. Word has length 22 [2018-06-24 20:54:11,215 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:11,216 INFO ]: With dead ends: 24 [2018-06-24 20:54:11,216 INFO ]: Without dead ends: 24 [2018-06-24 20:54:11,216 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=414, Invalid=918, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:54:11,216 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-24 20:54:11,217 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-24 20:54:11,217 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 20:54:11,218 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-06-24 20:54:11,218 INFO ]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2018-06-24 20:54:11,218 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:11,218 INFO ]: Abstraction has 24 states and 25 transitions. [2018-06-24 20:54:11,218 INFO ]: Interpolant automaton has 28 states. [2018-06-24 20:54:11,218 INFO ]: Start isEmpty. Operand 24 states and 25 transitions. [2018-06-24 20:54:11,218 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 20:54:11,218 INFO ]: Found error trace [2018-06-24 20:54:11,218 INFO ]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:11,218 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:11,219 INFO ]: Analyzing trace with hash -970869818, now seen corresponding path program 23 times [2018-06-24 20:54:11,219 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:11,219 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:11,219 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:11,219 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:11,219 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:11,230 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:11,539 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:54:11,539 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:11,539 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:54:11,548 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:54:11,583 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-24 20:54:11,583 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:11,586 INFO ]: Computing forward predicates... [2018-06-24 20:54:11,646 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:54:11,665 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:11,665 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-06-24 20:54:11,665 INFO ]: Interpolant automaton has 21 states [2018-06-24 20:54:11,665 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 20:54:11,665 INFO ]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:54:11,665 INFO ]: Start difference. First operand 24 states and 25 transitions. Second operand 21 states. [2018-06-24 20:54:12,018 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:12,018 INFO ]: Finished difference Result 37 states and 40 transitions. [2018-06-24 20:54:12,018 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 20:54:12,018 INFO ]: Start accepts. Automaton has 21 states. Word has length 23 [2018-06-24 20:54:12,018 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:12,018 INFO ]: With dead ends: 37 [2018-06-24 20:54:12,018 INFO ]: Without dead ends: 37 [2018-06-24 20:54:12,019 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 16 SyntacticMatches, 8 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=944, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:54:12,019 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-24 20:54:12,020 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-06-24 20:54:12,020 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-24 20:54:12,021 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-06-24 20:54:12,021 INFO ]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2018-06-24 20:54:12,021 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:12,021 INFO ]: Abstraction has 26 states and 28 transitions. [2018-06-24 20:54:12,021 INFO ]: Interpolant automaton has 21 states. [2018-06-24 20:54:12,021 INFO ]: Start isEmpty. Operand 26 states and 28 transitions. [2018-06-24 20:54:12,021 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 20:54:12,021 INFO ]: Found error trace [2018-06-24 20:54:12,021 INFO ]: trace histogram [10, 8, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:12,022 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:12,022 INFO ]: Analyzing trace with hash -32665995, now seen corresponding path program 24 times [2018-06-24 20:54:12,022 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:12,022 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:12,022 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:12,022 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:12,022 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:12,031 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:12,460 INFO ]: Checked inductivity of 91 backedges. 36 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:12,460 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:12,460 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:54:12,477 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:54:12,511 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-24 20:54:12,511 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:12,513 INFO ]: Computing forward predicates... [2018-06-24 20:54:12,675 INFO ]: Checked inductivity of 91 backedges. 55 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:12,694 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:12,694 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 32 [2018-06-24 20:54:12,694 INFO ]: Interpolant automaton has 32 states [2018-06-24 20:54:12,694 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-24 20:54:12,695 INFO ]: CoverageRelationStatistics Valid=243, Invalid=749, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:54:12,695 INFO ]: Start difference. First operand 26 states and 28 transitions. Second operand 32 states. [2018-06-24 20:54:12,994 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:12,994 INFO ]: Finished difference Result 36 states and 38 transitions. [2018-06-24 20:54:12,995 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 20:54:12,995 INFO ]: Start accepts. Automaton has 32 states. Word has length 24 [2018-06-24 20:54:12,995 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:12,995 INFO ]: With dead ends: 36 [2018-06-24 20:54:12,995 INFO ]: Without dead ends: 25 [2018-06-24 20:54:12,996 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=452, Invalid=1354, Unknown=0, NotChecked=0, Total=1806 [2018-06-24 20:54:12,996 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-24 20:54:12,997 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-24 20:54:12,997 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 20:54:12,997 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-06-24 20:54:12,998 INFO ]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 24 [2018-06-24 20:54:12,998 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:12,998 INFO ]: Abstraction has 25 states and 26 transitions. [2018-06-24 20:54:12,998 INFO ]: Interpolant automaton has 32 states. [2018-06-24 20:54:12,998 INFO ]: Start isEmpty. Operand 25 states and 26 transitions. [2018-06-24 20:54:12,998 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 20:54:12,998 INFO ]: Found error trace [2018-06-24 20:54:12,998 INFO ]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:12,998 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:12,998 INFO ]: Analyzing trace with hash -2005239655, now seen corresponding path program 25 times [2018-06-24 20:54:12,998 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:12,998 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:12,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:12,999 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:12,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:13,008 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:13,414 INFO ]: Checked inductivity of 90 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:13,414 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:13,414 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:54:13,420 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:13,455 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:13,457 INFO ]: Computing forward predicates... [2018-06-24 20:54:13,613 INFO ]: Checked inductivity of 90 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:13,632 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:13,632 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 31 [2018-06-24 20:54:13,632 INFO ]: Interpolant automaton has 31 states [2018-06-24 20:54:13,632 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-24 20:54:13,633 INFO ]: CoverageRelationStatistics Valid=240, Invalid=690, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:54:13,633 INFO ]: Start difference. First operand 25 states and 26 transitions. Second operand 31 states. [2018-06-24 20:54:13,807 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:13,807 INFO ]: Finished difference Result 26 states and 27 transitions. [2018-06-24 20:54:13,808 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 20:54:13,808 INFO ]: Start accepts. Automaton has 31 states. Word has length 24 [2018-06-24 20:54:13,808 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:13,808 INFO ]: With dead ends: 26 [2018-06-24 20:54:13,808 INFO ]: Without dead ends: 26 [2018-06-24 20:54:13,808 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=505, Invalid=1135, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 20:54:13,808 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-24 20:54:13,810 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-24 20:54:13,810 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-24 20:54:13,810 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-06-24 20:54:13,810 INFO ]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 24 [2018-06-24 20:54:13,900 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:13,900 INFO ]: Abstraction has 26 states and 27 transitions. [2018-06-24 20:54:13,900 INFO ]: Interpolant automaton has 31 states. [2018-06-24 20:54:13,900 INFO ]: Start isEmpty. Operand 26 states and 27 transitions. [2018-06-24 20:54:13,901 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:54:13,901 INFO ]: Found error trace [2018-06-24 20:54:13,901 INFO ]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:13,901 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:13,901 INFO ]: Analyzing trace with hash -2033359870, now seen corresponding path program 26 times [2018-06-24 20:54:13,901 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:13,901 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:13,901 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:13,901 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:13,902 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:13,911 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:14,242 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:54:14,242 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:14,242 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:54:14,248 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:54:14,280 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:54:14,280 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:14,283 INFO ]: Computing forward predicates... [2018-06-24 20:54:14,679 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:54:14,698 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:14,698 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-06-24 20:54:14,698 INFO ]: Interpolant automaton has 23 states [2018-06-24 20:54:14,698 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 20:54:14,699 INFO ]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:54:14,699 INFO ]: Start difference. First operand 26 states and 27 transitions. Second operand 23 states. [2018-06-24 20:54:15,268 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:15,269 INFO ]: Finished difference Result 40 states and 43 transitions. [2018-06-24 20:54:15,269 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 20:54:15,269 INFO ]: Start accepts. Automaton has 23 states. Word has length 25 [2018-06-24 20:54:15,269 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:15,269 INFO ]: With dead ends: 40 [2018-06-24 20:54:15,269 INFO ]: Without dead ends: 40 [2018-06-24 20:54:15,269 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 16 SyntacticMatches, 10 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=123, Invalid=1137, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:54:15,269 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-24 20:54:15,271 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 28. [2018-06-24 20:54:15,271 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 20:54:15,272 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-06-24 20:54:15,272 INFO ]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 25 [2018-06-24 20:54:15,272 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:15,272 INFO ]: Abstraction has 28 states and 30 transitions. [2018-06-24 20:54:15,272 INFO ]: Interpolant automaton has 23 states. [2018-06-24 20:54:15,272 INFO ]: Start isEmpty. Operand 28 states and 30 transitions. [2018-06-24 20:54:15,272 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 20:54:15,272 INFO ]: Found error trace [2018-06-24 20:54:15,272 INFO ]: trace histogram [11, 9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:15,272 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:15,272 INFO ]: Analyzing trace with hash 1389880761, now seen corresponding path program 27 times [2018-06-24 20:54:15,272 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:15,272 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:15,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:15,273 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:15,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:15,281 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:15,787 INFO ]: Checked inductivity of 111 backedges. 45 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:15,787 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:15,787 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:54:15,793 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:54:15,847 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-24 20:54:15,847 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:15,849 INFO ]: Computing forward predicates... [2018-06-24 20:54:17,504 INFO ]: Checked inductivity of 111 backedges. 66 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:17,523 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:17,523 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 35 [2018-06-24 20:54:17,523 INFO ]: Interpolant automaton has 35 states [2018-06-24 20:54:17,523 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-24 20:54:17,524 INFO ]: CoverageRelationStatistics Valid=289, Invalid=901, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 20:54:17,524 INFO ]: Start difference. First operand 28 states and 30 transitions. Second operand 35 states. [2018-06-24 20:54:17,844 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:17,845 INFO ]: Finished difference Result 39 states and 41 transitions. [2018-06-24 20:54:17,845 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 20:54:17,845 INFO ]: Start accepts. Automaton has 35 states. Word has length 26 [2018-06-24 20:54:17,845 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:17,845 INFO ]: With dead ends: 39 [2018-06-24 20:54:17,845 INFO ]: Without dead ends: 27 [2018-06-24 20:54:17,846 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=535, Invalid=1627, Unknown=0, NotChecked=0, Total=2162 [2018-06-24 20:54:17,846 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-24 20:54:17,847 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-24 20:54:17,847 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-24 20:54:17,847 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-06-24 20:54:17,847 INFO ]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 26 [2018-06-24 20:54:17,847 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:17,848 INFO ]: Abstraction has 27 states and 28 transitions. [2018-06-24 20:54:17,848 INFO ]: Interpolant automaton has 35 states. [2018-06-24 20:54:17,848 INFO ]: Start isEmpty. Operand 27 states and 28 transitions. [2018-06-24 20:54:17,848 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 20:54:17,848 INFO ]: Found error trace [2018-06-24 20:54:17,848 INFO ]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:17,848 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:17,848 INFO ]: Analyzing trace with hash 369639445, now seen corresponding path program 28 times [2018-06-24 20:54:17,848 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:17,848 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:17,848 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:17,848 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:17,848 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:17,856 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:18,141 INFO ]: Checked inductivity of 110 backedges. 55 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:18,141 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:18,141 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:54:18,147 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:54:18,181 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:54:18,181 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:18,184 INFO ]: Computing forward predicates... [2018-06-24 20:54:18,310 INFO ]: Checked inductivity of 110 backedges. 55 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:18,329 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:18,329 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 34 [2018-06-24 20:54:18,329 INFO ]: Interpolant automaton has 34 states [2018-06-24 20:54:18,329 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-24 20:54:18,329 INFO ]: CoverageRelationStatistics Valid=286, Invalid=836, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:54:18,329 INFO ]: Start difference. First operand 27 states and 28 transitions. Second operand 34 states. [2018-06-24 20:54:19,037 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:19,037 INFO ]: Finished difference Result 28 states and 29 transitions. [2018-06-24 20:54:19,038 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 20:54:19,038 INFO ]: Start accepts. Automaton has 34 states. Word has length 26 [2018-06-24 20:54:19,038 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:19,038 INFO ]: With dead ends: 28 [2018-06-24 20:54:19,038 INFO ]: Without dead ends: 28 [2018-06-24 20:54:19,039 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=605, Invalid=1375, Unknown=0, NotChecked=0, Total=1980 [2018-06-24 20:54:19,039 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-24 20:54:19,040 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-24 20:54:19,040 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 20:54:19,040 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-06-24 20:54:19,040 INFO ]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2018-06-24 20:54:19,040 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:19,040 INFO ]: Abstraction has 28 states and 29 transitions. [2018-06-24 20:54:19,040 INFO ]: Interpolant automaton has 34 states. [2018-06-24 20:54:19,040 INFO ]: Start isEmpty. Operand 28 states and 29 transitions. [2018-06-24 20:54:19,041 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 20:54:19,041 INFO ]: Found error trace [2018-06-24 20:54:19,041 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:19,041 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:19,041 INFO ]: Analyzing trace with hash -1426551802, now seen corresponding path program 29 times [2018-06-24 20:54:19,041 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:19,041 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:19,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:19,041 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:19,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:19,052 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:19,376 INFO ]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:19,376 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:19,376 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:54:19,381 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:54:19,484 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-24 20:54:19,485 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:19,488 INFO ]: Computing forward predicates... [2018-06-24 20:54:19,562 INFO ]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:19,581 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:19,581 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-06-24 20:54:19,581 INFO ]: Interpolant automaton has 25 states [2018-06-24 20:54:19,581 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 20:54:19,581 INFO ]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:54:19,581 INFO ]: Start difference. First operand 28 states and 29 transitions. Second operand 25 states. [2018-06-24 20:54:20,076 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:20,076 INFO ]: Finished difference Result 43 states and 46 transitions. [2018-06-24 20:54:20,076 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-24 20:54:20,076 INFO ]: Start accepts. Automaton has 25 states. Word has length 27 [2018-06-24 20:54:20,076 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:20,077 INFO ]: With dead ends: 43 [2018-06-24 20:54:20,077 INFO ]: Without dead ends: 43 [2018-06-24 20:54:20,077 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 19 SyntacticMatches, 9 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=134, Invalid=1348, Unknown=0, NotChecked=0, Total=1482 [2018-06-24 20:54:20,077 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-24 20:54:20,078 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-06-24 20:54:20,078 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-24 20:54:20,078 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-06-24 20:54:20,078 INFO ]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 27 [2018-06-24 20:54:20,080 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:20,080 INFO ]: Abstraction has 30 states and 32 transitions. [2018-06-24 20:54:20,080 INFO ]: Interpolant automaton has 25 states. [2018-06-24 20:54:20,080 INFO ]: Start isEmpty. Operand 30 states and 32 transitions. [2018-06-24 20:54:20,080 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 20:54:20,080 INFO ]: Found error trace [2018-06-24 20:54:20,080 INFO ]: trace histogram [12, 10, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:20,080 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:20,080 INFO ]: Analyzing trace with hash -1273905611, now seen corresponding path program 30 times [2018-06-24 20:54:20,080 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:20,080 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:20,081 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:20,081 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:20,081 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:20,093 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:20,375 INFO ]: Checked inductivity of 133 backedges. 55 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:20,375 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:20,375 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:54:20,386 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:54:20,426 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-24 20:54:20,426 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:20,429 INFO ]: Computing forward predicates... [2018-06-24 20:54:20,730 INFO ]: Checked inductivity of 133 backedges. 78 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:20,749 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:20,749 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 38 [2018-06-24 20:54:20,749 INFO ]: Interpolant automaton has 38 states [2018-06-24 20:54:20,750 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-24 20:54:20,750 INFO ]: CoverageRelationStatistics Valid=339, Invalid=1067, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 20:54:20,750 INFO ]: Start difference. First operand 30 states and 32 transitions. Second operand 38 states. [2018-06-24 20:54:20,976 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:20,976 INFO ]: Finished difference Result 42 states and 44 transitions. [2018-06-24 20:54:20,976 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-24 20:54:20,976 INFO ]: Start accepts. Automaton has 38 states. Word has length 28 [2018-06-24 20:54:20,976 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:20,976 INFO ]: With dead ends: 42 [2018-06-24 20:54:20,976 INFO ]: Without dead ends: 29 [2018-06-24 20:54:20,977 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=625, Invalid=1925, Unknown=0, NotChecked=0, Total=2550 [2018-06-24 20:54:20,977 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 20:54:20,978 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-24 20:54:20,978 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 20:54:20,979 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-06-24 20:54:20,979 INFO ]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 28 [2018-06-24 20:54:20,979 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:20,979 INFO ]: Abstraction has 29 states and 30 transitions. [2018-06-24 20:54:20,979 INFO ]: Interpolant automaton has 38 states. [2018-06-24 20:54:20,979 INFO ]: Start isEmpty. Operand 29 states and 30 transitions. [2018-06-24 20:54:20,979 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 20:54:20,979 INFO ]: Found error trace [2018-06-24 20:54:20,979 INFO ]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:20,979 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:20,979 INFO ]: Analyzing trace with hash 1458351961, now seen corresponding path program 31 times [2018-06-24 20:54:20,979 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:20,979 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:20,980 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:20,980 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:20,980 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:20,990 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:21,414 INFO ]: Checked inductivity of 132 backedges. 66 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:21,414 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:21,414 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:54:21,419 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:21,454 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:21,457 INFO ]: Computing forward predicates... [2018-06-24 20:54:21,617 INFO ]: Checked inductivity of 132 backedges. 66 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:21,636 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:21,636 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 37 [2018-06-24 20:54:21,636 INFO ]: Interpolant automaton has 37 states [2018-06-24 20:54:21,636 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-24 20:54:21,636 INFO ]: CoverageRelationStatistics Valid=336, Invalid=996, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:54:21,636 INFO ]: Start difference. First operand 29 states and 30 transitions. Second operand 37 states. [2018-06-24 20:54:21,818 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:21,818 INFO ]: Finished difference Result 30 states and 31 transitions. [2018-06-24 20:54:21,818 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 20:54:21,818 INFO ]: Start accepts. Automaton has 37 states. Word has length 28 [2018-06-24 20:54:21,818 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:21,819 INFO ]: With dead ends: 30 [2018-06-24 20:54:21,819 INFO ]: Without dead ends: 30 [2018-06-24 20:54:21,819 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=714, Invalid=1638, Unknown=0, NotChecked=0, Total=2352 [2018-06-24 20:54:21,819 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-24 20:54:21,821 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-24 20:54:21,821 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-24 20:54:21,821 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-06-24 20:54:21,821 INFO ]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 28 [2018-06-24 20:54:21,821 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:21,821 INFO ]: Abstraction has 30 states and 31 transitions. [2018-06-24 20:54:21,821 INFO ]: Interpolant automaton has 37 states. [2018-06-24 20:54:21,821 INFO ]: Start isEmpty. Operand 30 states and 31 transitions. [2018-06-24 20:54:21,822 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-24 20:54:21,822 INFO ]: Found error trace [2018-06-24 20:54:21,822 INFO ]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:21,822 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:21,822 INFO ]: Analyzing trace with hash -2036202174, now seen corresponding path program 32 times [2018-06-24 20:54:21,822 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:21,822 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:21,822 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:21,822 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:21,822 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:21,832 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:22,291 INFO ]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:22,291 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:22,291 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:54:22,297 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:54:22,345 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:54:22,345 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:22,348 INFO ]: Computing forward predicates... [2018-06-24 20:54:22,446 INFO ]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:22,465 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:22,465 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-06-24 20:54:22,465 INFO ]: Interpolant automaton has 27 states [2018-06-24 20:54:22,465 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 20:54:22,465 INFO ]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:54:22,465 INFO ]: Start difference. First operand 30 states and 31 transitions. Second operand 27 states. [2018-06-24 20:54:23,332 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:23,332 INFO ]: Finished difference Result 46 states and 49 transitions. [2018-06-24 20:54:23,332 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-24 20:54:23,332 INFO ]: Start accepts. Automaton has 27 states. Word has length 29 [2018-06-24 20:54:23,332 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:23,332 INFO ]: With dead ends: 46 [2018-06-24 20:54:23,332 INFO ]: Without dead ends: 46 [2018-06-24 20:54:23,333 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 21 SyntacticMatches, 9 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=1577, Unknown=0, NotChecked=0, Total=1722 [2018-06-24 20:54:23,333 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-24 20:54:23,334 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 32. [2018-06-24 20:54:23,334 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-24 20:54:23,335 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-06-24 20:54:23,335 INFO ]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2018-06-24 20:54:23,335 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:23,335 INFO ]: Abstraction has 32 states and 34 transitions. [2018-06-24 20:54:23,335 INFO ]: Interpolant automaton has 27 states. [2018-06-24 20:54:23,335 INFO ]: Start isEmpty. Operand 32 states and 34 transitions. [2018-06-24 20:54:23,335 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-24 20:54:23,335 INFO ]: Found error trace [2018-06-24 20:54:23,335 INFO ]: trace histogram [13, 11, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:23,335 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:23,335 INFO ]: Analyzing trace with hash 1301769337, now seen corresponding path program 33 times [2018-06-24 20:54:23,335 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:23,335 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:23,336 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:23,336 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:23,336 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:23,345 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:24,168 INFO ]: Checked inductivity of 157 backedges. 66 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:24,168 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:24,168 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:54:24,173 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:54:24,218 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-24 20:54:24,218 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:24,220 INFO ]: Computing forward predicates... [2018-06-24 20:54:24,523 INFO ]: Checked inductivity of 157 backedges. 91 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:24,542 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:24,542 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 41 [2018-06-24 20:54:24,542 INFO ]: Interpolant automaton has 41 states [2018-06-24 20:54:24,542 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-24 20:54:24,543 INFO ]: CoverageRelationStatistics Valid=393, Invalid=1247, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 20:54:24,543 INFO ]: Start difference. First operand 32 states and 34 transitions. Second operand 41 states. [2018-06-24 20:54:24,808 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:24,808 INFO ]: Finished difference Result 45 states and 47 transitions. [2018-06-24 20:54:24,809 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-24 20:54:24,809 INFO ]: Start accepts. Automaton has 41 states. Word has length 30 [2018-06-24 20:54:24,809 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:24,809 INFO ]: With dead ends: 45 [2018-06-24 20:54:24,809 INFO ]: Without dead ends: 31 [2018-06-24 20:54:24,810 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=722, Invalid=2248, Unknown=0, NotChecked=0, Total=2970 [2018-06-24 20:54:24,810 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 20:54:24,810 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-24 20:54:24,810 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 20:54:24,811 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-06-24 20:54:24,811 INFO ]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 30 [2018-06-24 20:54:24,811 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:24,811 INFO ]: Abstraction has 31 states and 32 transitions. [2018-06-24 20:54:24,811 INFO ]: Interpolant automaton has 41 states. [2018-06-24 20:54:24,811 INFO ]: Start isEmpty. Operand 31 states and 32 transitions. [2018-06-24 20:54:24,811 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-24 20:54:24,811 INFO ]: Found error trace [2018-06-24 20:54:24,811 INFO ]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:24,811 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:24,811 INFO ]: Analyzing trace with hash 102408149, now seen corresponding path program 34 times [2018-06-24 20:54:24,811 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:24,811 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:24,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:24,812 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:24,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:24,823 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:25,769 INFO ]: Checked inductivity of 156 backedges. 78 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:25,769 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:25,769 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:54:25,774 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:54:25,812 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:54:25,812 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:25,815 INFO ]: Computing forward predicates... [2018-06-24 20:54:26,028 INFO ]: Checked inductivity of 156 backedges. 78 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:26,047 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:26,047 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 40 [2018-06-24 20:54:26,047 INFO ]: Interpolant automaton has 40 states [2018-06-24 20:54:26,047 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-24 20:54:26,048 INFO ]: CoverageRelationStatistics Valid=390, Invalid=1170, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 20:54:26,048 INFO ]: Start difference. First operand 31 states and 32 transitions. Second operand 40 states. [2018-06-24 20:54:26,270 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:26,270 INFO ]: Finished difference Result 32 states and 33 transitions. [2018-06-24 20:54:26,271 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-24 20:54:26,271 INFO ]: Start accepts. Automaton has 40 states. Word has length 30 [2018-06-24 20:54:26,271 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:26,271 INFO ]: With dead ends: 32 [2018-06-24 20:54:26,271 INFO ]: Without dead ends: 32 [2018-06-24 20:54:26,272 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=832, Invalid=1924, Unknown=0, NotChecked=0, Total=2756 [2018-06-24 20:54:26,272 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-24 20:54:26,272 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-24 20:54:26,272 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-24 20:54:26,273 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-06-24 20:54:26,273 INFO ]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 30 [2018-06-24 20:54:26,273 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:26,273 INFO ]: Abstraction has 32 states and 33 transitions. [2018-06-24 20:54:26,273 INFO ]: Interpolant automaton has 40 states. [2018-06-24 20:54:26,273 INFO ]: Start isEmpty. Operand 32 states and 33 transitions. [2018-06-24 20:54:26,273 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-24 20:54:26,273 INFO ]: Found error trace [2018-06-24 20:54:26,273 INFO ]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:26,273 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:26,273 INFO ]: Analyzing trace with hash -1120787386, now seen corresponding path program 35 times [2018-06-24 20:54:26,273 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:26,273 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:26,274 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:26,274 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:26,274 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:26,284 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:26,697 INFO ]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:26,697 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:26,697 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:54:26,703 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:54:26,750 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-24 20:54:26,750 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:26,754 INFO ]: Computing forward predicates... [2018-06-24 20:54:26,852 INFO ]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:26,872 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:26,872 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-06-24 20:54:26,872 INFO ]: Interpolant automaton has 29 states [2018-06-24 20:54:26,872 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-24 20:54:26,872 INFO ]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:54:26,872 INFO ]: Start difference. First operand 32 states and 33 transitions. Second operand 29 states. [2018-06-24 20:54:27,508 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:27,508 INFO ]: Finished difference Result 49 states and 52 transitions. [2018-06-24 20:54:27,508 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 20:54:27,508 INFO ]: Start accepts. Automaton has 29 states. Word has length 31 [2018-06-24 20:54:27,508 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:27,508 INFO ]: With dead ends: 49 [2018-06-24 20:54:27,508 INFO ]: Without dead ends: 49 [2018-06-24 20:54:27,509 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 22 SyntacticMatches, 10 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=156, Invalid=1824, Unknown=0, NotChecked=0, Total=1980 [2018-06-24 20:54:27,509 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-24 20:54:27,510 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-06-24 20:54:27,510 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 20:54:27,510 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-06-24 20:54:27,510 INFO ]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 31 [2018-06-24 20:54:27,510 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:27,510 INFO ]: Abstraction has 34 states and 36 transitions. [2018-06-24 20:54:27,510 INFO ]: Interpolant automaton has 29 states. [2018-06-24 20:54:27,510 INFO ]: Start isEmpty. Operand 34 states and 36 transitions. [2018-06-24 20:54:27,510 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 20:54:27,510 INFO ]: Found error trace [2018-06-24 20:54:27,510 INFO ]: trace histogram [14, 12, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:27,510 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:27,511 INFO ]: Analyzing trace with hash -385143307, now seen corresponding path program 36 times [2018-06-24 20:54:27,511 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:27,511 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:27,511 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:27,511 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:27,511 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:27,520 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:27,864 INFO ]: Checked inductivity of 183 backedges. 78 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:27,864 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:27,864 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:27,870 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:54:27,918 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-24 20:54:27,918 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:27,920 INFO ]: Computing forward predicates... [2018-06-24 20:54:28,207 INFO ]: Checked inductivity of 183 backedges. 105 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:28,226 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:28,226 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 44 [2018-06-24 20:54:28,226 INFO ]: Interpolant automaton has 44 states [2018-06-24 20:54:28,226 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-24 20:54:28,226 INFO ]: CoverageRelationStatistics Valid=451, Invalid=1441, Unknown=0, NotChecked=0, Total=1892 [2018-06-24 20:54:28,226 INFO ]: Start difference. First operand 34 states and 36 transitions. Second operand 44 states. [2018-06-24 20:54:28,509 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:28,509 INFO ]: Finished difference Result 48 states and 50 transitions. [2018-06-24 20:54:28,510 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 20:54:28,510 INFO ]: Start accepts. Automaton has 44 states. Word has length 32 [2018-06-24 20:54:28,510 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:28,510 INFO ]: With dead ends: 48 [2018-06-24 20:54:28,510 INFO ]: Without dead ends: 33 [2018-06-24 20:54:28,510 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=826, Invalid=2596, Unknown=0, NotChecked=0, Total=3422 [2018-06-24 20:54:28,510 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-24 20:54:28,511 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-24 20:54:28,511 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-24 20:54:28,511 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-06-24 20:54:28,511 INFO ]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 32 [2018-06-24 20:54:28,511 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:28,511 INFO ]: Abstraction has 33 states and 34 transitions. [2018-06-24 20:54:28,511 INFO ]: Interpolant automaton has 44 states. [2018-06-24 20:54:28,511 INFO ]: Start isEmpty. Operand 33 states and 34 transitions. [2018-06-24 20:54:28,512 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 20:54:28,512 INFO ]: Found error trace [2018-06-24 20:54:28,512 INFO ]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:28,512 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:28,512 INFO ]: Analyzing trace with hash 1089365529, now seen corresponding path program 37 times [2018-06-24 20:54:28,512 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:28,512 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:28,512 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:28,512 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:28,512 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:28,519 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:28,961 INFO ]: Checked inductivity of 182 backedges. 91 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:28,961 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:28,961 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:28,966 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:29,007 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:29,010 INFO ]: Computing forward predicates... [2018-06-24 20:54:29,300 INFO ]: Checked inductivity of 182 backedges. 91 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:29,320 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:29,320 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 43 [2018-06-24 20:54:29,320 INFO ]: Interpolant automaton has 43 states [2018-06-24 20:54:29,320 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-24 20:54:29,321 INFO ]: CoverageRelationStatistics Valid=448, Invalid=1358, Unknown=0, NotChecked=0, Total=1806 [2018-06-24 20:54:29,321 INFO ]: Start difference. First operand 33 states and 34 transitions. Second operand 43 states. [2018-06-24 20:54:29,606 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:29,606 INFO ]: Finished difference Result 34 states and 35 transitions. [2018-06-24 20:54:29,606 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-24 20:54:29,606 INFO ]: Start accepts. Automaton has 43 states. Word has length 32 [2018-06-24 20:54:29,607 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:29,607 INFO ]: With dead ends: 34 [2018-06-24 20:54:29,607 INFO ]: Without dead ends: 34 [2018-06-24 20:54:29,607 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=959, Invalid=2233, Unknown=0, NotChecked=0, Total=3192 [2018-06-24 20:54:29,607 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-24 20:54:29,608 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-24 20:54:29,608 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 20:54:29,608 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-06-24 20:54:29,608 INFO ]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 32 [2018-06-24 20:54:29,608 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:29,608 INFO ]: Abstraction has 34 states and 35 transitions. [2018-06-24 20:54:29,608 INFO ]: Interpolant automaton has 43 states. [2018-06-24 20:54:29,608 INFO ]: Start isEmpty. Operand 34 states and 35 transitions. [2018-06-24 20:54:29,608 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-24 20:54:29,608 INFO ]: Found error trace [2018-06-24 20:54:29,608 INFO ]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:29,609 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:29,609 INFO ]: Analyzing trace with hash -589879678, now seen corresponding path program 38 times [2018-06-24 20:54:29,609 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:29,609 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:29,609 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:29,609 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:29,609 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:29,620 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:30,056 INFO ]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:30,056 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:30,056 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:30,062 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:54:30,105 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:54:30,105 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:30,109 INFO ]: Computing forward predicates... [2018-06-24 20:54:30,220 INFO ]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:30,239 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:30,239 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-06-24 20:54:30,239 INFO ]: Interpolant automaton has 31 states [2018-06-24 20:54:30,239 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-24 20:54:30,239 INFO ]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:54:30,239 INFO ]: Start difference. First operand 34 states and 35 transitions. Second operand 31 states. [2018-06-24 20:54:30,969 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:30,969 INFO ]: Finished difference Result 52 states and 55 transitions. [2018-06-24 20:54:30,969 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-24 20:54:30,969 INFO ]: Start accepts. Automaton has 31 states. Word has length 33 [2018-06-24 20:54:30,969 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:30,970 INFO ]: With dead ends: 52 [2018-06-24 20:54:30,970 INFO ]: Without dead ends: 52 [2018-06-24 20:54:30,970 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 23 SyntacticMatches, 11 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=167, Invalid=2089, Unknown=0, NotChecked=0, Total=2256 [2018-06-24 20:54:30,970 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-24 20:54:30,971 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 36. [2018-06-24 20:54:30,971 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-24 20:54:30,971 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-06-24 20:54:30,971 INFO ]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 33 [2018-06-24 20:54:30,971 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:30,971 INFO ]: Abstraction has 36 states and 38 transitions. [2018-06-24 20:54:30,971 INFO ]: Interpolant automaton has 31 states. [2018-06-24 20:54:30,971 INFO ]: Start isEmpty. Operand 36 states and 38 transitions. [2018-06-24 20:54:30,971 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 20:54:30,971 INFO ]: Found error trace [2018-06-24 20:54:30,971 INFO ]: trace histogram [15, 13, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:30,971 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:30,971 INFO ]: Analyzing trace with hash -1106873543, now seen corresponding path program 39 times [2018-06-24 20:54:30,971 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:30,971 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:30,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:30,972 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:30,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:30,978 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:31,630 INFO ]: Checked inductivity of 211 backedges. 91 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:31,630 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:31,630 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:31,636 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:54:31,688 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-24 20:54:31,688 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:31,691 INFO ]: Computing forward predicates... [2018-06-24 20:54:32,056 INFO ]: Checked inductivity of 211 backedges. 120 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:32,074 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:32,074 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 47 [2018-06-24 20:54:32,075 INFO ]: Interpolant automaton has 47 states [2018-06-24 20:54:32,075 INFO ]: Constructing interpolant automaton starting with 47 interpolants. [2018-06-24 20:54:32,075 INFO ]: CoverageRelationStatistics Valid=513, Invalid=1649, Unknown=0, NotChecked=0, Total=2162 [2018-06-24 20:54:32,075 INFO ]: Start difference. First operand 36 states and 38 transitions. Second operand 47 states. [2018-06-24 20:54:32,382 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:32,382 INFO ]: Finished difference Result 51 states and 53 transitions. [2018-06-24 20:54:32,406 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-24 20:54:32,406 INFO ]: Start accepts. Automaton has 47 states. Word has length 34 [2018-06-24 20:54:32,407 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:32,407 INFO ]: With dead ends: 51 [2018-06-24 20:54:32,407 INFO ]: Without dead ends: 35 [2018-06-24 20:54:32,407 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=937, Invalid=2969, Unknown=0, NotChecked=0, Total=3906 [2018-06-24 20:54:32,407 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 20:54:32,408 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-24 20:54:32,408 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 20:54:32,409 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-06-24 20:54:32,409 INFO ]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 34 [2018-06-24 20:54:32,409 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:32,409 INFO ]: Abstraction has 35 states and 36 transitions. [2018-06-24 20:54:32,409 INFO ]: Interpolant automaton has 47 states. [2018-06-24 20:54:32,409 INFO ]: Start isEmpty. Operand 35 states and 36 transitions. [2018-06-24 20:54:32,409 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 20:54:32,409 INFO ]: Found error trace [2018-06-24 20:54:32,409 INFO ]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:32,409 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:32,409 INFO ]: Analyzing trace with hash 1653227413, now seen corresponding path program 40 times [2018-06-24 20:54:32,409 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:32,409 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:32,410 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:32,410 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:32,410 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:32,431 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:32,837 INFO ]: Checked inductivity of 210 backedges. 105 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:32,837 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:32,837 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:32,843 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:54:32,887 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:54:32,888 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:32,891 INFO ]: Computing forward predicates... [2018-06-24 20:54:33,113 INFO ]: Checked inductivity of 210 backedges. 105 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:33,131 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:33,131 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 46 [2018-06-24 20:54:33,131 INFO ]: Interpolant automaton has 46 states [2018-06-24 20:54:33,132 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-24 20:54:33,132 INFO ]: CoverageRelationStatistics Valid=510, Invalid=1560, Unknown=0, NotChecked=0, Total=2070 [2018-06-24 20:54:33,132 INFO ]: Start difference. First operand 35 states and 36 transitions. Second operand 46 states. [2018-06-24 20:54:33,505 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:33,505 INFO ]: Finished difference Result 36 states and 37 transitions. [2018-06-24 20:54:33,505 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 20:54:33,505 INFO ]: Start accepts. Automaton has 46 states. Word has length 34 [2018-06-24 20:54:33,505 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:33,505 INFO ]: With dead ends: 36 [2018-06-24 20:54:33,505 INFO ]: Without dead ends: 36 [2018-06-24 20:54:33,506 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1020 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1095, Invalid=2565, Unknown=0, NotChecked=0, Total=3660 [2018-06-24 20:54:33,506 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-24 20:54:33,506 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-24 20:54:33,506 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-24 20:54:33,507 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-06-24 20:54:33,507 INFO ]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2018-06-24 20:54:33,507 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:33,507 INFO ]: Abstraction has 36 states and 37 transitions. [2018-06-24 20:54:33,507 INFO ]: Interpolant automaton has 46 states. [2018-06-24 20:54:33,507 INFO ]: Start isEmpty. Operand 36 states and 37 transitions. [2018-06-24 20:54:33,507 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-24 20:54:33,507 INFO ]: Found error trace [2018-06-24 20:54:33,507 INFO ]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:33,507 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:33,507 INFO ]: Analyzing trace with hash -290030458, now seen corresponding path program 41 times [2018-06-24 20:54:33,507 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:33,507 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:33,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:33,508 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:33,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:33,519 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:34,457 INFO ]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:34,457 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:34,457 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:34,462 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:54:34,515 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-06-24 20:54:34,515 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:34,519 INFO ]: Computing forward predicates... [2018-06-24 20:54:34,644 INFO ]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:34,663 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:34,663 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-06-24 20:54:34,663 INFO ]: Interpolant automaton has 33 states [2018-06-24 20:54:34,663 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-24 20:54:34,663 INFO ]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:54:34,663 INFO ]: Start difference. First operand 36 states and 37 transitions. Second operand 33 states. [2018-06-24 20:54:35,509 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:35,509 INFO ]: Finished difference Result 55 states and 58 transitions. [2018-06-24 20:54:35,509 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-24 20:54:35,509 INFO ]: Start accepts. Automaton has 33 states. Word has length 35 [2018-06-24 20:54:35,509 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:35,509 INFO ]: With dead ends: 55 [2018-06-24 20:54:35,509 INFO ]: Without dead ends: 55 [2018-06-24 20:54:35,510 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 25 SyntacticMatches, 11 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=178, Invalid=2372, Unknown=0, NotChecked=0, Total=2550 [2018-06-24 20:54:35,510 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-24 20:54:35,511 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 38. [2018-06-24 20:54:35,511 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-24 20:54:35,511 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-06-24 20:54:35,511 INFO ]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 35 [2018-06-24 20:54:35,511 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:35,511 INFO ]: Abstraction has 38 states and 40 transitions. [2018-06-24 20:54:35,511 INFO ]: Interpolant automaton has 33 states. [2018-06-24 20:54:35,511 INFO ]: Start isEmpty. Operand 38 states and 40 transitions. [2018-06-24 20:54:35,512 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-24 20:54:35,512 INFO ]: Found error trace [2018-06-24 20:54:35,512 INFO ]: trace histogram [16, 14, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:35,512 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:35,512 INFO ]: Analyzing trace with hash -401482315, now seen corresponding path program 42 times [2018-06-24 20:54:35,512 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:35,512 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:35,512 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:35,512 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:35,512 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:35,521 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:36,031 INFO ]: Checked inductivity of 241 backedges. 105 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:36,031 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:36,031 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:36,037 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:54:36,093 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-06-24 20:54:36,093 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:36,096 INFO ]: Computing forward predicates... [2018-06-24 20:54:36,485 INFO ]: Checked inductivity of 241 backedges. 136 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:36,504 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:36,504 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 50 [2018-06-24 20:54:36,504 INFO ]: Interpolant automaton has 50 states [2018-06-24 20:54:36,505 INFO ]: Constructing interpolant automaton starting with 50 interpolants. [2018-06-24 20:54:36,505 INFO ]: CoverageRelationStatistics Valid=579, Invalid=1871, Unknown=0, NotChecked=0, Total=2450 [2018-06-24 20:54:36,505 INFO ]: Start difference. First operand 38 states and 40 transitions. Second operand 50 states. [2018-06-24 20:54:36,833 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:36,833 INFO ]: Finished difference Result 54 states and 56 transitions. [2018-06-24 20:54:36,833 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-24 20:54:36,833 INFO ]: Start accepts. Automaton has 50 states. Word has length 36 [2018-06-24 20:54:36,833 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:36,834 INFO ]: With dead ends: 54 [2018-06-24 20:54:36,834 INFO ]: Without dead ends: 37 [2018-06-24 20:54:36,834 INFO ]: 0 DeclaredPredicates, 86 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1055, Invalid=3367, Unknown=0, NotChecked=0, Total=4422 [2018-06-24 20:54:36,834 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-24 20:54:36,835 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-24 20:54:36,835 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-24 20:54:36,835 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-06-24 20:54:36,835 INFO ]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 36 [2018-06-24 20:54:36,835 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:36,835 INFO ]: Abstraction has 37 states and 38 transitions. [2018-06-24 20:54:36,835 INFO ]: Interpolant automaton has 50 states. [2018-06-24 20:54:36,835 INFO ]: Start isEmpty. Operand 37 states and 38 transitions. [2018-06-24 20:54:36,835 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-24 20:54:36,835 INFO ]: Found error trace [2018-06-24 20:54:36,835 INFO ]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:36,835 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:36,835 INFO ]: Analyzing trace with hash -737698599, now seen corresponding path program 43 times [2018-06-24 20:54:36,835 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:36,835 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:36,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:36,835 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:36,836 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:36,841 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:37,252 INFO ]: Checked inductivity of 240 backedges. 120 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:37,252 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:37,252 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:37,258 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:37,303 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:37,306 INFO ]: Computing forward predicates... [2018-06-24 20:54:37,542 INFO ]: Checked inductivity of 240 backedges. 120 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:37,561 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:37,561 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 49 [2018-06-24 20:54:37,561 INFO ]: Interpolant automaton has 49 states [2018-06-24 20:54:37,561 INFO ]: Constructing interpolant automaton starting with 49 interpolants. [2018-06-24 20:54:37,561 INFO ]: CoverageRelationStatistics Valid=576, Invalid=1776, Unknown=0, NotChecked=0, Total=2352 [2018-06-24 20:54:37,562 INFO ]: Start difference. First operand 37 states and 38 transitions. Second operand 49 states. [2018-06-24 20:54:37,891 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:37,891 INFO ]: Finished difference Result 38 states and 39 transitions. [2018-06-24 20:54:37,892 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-24 20:54:37,892 INFO ]: Start accepts. Automaton has 49 states. Word has length 36 [2018-06-24 20:54:37,892 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:37,892 INFO ]: With dead ends: 38 [2018-06-24 20:54:37,892 INFO ]: Without dead ends: 38 [2018-06-24 20:54:37,892 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1168 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1240, Invalid=2920, Unknown=0, NotChecked=0, Total=4160 [2018-06-24 20:54:37,892 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-24 20:54:37,893 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-24 20:54:37,893 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-24 20:54:37,893 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-06-24 20:54:37,893 INFO ]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 36 [2018-06-24 20:54:37,893 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:37,893 INFO ]: Abstraction has 38 states and 39 transitions. [2018-06-24 20:54:37,893 INFO ]: Interpolant automaton has 49 states. [2018-06-24 20:54:37,893 INFO ]: Start isEmpty. Operand 38 states and 39 transitions. [2018-06-24 20:54:37,894 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-24 20:54:37,894 INFO ]: Found error trace [2018-06-24 20:54:37,894 INFO ]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:37,894 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:37,894 INFO ]: Analyzing trace with hash -1394292798, now seen corresponding path program 44 times [2018-06-24 20:54:37,894 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:37,894 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:37,894 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:37,894 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:37,894 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:37,901 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:38,447 INFO ]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:38,447 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:38,447 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:38,454 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:54:38,508 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:54:38,508 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:38,513 INFO ]: Computing forward predicates... [2018-06-24 20:54:38,697 INFO ]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:38,716 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:38,716 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-06-24 20:54:38,716 INFO ]: Interpolant automaton has 35 states [2018-06-24 20:54:38,716 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-24 20:54:38,716 INFO ]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 20:54:38,716 INFO ]: Start difference. First operand 38 states and 39 transitions. Second operand 35 states. [2018-06-24 20:54:39,847 WARN ]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2018-06-24 20:54:39,848 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:39,848 INFO ]: Finished difference Result 58 states and 61 transitions. [2018-06-24 20:54:39,848 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-24 20:54:39,848 INFO ]: Start accepts. Automaton has 35 states. Word has length 37 [2018-06-24 20:54:39,848 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:39,849 INFO ]: With dead ends: 58 [2018-06-24 20:54:39,849 INFO ]: Without dead ends: 58 [2018-06-24 20:54:39,849 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 26 SyntacticMatches, 12 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=189, Invalid=2673, Unknown=0, NotChecked=0, Total=2862 [2018-06-24 20:54:39,849 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-24 20:54:39,850 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 40. [2018-06-24 20:54:39,850 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-24 20:54:39,850 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-06-24 20:54:39,850 INFO ]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 37 [2018-06-24 20:54:39,850 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:39,850 INFO ]: Abstraction has 40 states and 42 transitions. [2018-06-24 20:54:39,850 INFO ]: Interpolant automaton has 35 states. [2018-06-24 20:54:39,850 INFO ]: Start isEmpty. Operand 40 states and 42 transitions. [2018-06-24 20:54:39,851 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-24 20:54:39,851 INFO ]: Found error trace [2018-06-24 20:54:39,851 INFO ]: trace histogram [17, 15, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:39,851 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:39,851 INFO ]: Analyzing trace with hash -273876487, now seen corresponding path program 45 times [2018-06-24 20:54:39,851 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:39,851 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:39,851 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:39,851 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:39,851 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:39,863 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:40,293 INFO ]: Checked inductivity of 273 backedges. 120 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:40,293 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:40,293 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:40,298 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:54:40,357 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-06-24 20:54:40,357 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:40,360 INFO ]: Computing forward predicates... [2018-06-24 20:54:41,008 INFO ]: Checked inductivity of 273 backedges. 153 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:41,036 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:41,037 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 53 [2018-06-24 20:54:41,037 INFO ]: Interpolant automaton has 53 states [2018-06-24 20:54:41,037 INFO ]: Constructing interpolant automaton starting with 53 interpolants. [2018-06-24 20:54:41,037 INFO ]: CoverageRelationStatistics Valid=649, Invalid=2107, Unknown=0, NotChecked=0, Total=2756 [2018-06-24 20:54:41,037 INFO ]: Start difference. First operand 40 states and 42 transitions. Second operand 53 states. [2018-06-24 20:54:41,406 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:41,407 INFO ]: Finished difference Result 57 states and 59 transitions. [2018-06-24 20:54:41,407 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-24 20:54:41,407 INFO ]: Start accepts. Automaton has 53 states. Word has length 38 [2018-06-24 20:54:41,407 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:41,407 INFO ]: With dead ends: 57 [2018-06-24 20:54:41,407 INFO ]: Without dead ends: 39 [2018-06-24 20:54:41,408 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1180, Invalid=3790, Unknown=0, NotChecked=0, Total=4970 [2018-06-24 20:54:41,408 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-24 20:54:41,409 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-24 20:54:41,409 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-24 20:54:41,409 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-06-24 20:54:41,409 INFO ]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 38 [2018-06-24 20:54:41,409 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:41,409 INFO ]: Abstraction has 39 states and 40 transitions. [2018-06-24 20:54:41,409 INFO ]: Interpolant automaton has 53 states. [2018-06-24 20:54:41,409 INFO ]: Start isEmpty. Operand 39 states and 40 transitions. [2018-06-24 20:54:41,410 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-24 20:54:41,410 INFO ]: Found error trace [2018-06-24 20:54:41,410 INFO ]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:41,410 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:41,410 INFO ]: Analyzing trace with hash -2106646699, now seen corresponding path program 46 times [2018-06-24 20:54:41,410 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:41,410 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:41,410 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:41,410 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:41,410 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:41,424 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:41,850 INFO ]: Checked inductivity of 272 backedges. 136 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:41,850 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:41,850 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:41,855 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:54:41,906 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:54:41,906 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:41,909 INFO ]: Computing forward predicates... [2018-06-24 20:54:42,234 INFO ]: Checked inductivity of 272 backedges. 136 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:42,253 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:42,253 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 52 [2018-06-24 20:54:42,253 INFO ]: Interpolant automaton has 52 states [2018-06-24 20:54:42,253 INFO ]: Constructing interpolant automaton starting with 52 interpolants. [2018-06-24 20:54:42,253 INFO ]: CoverageRelationStatistics Valid=646, Invalid=2006, Unknown=0, NotChecked=0, Total=2652 [2018-06-24 20:54:42,253 INFO ]: Start difference. First operand 39 states and 40 transitions. Second operand 52 states. [2018-06-24 20:54:42,755 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:42,755 INFO ]: Finished difference Result 40 states and 41 transitions. [2018-06-24 20:54:42,777 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-24 20:54:42,777 INFO ]: Start accepts. Automaton has 52 states. Word has length 38 [2018-06-24 20:54:42,777 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:42,778 INFO ]: With dead ends: 40 [2018-06-24 20:54:42,778 INFO ]: Without dead ends: 40 [2018-06-24 20:54:42,778 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1394, Invalid=3298, Unknown=0, NotChecked=0, Total=4692 [2018-06-24 20:54:42,778 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-24 20:54:42,779 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-24 20:54:42,779 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-24 20:54:42,780 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-06-24 20:54:42,780 INFO ]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2018-06-24 20:54:42,780 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:42,780 INFO ]: Abstraction has 40 states and 41 transitions. [2018-06-24 20:54:42,780 INFO ]: Interpolant automaton has 52 states. [2018-06-24 20:54:42,780 INFO ]: Start isEmpty. Operand 40 states and 41 transitions. [2018-06-24 20:54:42,780 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-24 20:54:42,780 INFO ]: Found error trace [2018-06-24 20:54:42,780 INFO ]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:42,780 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:42,780 INFO ]: Analyzing trace with hash -882010938, now seen corresponding path program 47 times [2018-06-24 20:54:42,780 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:42,780 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:42,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:42,781 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:42,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:42,789 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:44,373 INFO ]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:44,373 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:44,373 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:44,379 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:54:44,442 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-24 20:54:44,442 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:44,447 INFO ]: Computing forward predicates... [2018-06-24 20:54:44,630 INFO ]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:44,650 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:44,650 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-06-24 20:54:44,650 INFO ]: Interpolant automaton has 37 states [2018-06-24 20:54:44,650 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-24 20:54:44,650 INFO ]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:54:44,650 INFO ]: Start difference. First operand 40 states and 41 transitions. Second operand 37 states. [2018-06-24 20:54:45,716 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:45,716 INFO ]: Finished difference Result 61 states and 64 transitions. [2018-06-24 20:54:45,716 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-24 20:54:45,716 INFO ]: Start accepts. Automaton has 37 states. Word has length 39 [2018-06-24 20:54:45,716 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:45,717 INFO ]: With dead ends: 61 [2018-06-24 20:54:45,717 INFO ]: Without dead ends: 61 [2018-06-24 20:54:45,717 INFO ]: 0 DeclaredPredicates, 95 GetRequests, 29 SyntacticMatches, 11 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=200, Invalid=2992, Unknown=0, NotChecked=0, Total=3192 [2018-06-24 20:54:45,717 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-24 20:54:45,718 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 42. [2018-06-24 20:54:45,718 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-24 20:54:45,719 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-06-24 20:54:45,719 INFO ]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 39 [2018-06-24 20:54:45,719 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:45,719 INFO ]: Abstraction has 42 states and 44 transitions. [2018-06-24 20:54:45,719 INFO ]: Interpolant automaton has 37 states. [2018-06-24 20:54:45,719 INFO ]: Start isEmpty. Operand 42 states and 44 transitions. [2018-06-24 20:54:45,719 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-24 20:54:45,719 INFO ]: Found error trace [2018-06-24 20:54:45,719 INFO ]: trace histogram [18, 16, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:45,719 INFO ]: === Iteration 51 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:45,719 INFO ]: Analyzing trace with hash -1573008011, now seen corresponding path program 48 times [2018-06-24 20:54:45,719 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:45,719 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:45,721 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:45,721 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:45,721 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:45,728 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:46,596 INFO ]: Checked inductivity of 307 backedges. 136 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:46,596 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:46,596 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:46,602 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:54:46,662 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-24 20:54:46,662 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:46,666 INFO ]: Computing forward predicates... [2018-06-24 20:54:48,283 INFO ]: Checked inductivity of 307 backedges. 171 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:48,303 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:48,303 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 56 [2018-06-24 20:54:48,303 INFO ]: Interpolant automaton has 56 states [2018-06-24 20:54:48,303 INFO ]: Constructing interpolant automaton starting with 56 interpolants. [2018-06-24 20:54:48,304 INFO ]: CoverageRelationStatistics Valid=723, Invalid=2357, Unknown=0, NotChecked=0, Total=3080 [2018-06-24 20:54:48,304 INFO ]: Start difference. First operand 42 states and 44 transitions. Second operand 56 states. [2018-06-24 20:54:48,654 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:48,654 INFO ]: Finished difference Result 60 states and 62 transitions. [2018-06-24 20:54:48,654 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-24 20:54:48,654 INFO ]: Start accepts. Automaton has 56 states. Word has length 40 [2018-06-24 20:54:48,654 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:48,654 INFO ]: With dead ends: 60 [2018-06-24 20:54:48,654 INFO ]: Without dead ends: 41 [2018-06-24 20:54:48,655 INFO ]: 0 DeclaredPredicates, 96 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1312, Invalid=4238, Unknown=0, NotChecked=0, Total=5550 [2018-06-24 20:54:48,655 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-24 20:54:48,656 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-24 20:54:48,656 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-24 20:54:48,656 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-06-24 20:54:48,656 INFO ]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 40 [2018-06-24 20:54:48,656 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:48,656 INFO ]: Abstraction has 41 states and 42 transitions. [2018-06-24 20:54:48,656 INFO ]: Interpolant automaton has 56 states. [2018-06-24 20:54:48,656 INFO ]: Start isEmpty. Operand 41 states and 42 transitions. [2018-06-24 20:54:48,656 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-24 20:54:48,656 INFO ]: Found error trace [2018-06-24 20:54:48,656 INFO ]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:48,656 INFO ]: === Iteration 52 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:48,657 INFO ]: Analyzing trace with hash 1740657561, now seen corresponding path program 49 times [2018-06-24 20:54:48,657 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:48,657 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:48,657 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:48,657 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:48,657 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:48,667 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:49,840 INFO ]: Checked inductivity of 306 backedges. 153 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:49,840 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:49,840 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:49,847 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:49,906 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:49,910 INFO ]: Computing forward predicates... [2018-06-24 20:54:50,264 INFO ]: Checked inductivity of 306 backedges. 153 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:50,284 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:50,284 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 55 [2018-06-24 20:54:50,284 INFO ]: Interpolant automaton has 55 states [2018-06-24 20:54:50,284 INFO ]: Constructing interpolant automaton starting with 55 interpolants. [2018-06-24 20:54:50,284 INFO ]: CoverageRelationStatistics Valid=720, Invalid=2250, Unknown=0, NotChecked=0, Total=2970 [2018-06-24 20:54:50,287 INFO ]: Start difference. First operand 41 states and 42 transitions. Second operand 55 states. [2018-06-24 20:54:50,822 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:50,822 INFO ]: Finished difference Result 42 states and 43 transitions. [2018-06-24 20:54:50,822 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-24 20:54:50,822 INFO ]: Start accepts. Automaton has 55 states. Word has length 40 [2018-06-24 20:54:50,822 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:50,822 INFO ]: With dead ends: 42 [2018-06-24 20:54:50,822 INFO ]: Without dead ends: 42 [2018-06-24 20:54:50,823 INFO ]: 0 DeclaredPredicates, 95 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1557, Invalid=3699, Unknown=0, NotChecked=0, Total=5256 [2018-06-24 20:54:50,823 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-24 20:54:50,823 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-24 20:54:50,823 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-24 20:54:50,824 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-06-24 20:54:50,824 INFO ]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 40 [2018-06-24 20:54:50,824 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:50,824 INFO ]: Abstraction has 42 states and 43 transitions. [2018-06-24 20:54:50,824 INFO ]: Interpolant automaton has 55 states. [2018-06-24 20:54:50,824 INFO ]: Start isEmpty. Operand 42 states and 43 transitions. [2018-06-24 20:54:50,824 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-24 20:54:50,824 INFO ]: Found error trace [2018-06-24 20:54:50,824 INFO ]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:50,824 INFO ]: === Iteration 53 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:50,824 INFO ]: Analyzing trace with hash -1874663166, now seen corresponding path program 50 times [2018-06-24 20:54:50,824 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:50,824 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:50,824 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:50,824 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:50,824 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:50,833 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:51,611 INFO ]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:51,611 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:51,611 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:51,627 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:54:51,681 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:54:51,681 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:51,686 INFO ]: Computing forward predicates... [2018-06-24 20:54:51,811 INFO ]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:51,829 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:51,829 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-06-24 20:54:51,830 INFO ]: Interpolant automaton has 39 states [2018-06-24 20:54:51,830 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-24 20:54:51,830 INFO ]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-06-24 20:54:51,830 INFO ]: Start difference. First operand 42 states and 43 transitions. Second operand 39 states. Received shutdown request... [2018-06-24 20:54:51,938 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:54:51,938 WARN ]: Verification canceled [2018-06-24 20:54:51,941 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:54:51,942 WARN ]: Timeout [2018-06-24 20:54:51,942 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:54:51 BasicIcfg [2018-06-24 20:54:51,942 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:54:51,943 INFO ]: Toolchain (without parser) took 56533.22 ms. Allocated memory was 305.1 MB in the beginning and 834.1 MB in the end (delta: 529.0 MB). Free memory was 261.5 MB in the beginning and 713.2 MB in the end (delta: -451.7 MB). Peak memory consumption was 77.3 MB. Max. memory is 3.6 GB. [2018-06-24 20:54:51,944 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 305.1 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:54:51,944 INFO ]: ChcToBoogie took 63.46 ms. Allocated memory is still 305.1 MB. Free memory was 261.5 MB in the beginning and 259.5 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:54:51,944 INFO ]: Boogie Preprocessor took 33.26 ms. Allocated memory is still 305.1 MB. Free memory was 259.5 MB in the beginning and 257.5 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:54:51,945 INFO ]: RCFGBuilder took 291.90 ms. Allocated memory is still 305.1 MB. Free memory was 257.5 MB in the beginning and 249.5 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:54:51,945 INFO ]: BlockEncodingV2 took 139.11 ms. Allocated memory is still 305.1 MB. Free memory was 249.5 MB in the beginning and 245.5 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:54:51,945 INFO ]: TraceAbstraction took 55997.43 ms. Allocated memory was 305.1 MB in the beginning and 834.1 MB in the end (delta: 529.0 MB). Free memory was 245.5 MB in the beginning and 713.2 MB in the end (delta: -467.7 MB). Peak memory consumption was 61.3 MB. Max. memory is 3.6 GB. [2018-06-24 20:54:51,950 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 13 locations, 14 edges - StatisticsResult: Encoded RCFG 7 locations, 8 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 305.1 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 63.46 ms. Allocated memory is still 305.1 MB. Free memory was 261.5 MB in the beginning and 259.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 33.26 ms. Allocated memory is still 305.1 MB. Free memory was 259.5 MB in the beginning and 257.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 291.90 ms. Allocated memory is still 305.1 MB. Free memory was 257.5 MB in the beginning and 249.5 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 139.11 ms. Allocated memory is still 305.1 MB. Free memory was 249.5 MB in the beginning and 245.5 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 55997.43 ms. Allocated memory was 305.1 MB in the beginning and 834.1 MB in the end (delta: 529.0 MB). Free memory was 245.5 MB in the beginning and 713.2 MB in the end (delta: -467.7 MB). Peak memory consumption was 61.3 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 (42states) and interpolant automaton (currently 10 states, 39 states before enhancement), while ReachableStatesComputation was computing reachable states (9 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 7 locations, 1 error locations. TIMEOUT Result, 55.9s OverallTime, 53 OverallIterations, 18 TraceHistogramMax, 17.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 279 SDtfs, 462 SDslu, 3543 SDs, 0 SdLazy, 15072 SolverSat, 2326 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2904 GetRequests, 839 SyntacticMatches, 137 SemanticMatches, 1928 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16966 ImplicationChecksByTransitivity, 40.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=50, 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, 52 MinimizatonAttempts, 187 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 33.6s InterpolantComputationTime, 2502 NumberOfCodeBlocks, 2502 NumberOfCodeBlocksAsserted, 247 NumberOfCheckSat, 2397 ConstructedInterpolants, 0 QuantifiedInterpolants, 343318 SizeOfPredicates, 278 NumberOfNonLiveVariables, 17264 ConjunctsInSsa, 3967 ConjunctsInUnsatCore, 105 InterpolantComputations, 2 PerfectInterpolantSequences, 3893/12004 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/upcount_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-54-51-973.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/upcount_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-54-51-973.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/upcount_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-54-51-973.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/upcount_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-54-51-973.csv Completed graceful shutdown