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/vmt-chc-benchmarks/ctigar/up4.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 22:02:43,337 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 22:02:43,338 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 22:02:43,352 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 22:02:43,352 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 22:02:43,353 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 22:02:43,354 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 22:02:43,361 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 22:02:43,363 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 22:02:43,365 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 22:02:43,366 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 22:02:43,366 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 22:02:43,367 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 22:02:43,370 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 22:02:43,371 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 22:02:43,372 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 22:02:43,372 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 22:02:43,374 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 22:02:43,376 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 22:02:43,377 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 22:02:43,378 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 22:02:43,379 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 22:02:43,381 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 22:02:43,381 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 22:02:43,382 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 22:02:43,386 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 22:02:43,388 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 22:02:43,388 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 22:02:43,389 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 22:02:43,390 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 22:02:43,390 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 22:02:43,391 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 22:02:43,391 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 22:02:43,391 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 22:02:43,392 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 22:02:43,392 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 22:02:43,393 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 22:02:43,408 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 22:02:43,408 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 22:02:43,409 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 22:02:43,409 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 22:02:43,410 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 22:02:43,410 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 22:02:43,410 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 22:02:43,410 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 22:02:43,411 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 22:02:43,411 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 22:02:43,411 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 22:02:43,411 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 22:02:43,411 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 22:02:43,412 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 22:02:43,412 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 22:02:43,412 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 22:02:43,412 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 22:02:43,412 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 22:02:43,413 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 22:02:43,413 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 22:02:43,413 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 22:02:43,415 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 22:02:43,415 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 22:02:43,468 INFO ]: Repository-Root is: /tmp [2018-06-26 22:02:43,483 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 22:02:43,488 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 22:02:43,489 INFO ]: Initializing SmtParser... [2018-06-26 22:02:43,490 INFO ]: SmtParser initialized [2018-06-26 22:02:43,491 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/up4.c.smt2 [2018-06-26 22:02:43,492 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-26 22:02:43,580 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/up4.c.smt2 unknown [2018-06-26 22:02:43,835 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/up4.c.smt2 [2018-06-26 22:02:43,840 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 22:02:43,845 INFO ]: Walking toolchain with 5 elements. [2018-06-26 22:02:43,845 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 22:02:43,845 INFO ]: Initializing ChcToBoogie... [2018-06-26 22:02:43,845 INFO ]: ChcToBoogie initialized [2018-06-26 22:02:43,848 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 10:02:43" (1/1) ... [2018-06-26 22:02:43,902 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:02:43 Unit [2018-06-26 22:02:43,902 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 22:02:43,902 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 22:02:43,902 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 22:02:43,902 INFO ]: Boogie Preprocessor initialized [2018-06-26 22:02:43,923 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:02:43" (1/1) ... [2018-06-26 22:02:43,923 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:02:43" (1/1) ... [2018-06-26 22:02:43,930 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:02:43" (1/1) ... [2018-06-26 22:02:43,930 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:02:43" (1/1) ... [2018-06-26 22:02:43,945 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:02:43" (1/1) ... [2018-06-26 22:02:43,946 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:02:43" (1/1) ... [2018-06-26 22:02:43,947 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:02:43" (1/1) ... [2018-06-26 22:02:43,949 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 22:02:43,950 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 22:02:43,950 INFO ]: Initializing RCFGBuilder... [2018-06-26 22:02:43,950 INFO ]: RCFGBuilder initialized [2018-06-26 22:02:43,950 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:02:43" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 22:02:43,971 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 22:02:43,971 INFO ]: Found specification of procedure gotoProc [2018-06-26 22:02:43,971 INFO ]: Found implementation of procedure gotoProc [2018-06-26 22:02:43,971 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 22:02:43,971 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 22:02:43,971 INFO ]: Found implementation of procedure Ultimate.START [2018-06-26 22:02:44,178 INFO ]: Using library mode [2018-06-26 22:02:44,178 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 10:02:44 BoogieIcfgContainer [2018-06-26 22:02:44,178 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 22:02:44,178 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 22:02:44,178 INFO ]: Initializing BlockEncodingV2... [2018-06-26 22:02:44,179 INFO ]: BlockEncodingV2 initialized [2018-06-26 22:02:44,180 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 10:02:44" (1/1) ... [2018-06-26 22:02:44,192 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 22:02:44,193 INFO ]: Using Remove infeasible edges [2018-06-26 22:02:44,193 INFO ]: Using Maximize final states [2018-06-26 22:02:44,194 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 22:02:44,194 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 22:02:44,195 INFO ]: Using Remove sink states [2018-06-26 22:02:44,196 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 22:02:44,196 INFO ]: Using Use SBE [2018-06-26 22:02:44,214 WARN ]: expecting exponential blowup for input size 22 [2018-06-26 22:02:50,180 INFO ]: SBE split 1 edges [2018-06-26 22:02:50,189 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 22:02:50,191 INFO ]: 0 new accepting states [2018-06-26 22:02:50,218 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 22:02:50,220 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 22:02:50,227 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 22:02:50,227 INFO ]: 0 new accepting states [2018-06-26 22:02:50,227 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 22:02:50,228 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 22:02:50,233 INFO ]: Encoded RCFG 6 locations, 119 edges [2018-06-26 22:02:50,233 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 10:02:50 BasicIcfg [2018-06-26 22:02:50,234 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 22:02:50,235 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 22:02:50,235 INFO ]: Initializing TraceAbstraction... [2018-06-26 22:02:50,238 INFO ]: TraceAbstraction initialized [2018-06-26 22:02:50,238 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 10:02:43" (1/4) ... [2018-06-26 22:02:50,239 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e11108f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 10:02:50, skipping insertion in model container [2018-06-26 22:02:50,239 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:02:43" (2/4) ... [2018-06-26 22:02:50,239 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e11108f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 10:02:50, skipping insertion in model container [2018-06-26 22:02:50,239 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 10:02:44" (3/4) ... [2018-06-26 22:02:50,240 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e11108f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 10:02:50, skipping insertion in model container [2018-06-26 22:02:50,240 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 10:02:50" (4/4) ... [2018-06-26 22:02:50,243 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 22:02:50,249 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 22:02:50,255 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 22:02:50,291 INFO ]: Using default assertion order modulation [2018-06-26 22:02:50,292 INFO ]: Interprodecural is true [2018-06-26 22:02:50,292 INFO ]: Hoare is false [2018-06-26 22:02:50,292 INFO ]: Compute interpolants for FPandBP [2018-06-26 22:02:50,292 INFO ]: Backedges is TWOTRACK [2018-06-26 22:02:50,292 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 22:02:50,292 INFO ]: Difference is false [2018-06-26 22:02:50,292 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 22:02:50,292 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 22:02:50,304 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 22:02:50,316 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 22:02:50,316 INFO ]: Found error trace [2018-06-26 22:02:50,317 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 22:02:50,317 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:50,321 INFO ]: Analyzing trace with hash 38908290, now seen corresponding path program 1 times [2018-06-26 22:02:50,323 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:50,323 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:50,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:50,356 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:02:50,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:50,397 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:50,495 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:02:50,497 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:02:50,497 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:02:50,499 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:02:50,514 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:02:50,515 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:02:50,521 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 22:02:51,890 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:02:51,891 INFO ]: Finished difference Result 7 states and 172 transitions. [2018-06-26 22:02:51,891 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:02:51,892 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 22:02:51,892 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:02:51,901 INFO ]: With dead ends: 7 [2018-06-26 22:02:51,902 INFO ]: Without dead ends: 7 [2018-06-26 22:02:51,903 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:02:51,920 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 22:02:51,938 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 22:02:51,939 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 22:02:51,940 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions. [2018-06-26 22:02:51,941 INFO ]: Start accepts. Automaton has 7 states and 172 transitions. Word has length 5 [2018-06-26 22:02:51,942 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:02:51,942 INFO ]: Abstraction has 7 states and 172 transitions. [2018-06-26 22:02:51,942 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:02:51,942 INFO ]: Start isEmpty. Operand 7 states and 172 transitions. [2018-06-26 22:02:51,943 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 22:02:51,943 INFO ]: Found error trace [2018-06-26 22:02:51,943 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 22:02:51,943 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:51,943 INFO ]: Analyzing trace with hash 1203706599, now seen corresponding path program 1 times [2018-06-26 22:02:51,943 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:51,943 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:51,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:51,944 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:02:51,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:51,953 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:51,993 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:02:51,994 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:02:51,994 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:02:51,995 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:02:51,995 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:02:51,995 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:02:51,995 INFO ]: Start difference. First operand 7 states and 172 transitions. Second operand 3 states. [2018-06-26 22:02:52,401 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:02:52,401 INFO ]: Finished difference Result 9 states and 256 transitions. [2018-06-26 22:02:52,401 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:02:52,401 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 22:02:52,401 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:02:52,403 INFO ]: With dead ends: 9 [2018-06-26 22:02:52,403 INFO ]: Without dead ends: 9 [2018-06-26 22:02:52,404 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:02:52,404 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 22:02:52,408 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 22:02:52,408 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 22:02:52,409 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 256 transitions. [2018-06-26 22:02:52,409 INFO ]: Start accepts. Automaton has 9 states and 256 transitions. Word has length 6 [2018-06-26 22:02:52,409 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:02:52,409 INFO ]: Abstraction has 9 states and 256 transitions. [2018-06-26 22:02:52,409 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:02:52,409 INFO ]: Start isEmpty. Operand 9 states and 256 transitions. [2018-06-26 22:02:52,409 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 22:02:52,409 INFO ]: Found error trace [2018-06-26 22:02:52,409 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:02:52,409 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:52,410 INFO ]: Analyzing trace with hash -1273851350, now seen corresponding path program 1 times [2018-06-26 22:02:52,410 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:52,410 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:52,410 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:52,410 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:02:52,410 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:52,429 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:52,455 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:02:52,455 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:02:52,455 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:02:52,455 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:02:52,455 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:02:52,455 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:02:52,455 INFO ]: Start difference. First operand 9 states and 256 transitions. Second operand 3 states. [2018-06-26 22:02:52,766 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:02:52,766 INFO ]: Finished difference Result 13 states and 389 transitions. [2018-06-26 22:02:52,766 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:02:52,766 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 22:02:52,766 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:02:52,767 INFO ]: With dead ends: 13 [2018-06-26 22:02:52,767 INFO ]: Without dead ends: 13 [2018-06-26 22:02:52,767 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:02:52,767 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 22:02:52,775 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 22:02:52,775 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 22:02:52,777 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 389 transitions. [2018-06-26 22:02:52,777 INFO ]: Start accepts. Automaton has 13 states and 389 transitions. Word has length 7 [2018-06-26 22:02:52,777 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:02:52,777 INFO ]: Abstraction has 13 states and 389 transitions. [2018-06-26 22:02:52,777 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:02:52,777 INFO ]: Start isEmpty. Operand 13 states and 389 transitions. [2018-06-26 22:02:52,777 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 22:02:52,778 INFO ]: Found error trace [2018-06-26 22:02:52,778 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:02:52,778 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:52,778 INFO ]: Analyzing trace with hash 1370352070, now seen corresponding path program 1 times [2018-06-26 22:02:52,778 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:52,778 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:52,779 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:52,779 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:02:52,779 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:52,793 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:52,816 INFO ]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 22:02:52,816 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:02:52,816 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:02:52,816 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:02:52,816 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:02:52,816 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:02:52,816 INFO ]: Start difference. First operand 13 states and 389 transitions. Second operand 3 states. [2018-06-26 22:02:53,150 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:02:53,150 INFO ]: Finished difference Result 13 states and 268 transitions. [2018-06-26 22:02:53,150 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:02:53,150 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 22:02:53,150 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:02:53,151 INFO ]: With dead ends: 13 [2018-06-26 22:02:53,151 INFO ]: Without dead ends: 13 [2018-06-26 22:02:53,151 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:02:53,151 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 22:02:53,154 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 22:02:53,154 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 22:02:53,155 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 268 transitions. [2018-06-26 22:02:53,155 INFO ]: Start accepts. Automaton has 13 states and 268 transitions. Word has length 9 [2018-06-26 22:02:53,155 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:02:53,155 INFO ]: Abstraction has 13 states and 268 transitions. [2018-06-26 22:02:53,155 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:02:53,155 INFO ]: Start isEmpty. Operand 13 states and 268 transitions. [2018-06-26 22:02:53,156 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 22:02:53,156 INFO ]: Found error trace [2018-06-26 22:02:53,156 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:02:53,156 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:53,156 INFO ]: Analyzing trace with hash 1373033260, now seen corresponding path program 1 times [2018-06-26 22:02:53,156 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:53,156 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:53,157 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:53,157 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:02:53,157 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:53,174 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:53,205 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 22:02:53,205 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:02:53,205 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:02:53,205 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:02:53,205 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:02:53,206 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:02:53,206 INFO ]: Start difference. First operand 13 states and 268 transitions. Second operand 3 states. [2018-06-26 22:02:53,379 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:02:53,379 INFO ]: Finished difference Result 19 states and 330 transitions. [2018-06-26 22:02:53,380 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:02:53,380 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 22:02:53,380 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:02:53,380 INFO ]: With dead ends: 19 [2018-06-26 22:02:53,380 INFO ]: Without dead ends: 18 [2018-06-26 22:02:53,381 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:02:53,381 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-26 22:02:53,384 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-26 22:02:53,384 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-26 22:02:53,385 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 216 transitions. [2018-06-26 22:02:53,385 INFO ]: Start accepts. Automaton has 18 states and 216 transitions. Word has length 9 [2018-06-26 22:02:53,385 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:02:53,385 INFO ]: Abstraction has 18 states and 216 transitions. [2018-06-26 22:02:53,385 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:02:53,385 INFO ]: Start isEmpty. Operand 18 states and 216 transitions. [2018-06-26 22:02:53,386 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 22:02:53,386 INFO ]: Found error trace [2018-06-26 22:02:53,386 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:02:53,386 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:53,386 INFO ]: Analyzing trace with hash -366970472, now seen corresponding path program 1 times [2018-06-26 22:02:53,386 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:53,386 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:53,387 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:53,387 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:02:53,387 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:53,404 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:53,475 INFO ]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 22:02:53,475 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:02:53,475 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:02:53,475 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:02:53,476 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:02:53,476 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:02:53,476 INFO ]: Start difference. First operand 18 states and 216 transitions. Second operand 3 states. [2018-06-26 22:02:53,728 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:02:53,729 INFO ]: Finished difference Result 32 states and 354 transitions. [2018-06-26 22:02:53,729 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:02:53,729 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 22:02:53,729 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:02:53,732 INFO ]: With dead ends: 32 [2018-06-26 22:02:53,732 INFO ]: Without dead ends: 32 [2018-06-26 22:02:53,732 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:02:53,732 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-26 22:02:53,737 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-06-26 22:02:53,737 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-26 22:02:53,738 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 353 transitions. [2018-06-26 22:02:53,738 INFO ]: Start accepts. Automaton has 31 states and 353 transitions. Word has length 10 [2018-06-26 22:02:53,738 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:02:53,738 INFO ]: Abstraction has 31 states and 353 transitions. [2018-06-26 22:02:53,738 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:02:53,738 INFO ]: Start isEmpty. Operand 31 states and 353 transitions. [2018-06-26 22:02:53,739 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 22:02:53,739 INFO ]: Found error trace [2018-06-26 22:02:53,739 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:02:53,739 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:53,739 INFO ]: Analyzing trace with hash -469779213, now seen corresponding path program 1 times [2018-06-26 22:02:53,739 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:53,739 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:53,740 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:53,740 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:02:53,740 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:53,752 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:53,802 INFO ]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 22:02:53,802 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:02:53,802 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:02:53,803 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:02:53,803 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:02:53,803 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:02:53,803 INFO ]: Start difference. First operand 31 states and 353 transitions. Second operand 3 states. [2018-06-26 22:02:54,029 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:02:54,029 INFO ]: Finished difference Result 58 states and 646 transitions. [2018-06-26 22:02:54,031 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:02:54,031 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 22:02:54,032 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:02:54,033 INFO ]: With dead ends: 58 [2018-06-26 22:02:54,033 INFO ]: Without dead ends: 42 [2018-06-26 22:02:54,033 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:02:54,033 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-26 22:02:54,038 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-06-26 22:02:54,038 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-26 22:02:54,040 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 348 transitions. [2018-06-26 22:02:54,040 INFO ]: Start accepts. Automaton has 41 states and 348 transitions. Word has length 10 [2018-06-26 22:02:54,040 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:02:54,040 INFO ]: Abstraction has 41 states and 348 transitions. [2018-06-26 22:02:54,040 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:02:54,040 INFO ]: Start isEmpty. Operand 41 states and 348 transitions. [2018-06-26 22:02:54,041 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 22:02:54,041 INFO ]: Found error trace [2018-06-26 22:02:54,041 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:02:54,041 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:54,041 INFO ]: Analyzing trace with hash 1771296163, now seen corresponding path program 1 times [2018-06-26 22:02:54,041 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:54,041 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:54,042 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:54,042 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:02:54,042 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:54,048 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:54,061 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 22:02:54,061 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:02:54,061 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:02:54,061 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:02:54,061 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:02:54,061 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:02:54,061 INFO ]: Start difference. First operand 41 states and 348 transitions. Second operand 3 states. [2018-06-26 22:02:54,276 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:02:54,276 INFO ]: Finished difference Result 41 states and 245 transitions. [2018-06-26 22:02:54,276 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:02:54,276 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 22:02:54,276 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:02:54,277 INFO ]: With dead ends: 41 [2018-06-26 22:02:54,277 INFO ]: Without dead ends: 41 [2018-06-26 22:02:54,277 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:02:54,278 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-26 22:02:54,282 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-26 22:02:54,282 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-26 22:02:54,283 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 245 transitions. [2018-06-26 22:02:54,283 INFO ]: Start accepts. Automaton has 41 states and 245 transitions. Word has length 10 [2018-06-26 22:02:54,283 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:02:54,283 INFO ]: Abstraction has 41 states and 245 transitions. [2018-06-26 22:02:54,283 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:02:54,283 INFO ]: Start isEmpty. Operand 41 states and 245 transitions. [2018-06-26 22:02:54,284 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 22:02:54,284 INFO ]: Found error trace [2018-06-26 22:02:54,284 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:02:54,284 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:54,284 INFO ]: Analyzing trace with hash 845377795, now seen corresponding path program 1 times [2018-06-26 22:02:54,285 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:54,285 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:54,285 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:54,285 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:02:54,285 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:54,295 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:54,337 INFO ]: Checked inductivity of 15 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 22:02:54,337 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:02:54,337 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-26 22:02:54,589 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:02:54,632 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:54,641 INFO ]: Computing forward predicates... [2018-06-26 22:02:54,791 INFO ]: Checked inductivity of 15 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 22:02:54,824 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:02:54,824 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-26 22:02:54,824 INFO ]: Interpolant automaton has 6 states [2018-06-26 22:02:54,825 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 22:02:54,825 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-26 22:02:54,825 INFO ]: Start difference. First operand 41 states and 245 transitions. Second operand 6 states. [2018-06-26 22:02:56,117 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:02:56,117 INFO ]: Finished difference Result 92 states and 475 transitions. [2018-06-26 22:02:56,117 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 22:02:56,117 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-26 22:02:56,117 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:02:56,119 INFO ]: With dead ends: 92 [2018-06-26 22:02:56,120 INFO ]: Without dead ends: 92 [2018-06-26 22:02:56,120 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-26 22:02:56,120 INFO ]: Start minimizeSevpa. Operand 92 states. [2018-06-26 22:02:56,127 INFO ]: Finished minimizeSevpa. Reduced states from 92 to 41. [2018-06-26 22:02:56,127 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-26 22:02:56,128 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 232 transitions. [2018-06-26 22:02:56,128 INFO ]: Start accepts. Automaton has 41 states and 232 transitions. Word has length 10 [2018-06-26 22:02:56,128 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:02:56,128 INFO ]: Abstraction has 41 states and 232 transitions. [2018-06-26 22:02:56,128 INFO ]: Interpolant automaton has 6 states. [2018-06-26 22:02:56,128 INFO ]: Start isEmpty. Operand 41 states and 232 transitions. [2018-06-26 22:02:56,129 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 22:02:56,129 INFO ]: Found error trace [2018-06-26 22:02:56,129 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:02:56,129 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:56,129 INFO ]: Analyzing trace with hash -1486005034, now seen corresponding path program 1 times [2018-06-26 22:02:56,129 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:56,129 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:56,130 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:56,130 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:02:56,130 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:56,146 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:56,184 INFO ]: Checked inductivity of 45 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-26 22:02:56,184 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:02:56,184 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 22:02:56,184 INFO ]: Interpolant automaton has 4 states [2018-06-26 22:02:56,184 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 22:02:56,184 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 22:02:56,184 INFO ]: Start difference. First operand 41 states and 232 transitions. Second operand 4 states. [2018-06-26 22:02:56,473 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:02:56,473 INFO ]: Finished difference Result 96 states and 541 transitions. [2018-06-26 22:02:56,473 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 22:02:56,473 INFO ]: Start accepts. Automaton has 4 states. Word has length 14 [2018-06-26 22:02:56,473 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:02:56,474 INFO ]: With dead ends: 96 [2018-06-26 22:02:56,474 INFO ]: Without dead ends: 58 [2018-06-26 22:02:56,474 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 22:02:56,475 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-26 22:02:56,480 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 53. [2018-06-26 22:02:56,480 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-26 22:02:56,481 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 283 transitions. [2018-06-26 22:02:56,481 INFO ]: Start accepts. Automaton has 53 states and 283 transitions. Word has length 14 [2018-06-26 22:02:56,481 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:02:56,481 INFO ]: Abstraction has 53 states and 283 transitions. [2018-06-26 22:02:56,481 INFO ]: Interpolant automaton has 4 states. [2018-06-26 22:02:56,481 INFO ]: Start isEmpty. Operand 53 states and 283 transitions. [2018-06-26 22:02:56,482 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-26 22:02:56,482 INFO ]: Found error trace [2018-06-26 22:02:56,482 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:02:56,482 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:56,482 INFO ]: Analyzing trace with hash -891802784, now seen corresponding path program 1 times [2018-06-26 22:02:56,482 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:56,482 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:56,483 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:56,483 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:02:56,483 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:56,513 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:56,586 INFO ]: Checked inductivity of 120 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-06-26 22:02:56,586 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:02:56,586 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:02:56,587 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:02:56,587 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:02:56,587 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:02:56,587 INFO ]: Start difference. First operand 53 states and 283 transitions. Second operand 3 states. [2018-06-26 22:02:56,703 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:02:56,703 INFO ]: Finished difference Result 74 states and 386 transitions. [2018-06-26 22:02:56,703 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:02:56,703 INFO ]: Start accepts. Automaton has 3 states. Word has length 20 [2018-06-26 22:02:56,703 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:02:56,704 INFO ]: With dead ends: 74 [2018-06-26 22:02:56,704 INFO ]: Without dead ends: 74 [2018-06-26 22:02:56,705 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:02:56,705 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-26 22:02:56,710 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 53. [2018-06-26 22:02:56,710 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-26 22:02:56,711 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 281 transitions. [2018-06-26 22:02:56,711 INFO ]: Start accepts. Automaton has 53 states and 281 transitions. Word has length 20 [2018-06-26 22:02:56,711 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:02:56,711 INFO ]: Abstraction has 53 states and 281 transitions. [2018-06-26 22:02:56,711 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:02:56,711 INFO ]: Start isEmpty. Operand 53 states and 281 transitions. [2018-06-26 22:02:56,712 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-26 22:02:56,712 INFO ]: Found error trace [2018-06-26 22:02:56,712 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:02:56,712 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:56,712 INFO ]: Analyzing trace with hash -1397613166, now seen corresponding path program 1 times [2018-06-26 22:02:56,712 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:56,712 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:56,713 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:56,713 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:02:56,713 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:56,734 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:56,906 INFO ]: Checked inductivity of 120 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-26 22:02:56,906 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:02:56,906 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 22:02:56,906 INFO ]: Interpolant automaton has 4 states [2018-06-26 22:02:56,906 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 22:02:56,906 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 22:02:56,906 INFO ]: Start difference. First operand 53 states and 281 transitions. Second operand 4 states. [2018-06-26 22:02:57,299 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:02:57,299 INFO ]: Finished difference Result 67 states and 337 transitions. [2018-06-26 22:02:57,299 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 22:02:57,299 INFO ]: Start accepts. Automaton has 4 states. Word has length 20 [2018-06-26 22:02:57,299 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:02:57,300 INFO ]: With dead ends: 67 [2018-06-26 22:02:57,300 INFO ]: Without dead ends: 59 [2018-06-26 22:02:57,300 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 22:02:57,300 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-26 22:02:57,305 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-06-26 22:02:57,305 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-26 22:02:57,306 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 272 transitions. [2018-06-26 22:02:57,306 INFO ]: Start accepts. Automaton has 57 states and 272 transitions. Word has length 20 [2018-06-26 22:02:57,306 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:02:57,306 INFO ]: Abstraction has 57 states and 272 transitions. [2018-06-26 22:02:57,306 INFO ]: Interpolant automaton has 4 states. [2018-06-26 22:02:57,306 INFO ]: Start isEmpty. Operand 57 states and 272 transitions. [2018-06-26 22:02:57,307 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-26 22:02:57,307 INFO ]: Found error trace [2018-06-26 22:02:57,307 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:02:57,307 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:57,307 INFO ]: Analyzing trace with hash -652040784, now seen corresponding path program 1 times [2018-06-26 22:02:57,307 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:57,307 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:57,308 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:57,308 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:02:57,308 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:57,329 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:57,521 INFO ]: Checked inductivity of 120 backedges. 53 proven. 53 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-26 22:02:57,521 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:02:57,521 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-26 22:02:57,528 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:02:57,602 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:57,607 INFO ]: Computing forward predicates... [2018-06-26 22:02:57,628 INFO ]: Checked inductivity of 120 backedges. 53 proven. 53 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-26 22:02:57,660 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:02:57,660 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-26 22:02:57,660 INFO ]: Interpolant automaton has 7 states [2018-06-26 22:02:57,660 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 22:02:57,660 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-26 22:02:57,661 INFO ]: Start difference. First operand 57 states and 272 transitions. Second operand 7 states. [2018-06-26 22:02:59,389 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:02:59,389 INFO ]: Finished difference Result 240 states and 1126 transitions. [2018-06-26 22:02:59,389 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 22:02:59,389 INFO ]: Start accepts. Automaton has 7 states. Word has length 20 [2018-06-26 22:02:59,389 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:02:59,391 INFO ]: With dead ends: 240 [2018-06-26 22:02:59,391 INFO ]: Without dead ends: 240 [2018-06-26 22:02:59,392 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2018-06-26 22:02:59,392 INFO ]: Start minimizeSevpa. Operand 240 states. [2018-06-26 22:02:59,410 INFO ]: Finished minimizeSevpa. Reduced states from 240 to 108. [2018-06-26 22:02:59,410 INFO ]: Start removeUnreachable. Operand 108 states. [2018-06-26 22:02:59,411 INFO ]: Finished removeUnreachable. Reduced from 108 states to 108 states and 532 transitions. [2018-06-26 22:02:59,411 INFO ]: Start accepts. Automaton has 108 states and 532 transitions. Word has length 20 [2018-06-26 22:02:59,412 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:02:59,412 INFO ]: Abstraction has 108 states and 532 transitions. [2018-06-26 22:02:59,412 INFO ]: Interpolant automaton has 7 states. [2018-06-26 22:02:59,412 INFO ]: Start isEmpty. Operand 108 states and 532 transitions. [2018-06-26 22:02:59,413 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-26 22:02:59,413 INFO ]: Found error trace [2018-06-26 22:02:59,413 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:02:59,413 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:59,413 INFO ]: Analyzing trace with hash 1495603871, now seen corresponding path program 1 times [2018-06-26 22:02:59,413 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:59,413 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:59,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:59,415 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:02:59,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:59,433 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:59,509 INFO ]: Checked inductivity of 153 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-06-26 22:02:59,509 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:02:59,509 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:02:59,509 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:02:59,509 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:02:59,509 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:02:59,509 INFO ]: Start difference. First operand 108 states and 532 transitions. Second operand 3 states. [2018-06-26 22:03:00,198 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:00,199 INFO ]: Finished difference Result 93 states and 384 transitions. [2018-06-26 22:03:00,200 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:03:00,200 INFO ]: Start accepts. Automaton has 3 states. Word has length 22 [2018-06-26 22:03:00,200 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:00,201 INFO ]: With dead ends: 93 [2018-06-26 22:03:00,201 INFO ]: Without dead ends: 93 [2018-06-26 22:03:00,201 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:03:00,201 INFO ]: Start minimizeSevpa. Operand 93 states. [2018-06-26 22:03:00,212 INFO ]: Finished minimizeSevpa. Reduced states from 93 to 75. [2018-06-26 22:03:00,212 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-26 22:03:00,213 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 311 transitions. [2018-06-26 22:03:00,213 INFO ]: Start accepts. Automaton has 75 states and 311 transitions. Word has length 22 [2018-06-26 22:03:00,213 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:00,213 INFO ]: Abstraction has 75 states and 311 transitions. [2018-06-26 22:03:00,213 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:03:00,213 INFO ]: Start isEmpty. Operand 75 states and 311 transitions. [2018-06-26 22:03:00,214 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-26 22:03:00,214 INFO ]: Found error trace [2018-06-26 22:03:00,215 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:00,215 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:00,215 INFO ]: Analyzing trace with hash 1434382898, now seen corresponding path program 1 times [2018-06-26 22:03:00,215 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:00,215 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:00,215 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:00,215 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:03:00,215 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:00,229 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:00,274 INFO ]: Checked inductivity of 171 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-06-26 22:03:00,274 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:03:00,274 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:03:00,274 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:03:00,275 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:03:00,275 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:03:00,275 INFO ]: Start difference. First operand 75 states and 311 transitions. Second operand 3 states. [2018-06-26 22:03:00,380 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:00,380 INFO ]: Finished difference Result 47 states and 104 transitions. [2018-06-26 22:03:00,380 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:03:00,380 INFO ]: Start accepts. Automaton has 3 states. Word has length 23 [2018-06-26 22:03:00,380 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:00,380 INFO ]: With dead ends: 47 [2018-06-26 22:03:00,380 INFO ]: Without dead ends: 38 [2018-06-26 22:03:00,381 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:03:00,381 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-26 22:03:00,383 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 35. [2018-06-26 22:03:00,383 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-26 22:03:00,383 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 86 transitions. [2018-06-26 22:03:00,383 INFO ]: Start accepts. Automaton has 35 states and 86 transitions. Word has length 23 [2018-06-26 22:03:00,383 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:00,383 INFO ]: Abstraction has 35 states and 86 transitions. [2018-06-26 22:03:00,383 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:03:00,383 INFO ]: Start isEmpty. Operand 35 states and 86 transitions. [2018-06-26 22:03:00,384 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-26 22:03:00,384 INFO ]: Found error trace [2018-06-26 22:03:00,384 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:00,384 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:00,384 INFO ]: Analyzing trace with hash -1124568317, now seen corresponding path program 1 times [2018-06-26 22:03:00,384 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:00,384 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:00,385 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:00,385 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:03:00,385 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:00,416 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:00,493 INFO ]: Checked inductivity of 190 backedges. 126 proven. 24 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-06-26 22:03:00,493 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:00,493 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-26 22:03:00,505 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:03:00,567 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:00,571 INFO ]: Computing forward predicates... [2018-06-26 22:03:00,592 INFO ]: Checked inductivity of 190 backedges. 126 proven. 24 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-06-26 22:03:00,613 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:00,614 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-26 22:03:00,615 INFO ]: Interpolant automaton has 6 states [2018-06-26 22:03:00,615 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 22:03:00,615 INFO ]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-26 22:03:00,615 INFO ]: Start difference. First operand 35 states and 86 transitions. Second operand 6 states. [2018-06-26 22:03:00,823 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:00,823 INFO ]: Finished difference Result 67 states and 159 transitions. [2018-06-26 22:03:00,823 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 22:03:00,823 INFO ]: Start accepts. Automaton has 6 states. Word has length 24 [2018-06-26 22:03:00,823 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:00,824 INFO ]: With dead ends: 67 [2018-06-26 22:03:00,824 INFO ]: Without dead ends: 45 [2018-06-26 22:03:00,824 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-26 22:03:00,824 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-26 22:03:00,826 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-06-26 22:03:00,826 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-26 22:03:00,826 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 100 transitions. [2018-06-26 22:03:00,828 INFO ]: Start accepts. Automaton has 41 states and 100 transitions. Word has length 24 [2018-06-26 22:03:00,828 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:00,828 INFO ]: Abstraction has 41 states and 100 transitions. [2018-06-26 22:03:00,828 INFO ]: Interpolant automaton has 6 states. [2018-06-26 22:03:00,828 INFO ]: Start isEmpty. Operand 41 states and 100 transitions. [2018-06-26 22:03:00,829 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-26 22:03:00,829 INFO ]: Found error trace [2018-06-26 22:03:00,829 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:00,829 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:00,829 INFO ]: Analyzing trace with hash 1826820670, now seen corresponding path program 1 times [2018-06-26 22:03:00,829 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:00,829 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:00,830 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:00,830 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:03:00,830 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:00,860 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:01,094 INFO ]: Checked inductivity of 325 backedges. 115 proven. 174 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 22:03:01,094 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:01,094 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-26 22:03:01,101 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:03:01,178 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:01,184 INFO ]: Computing forward predicates... [2018-06-26 22:03:01,348 INFO ]: Checked inductivity of 325 backedges. 125 proven. 165 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-06-26 22:03:01,380 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:01,380 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-06-26 22:03:01,380 INFO ]: Interpolant automaton has 12 states [2018-06-26 22:03:01,380 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 22:03:01,380 INFO ]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-06-26 22:03:01,380 INFO ]: Start difference. First operand 41 states and 100 transitions. Second operand 12 states. [2018-06-26 22:03:02,407 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:02,407 INFO ]: Finished difference Result 89 states and 218 transitions. [2018-06-26 22:03:02,407 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 22:03:02,407 INFO ]: Start accepts. Automaton has 12 states. Word has length 30 [2018-06-26 22:03:02,407 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:02,408 INFO ]: With dead ends: 89 [2018-06-26 22:03:02,408 INFO ]: Without dead ends: 89 [2018-06-26 22:03:02,408 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2018-06-26 22:03:02,408 INFO ]: Start minimizeSevpa. Operand 89 states. [2018-06-26 22:03:02,411 INFO ]: Finished minimizeSevpa. Reduced states from 89 to 49. [2018-06-26 22:03:02,411 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-26 22:03:02,412 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 119 transitions. [2018-06-26 22:03:02,413 INFO ]: Start accepts. Automaton has 49 states and 119 transitions. Word has length 30 [2018-06-26 22:03:02,413 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:02,413 INFO ]: Abstraction has 49 states and 119 transitions. [2018-06-26 22:03:02,413 INFO ]: Interpolant automaton has 12 states. [2018-06-26 22:03:02,413 INFO ]: Start isEmpty. Operand 49 states and 119 transitions. [2018-06-26 22:03:02,414 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-26 22:03:02,414 INFO ]: Found error trace [2018-06-26 22:03:02,414 INFO ]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:02,414 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:02,414 INFO ]: Analyzing trace with hash 1785981073, now seen corresponding path program 2 times [2018-06-26 22:03:02,414 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:02,414 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:02,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:02,415 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:03:02,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:02,447 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:02,744 INFO ]: Checked inductivity of 435 backedges. 272 proven. 90 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-06-26 22:03:02,744 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:02,744 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 22:03:02,758 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:03:02,860 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 22:03:02,861 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:02,867 INFO ]: Computing forward predicates... [2018-06-26 22:03:02,903 INFO ]: Checked inductivity of 435 backedges. 272 proven. 90 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-06-26 22:03:02,928 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:02,928 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-26 22:03:02,928 INFO ]: Interpolant automaton has 7 states [2018-06-26 22:03:02,928 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 22:03:02,928 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-26 22:03:02,928 INFO ]: Start difference. First operand 49 states and 119 transitions. Second operand 7 states. [2018-06-26 22:03:03,215 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:03,215 INFO ]: Finished difference Result 89 states and 209 transitions. [2018-06-26 22:03:03,216 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 22:03:03,216 INFO ]: Start accepts. Automaton has 7 states. Word has length 34 [2018-06-26 22:03:03,216 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:03,216 INFO ]: With dead ends: 89 [2018-06-26 22:03:03,216 INFO ]: Without dead ends: 59 [2018-06-26 22:03:03,217 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-26 22:03:03,217 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-26 22:03:03,219 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-06-26 22:03:03,219 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-26 22:03:03,219 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 133 transitions. [2018-06-26 22:03:03,219 INFO ]: Start accepts. Automaton has 55 states and 133 transitions. Word has length 34 [2018-06-26 22:03:03,219 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:03,220 INFO ]: Abstraction has 55 states and 133 transitions. [2018-06-26 22:03:03,220 INFO ]: Interpolant automaton has 7 states. [2018-06-26 22:03:03,220 INFO ]: Start isEmpty. Operand 55 states and 133 transitions. [2018-06-26 22:03:03,220 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-26 22:03:03,220 INFO ]: Found error trace [2018-06-26 22:03:03,220 INFO ]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:03,221 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:03,221 INFO ]: Analyzing trace with hash 429455884, now seen corresponding path program 3 times [2018-06-26 22:03:03,221 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:03,221 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:03,221 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:03,221 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:03:03,221 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:03,252 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:03,643 INFO ]: Checked inductivity of 630 backedges. 217 proven. 356 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-06-26 22:03:03,643 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:03,643 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-26 22:03:03,651 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 22:03:03,952 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-06-26 22:03:03,952 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:03,960 INFO ]: Computing forward predicates... [2018-06-26 22:03:04,140 INFO ]: Checked inductivity of 630 backedges. 233 proven. 341 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-26 22:03:04,161 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:04,161 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2018-06-26 22:03:04,161 INFO ]: Interpolant automaton has 15 states [2018-06-26 22:03:04,161 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 22:03:04,161 INFO ]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-06-26 22:03:04,161 INFO ]: Start difference. First operand 55 states and 133 transitions. Second operand 15 states. [2018-06-26 22:03:04,972 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:04,972 INFO ]: Finished difference Result 137 states and 331 transitions. [2018-06-26 22:03:04,972 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-26 22:03:04,972 INFO ]: Start accepts. Automaton has 15 states. Word has length 40 [2018-06-26 22:03:04,972 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:04,973 INFO ]: With dead ends: 137 [2018-06-26 22:03:04,973 INFO ]: Without dead ends: 137 [2018-06-26 22:03:04,973 INFO ]: 0 DeclaredPredicates, 87 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2018-06-26 22:03:04,973 INFO ]: Start minimizeSevpa. Operand 137 states. [2018-06-26 22:03:04,975 INFO ]: Finished minimizeSevpa. Reduced states from 137 to 63. [2018-06-26 22:03:04,975 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-26 22:03:04,976 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 152 transitions. [2018-06-26 22:03:04,976 INFO ]: Start accepts. Automaton has 63 states and 152 transitions. Word has length 40 [2018-06-26 22:03:04,976 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:04,976 INFO ]: Abstraction has 63 states and 152 transitions. [2018-06-26 22:03:04,976 INFO ]: Interpolant automaton has 15 states. [2018-06-26 22:03:04,977 INFO ]: Start isEmpty. Operand 63 states and 152 transitions. [2018-06-26 22:03:04,980 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-26 22:03:04,980 INFO ]: Found error trace [2018-06-26 22:03:04,980 INFO ]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:04,980 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:04,981 INFO ]: Analyzing trace with hash 1999976799, now seen corresponding path program 4 times [2018-06-26 22:03:04,981 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:04,981 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:04,981 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:04,981 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:03:04,981 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:05,016 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:05,701 INFO ]: Checked inductivity of 780 backedges. 470 proven. 204 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-06-26 22:03:05,701 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:05,701 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-26 22:03:05,725 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 22:03:05,868 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 22:03:05,868 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:05,876 INFO ]: Computing forward predicates... [2018-06-26 22:03:05,917 INFO ]: Checked inductivity of 780 backedges. 470 proven. 204 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-06-26 22:03:05,948 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:05,948 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-26 22:03:05,948 INFO ]: Interpolant automaton has 9 states [2018-06-26 22:03:05,948 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 22:03:05,948 INFO ]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-26 22:03:05,949 INFO ]: Start difference. First operand 63 states and 152 transitions. Second operand 9 states. [2018-06-26 22:03:06,280 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:06,280 INFO ]: Finished difference Result 111 states and 261 transitions. [2018-06-26 22:03:06,280 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 22:03:06,280 INFO ]: Start accepts. Automaton has 9 states. Word has length 44 [2018-06-26 22:03:06,281 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:06,281 INFO ]: With dead ends: 111 [2018-06-26 22:03:06,281 INFO ]: Without dead ends: 73 [2018-06-26 22:03:06,281 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-26 22:03:06,281 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-26 22:03:06,284 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-06-26 22:03:06,284 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-26 22:03:06,285 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 166 transitions. [2018-06-26 22:03:06,285 INFO ]: Start accepts. Automaton has 69 states and 166 transitions. Word has length 44 [2018-06-26 22:03:06,285 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:06,285 INFO ]: Abstraction has 69 states and 166 transitions. [2018-06-26 22:03:06,285 INFO ]: Interpolant automaton has 9 states. [2018-06-26 22:03:06,285 INFO ]: Start isEmpty. Operand 69 states and 166 transitions. [2018-06-26 22:03:06,286 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-26 22:03:06,286 INFO ]: Found error trace [2018-06-26 22:03:06,286 INFO ]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:06,286 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:06,286 INFO ]: Analyzing trace with hash -170201830, now seen corresponding path program 5 times [2018-06-26 22:03:06,286 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:06,286 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:06,286 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:06,286 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:03:06,286 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:06,323 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:06,829 INFO ]: Checked inductivity of 1035 backedges. 377 proven. 581 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-06-26 22:03:06,829 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:06,829 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:03:06,838 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 22:03:07,023 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2018-06-26 22:03:07,023 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:07,032 INFO ]: Computing forward predicates... [2018-06-26 22:03:07,148 INFO ]: Checked inductivity of 1035 backedges. 355 proven. 602 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-06-26 22:03:07,167 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:07,167 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2018-06-26 22:03:07,168 INFO ]: Interpolant automaton has 18 states [2018-06-26 22:03:07,168 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-26 22:03:07,168 INFO ]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-06-26 22:03:07,168 INFO ]: Start difference. First operand 69 states and 166 transitions. Second operand 18 states. [2018-06-26 22:03:08,048 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:08,048 INFO ]: Finished difference Result 197 states and 472 transitions. [2018-06-26 22:03:08,048 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-26 22:03:08,048 INFO ]: Start accepts. Automaton has 18 states. Word has length 50 [2018-06-26 22:03:08,048 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:08,049 INFO ]: With dead ends: 197 [2018-06-26 22:03:08,049 INFO ]: Without dead ends: 197 [2018-06-26 22:03:08,050 INFO ]: 0 DeclaredPredicates, 110 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=276, Invalid=846, Unknown=0, NotChecked=0, Total=1122 [2018-06-26 22:03:08,050 INFO ]: Start minimizeSevpa. Operand 197 states. [2018-06-26 22:03:08,055 INFO ]: Finished minimizeSevpa. Reduced states from 197 to 77. [2018-06-26 22:03:08,055 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-26 22:03:08,056 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 185 transitions. [2018-06-26 22:03:08,056 INFO ]: Start accepts. Automaton has 77 states and 185 transitions. Word has length 50 [2018-06-26 22:03:08,057 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:08,057 INFO ]: Abstraction has 77 states and 185 transitions. [2018-06-26 22:03:08,057 INFO ]: Interpolant automaton has 18 states. [2018-06-26 22:03:08,057 INFO ]: Start isEmpty. Operand 77 states and 185 transitions. [2018-06-26 22:03:08,059 INFO ]: Finished isEmpty. Found accepting run of length 55 [2018-06-26 22:03:08,059 INFO ]: Found error trace [2018-06-26 22:03:08,059 INFO ]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:08,059 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:08,059 INFO ]: Analyzing trace with hash -1408567955, now seen corresponding path program 6 times [2018-06-26 22:03:08,059 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:08,059 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:08,060 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:08,060 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:03:08,060 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:08,100 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:08,289 INFO ]: Checked inductivity of 1225 backedges. 720 proven. 366 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2018-06-26 22:03:08,289 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:08,289 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-26 22:03:08,309 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 22:03:08,485 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2018-06-26 22:03:08,485 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:08,492 INFO ]: Computing forward predicates... [2018-06-26 22:03:08,520 INFO ]: Checked inductivity of 1225 backedges. 720 proven. 366 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2018-06-26 22:03:08,540 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:08,540 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-26 22:03:08,540 INFO ]: Interpolant automaton has 10 states [2018-06-26 22:03:08,540 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 22:03:08,540 INFO ]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-26 22:03:08,541 INFO ]: Start difference. First operand 77 states and 185 transitions. Second operand 10 states. [2018-06-26 22:03:08,794 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:08,794 INFO ]: Finished difference Result 133 states and 311 transitions. [2018-06-26 22:03:08,795 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 22:03:08,795 INFO ]: Start accepts. Automaton has 10 states. Word has length 54 [2018-06-26 22:03:08,795 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:08,796 INFO ]: With dead ends: 133 [2018-06-26 22:03:08,796 INFO ]: Without dead ends: 87 [2018-06-26 22:03:08,796 INFO ]: 0 DeclaredPredicates, 103 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-26 22:03:08,796 INFO ]: Start minimizeSevpa. Operand 87 states. [2018-06-26 22:03:08,799 INFO ]: Finished minimizeSevpa. Reduced states from 87 to 83. [2018-06-26 22:03:08,799 INFO ]: Start removeUnreachable. Operand 83 states. [2018-06-26 22:03:08,799 INFO ]: Finished removeUnreachable. Reduced from 83 states to 83 states and 199 transitions. [2018-06-26 22:03:08,799 INFO ]: Start accepts. Automaton has 83 states and 199 transitions. Word has length 54 [2018-06-26 22:03:08,800 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:08,800 INFO ]: Abstraction has 83 states and 199 transitions. [2018-06-26 22:03:08,800 INFO ]: Interpolant automaton has 10 states. [2018-06-26 22:03:08,800 INFO ]: Start isEmpty. Operand 83 states and 199 transitions. [2018-06-26 22:03:08,800 INFO ]: Finished isEmpty. Found accepting run of length 61 [2018-06-26 22:03:08,800 INFO ]: Found error trace [2018-06-26 22:03:08,800 INFO ]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:08,800 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:08,801 INFO ]: Analyzing trace with hash -1938064536, now seen corresponding path program 7 times [2018-06-26 22:03:08,801 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:08,801 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:08,802 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:08,802 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:03:08,802 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:08,844 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:09,083 INFO ]: Checked inductivity of 1540 backedges. 529 proven. 912 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-06-26 22:03:09,083 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:09,083 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:03:09,088 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:03:09,240 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:09,248 INFO ]: Computing forward predicates... [2018-06-26 22:03:09,538 INFO ]: Checked inductivity of 1540 backedges. 557 proven. 885 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-06-26 22:03:09,571 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:09,571 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2018-06-26 22:03:09,572 INFO ]: Interpolant automaton has 21 states [2018-06-26 22:03:09,572 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-26 22:03:09,572 INFO ]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2018-06-26 22:03:09,572 INFO ]: Start difference. First operand 83 states and 199 transitions. Second operand 21 states. [2018-06-26 22:03:10,585 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:10,585 INFO ]: Finished difference Result 269 states and 641 transitions. [2018-06-26 22:03:10,585 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-26 22:03:10,585 INFO ]: Start accepts. Automaton has 21 states. Word has length 60 [2018-06-26 22:03:10,585 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:10,586 INFO ]: With dead ends: 269 [2018-06-26 22:03:10,586 INFO ]: Without dead ends: 269 [2018-06-26 22:03:10,587 INFO ]: 0 DeclaredPredicates, 133 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=375, Invalid=1185, Unknown=0, NotChecked=0, Total=1560 [2018-06-26 22:03:10,587 INFO ]: Start minimizeSevpa. Operand 269 states. [2018-06-26 22:03:10,591 INFO ]: Finished minimizeSevpa. Reduced states from 269 to 91. [2018-06-26 22:03:10,591 INFO ]: Start removeUnreachable. Operand 91 states. [2018-06-26 22:03:10,591 INFO ]: Finished removeUnreachable. Reduced from 91 states to 91 states and 218 transitions. [2018-06-26 22:03:10,591 INFO ]: Start accepts. Automaton has 91 states and 218 transitions. Word has length 60 [2018-06-26 22:03:10,592 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:10,592 INFO ]: Abstraction has 91 states and 218 transitions. [2018-06-26 22:03:10,592 INFO ]: Interpolant automaton has 21 states. [2018-06-26 22:03:10,592 INFO ]: Start isEmpty. Operand 91 states and 218 transitions. [2018-06-26 22:03:10,592 INFO ]: Finished isEmpty. Found accepting run of length 65 [2018-06-26 22:03:10,592 INFO ]: Found error trace [2018-06-26 22:03:10,592 INFO ]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:10,592 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:10,593 INFO ]: Analyzing trace with hash -939545413, now seen corresponding path program 8 times [2018-06-26 22:03:10,593 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:10,593 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:10,593 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:10,593 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:03:10,593 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:10,633 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:10,793 INFO ]: Checked inductivity of 1770 backedges. 1022 proven. 576 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-06-26 22:03:10,793 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:10,793 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-26 22:03:10,803 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 22:03:10,997 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 22:03:10,997 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:11,007 INFO ]: Computing forward predicates... [2018-06-26 22:03:11,035 INFO ]: Checked inductivity of 1770 backedges. 1022 proven. 576 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-06-26 22:03:11,063 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:11,064 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-26 22:03:11,064 INFO ]: Interpolant automaton has 12 states [2018-06-26 22:03:11,064 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 22:03:11,064 INFO ]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-26 22:03:11,064 INFO ]: Start difference. First operand 91 states and 218 transitions. Second operand 12 states. [2018-06-26 22:03:11,476 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:11,476 INFO ]: Finished difference Result 155 states and 363 transitions. [2018-06-26 22:03:11,477 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 22:03:11,477 INFO ]: Start accepts. Automaton has 12 states. Word has length 64 [2018-06-26 22:03:11,478 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:11,478 INFO ]: With dead ends: 155 [2018-06-26 22:03:11,478 INFO ]: Without dead ends: 101 [2018-06-26 22:03:11,478 INFO ]: 0 DeclaredPredicates, 123 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-26 22:03:11,478 INFO ]: Start minimizeSevpa. Operand 101 states. [2018-06-26 22:03:11,482 INFO ]: Finished minimizeSevpa. Reduced states from 101 to 97. [2018-06-26 22:03:11,482 INFO ]: Start removeUnreachable. Operand 97 states. [2018-06-26 22:03:11,482 INFO ]: Finished removeUnreachable. Reduced from 97 states to 97 states and 232 transitions. [2018-06-26 22:03:11,482 INFO ]: Start accepts. Automaton has 97 states and 232 transitions. Word has length 64 [2018-06-26 22:03:11,483 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:11,483 INFO ]: Abstraction has 97 states and 232 transitions. [2018-06-26 22:03:11,483 INFO ]: Interpolant automaton has 12 states. [2018-06-26 22:03:11,483 INFO ]: Start isEmpty. Operand 97 states and 232 transitions. [2018-06-26 22:03:11,483 INFO ]: Finished isEmpty. Found accepting run of length 71 [2018-06-26 22:03:11,483 INFO ]: Found error trace [2018-06-26 22:03:11,483 INFO ]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:11,483 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:11,484 INFO ]: Analyzing trace with hash -1450625802, now seen corresponding path program 9 times [2018-06-26 22:03:11,484 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:11,484 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:11,484 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:11,484 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:03:11,484 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:11,532 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:11,961 INFO ]: Checked inductivity of 2145 backedges. 739 proven. 1286 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-06-26 22:03:11,961 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:11,961 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-26 22:03:11,967 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 22:03:12,291 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-06-26 22:03:12,291 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:12,304 INFO ]: Computing forward predicates... [2018-06-26 22:03:12,526 INFO ]: Checked inductivity of 2145 backedges. 773 proven. 1253 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-06-26 22:03:12,547 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:12,547 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2018-06-26 22:03:12,548 INFO ]: Interpolant automaton has 24 states [2018-06-26 22:03:12,548 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-26 22:03:12,548 INFO ]: CoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2018-06-26 22:03:12,548 INFO ]: Start difference. First operand 97 states and 232 transitions. Second operand 24 states. [2018-06-26 22:03:13,514 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:13,514 INFO ]: Finished difference Result 353 states and 838 transitions. [2018-06-26 22:03:13,514 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-26 22:03:13,514 INFO ]: Start accepts. Automaton has 24 states. Word has length 70 [2018-06-26 22:03:13,514 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:13,515 INFO ]: With dead ends: 353 [2018-06-26 22:03:13,515 INFO ]: Without dead ends: 353 [2018-06-26 22:03:13,516 INFO ]: 0 DeclaredPredicates, 156 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=489, Invalid=1581, Unknown=0, NotChecked=0, Total=2070 [2018-06-26 22:03:13,516 INFO ]: Start minimizeSevpa. Operand 353 states. [2018-06-26 22:03:13,521 INFO ]: Finished minimizeSevpa. Reduced states from 353 to 105. [2018-06-26 22:03:13,521 INFO ]: Start removeUnreachable. Operand 105 states. [2018-06-26 22:03:13,521 INFO ]: Finished removeUnreachable. Reduced from 105 states to 105 states and 251 transitions. [2018-06-26 22:03:13,521 INFO ]: Start accepts. Automaton has 105 states and 251 transitions. Word has length 70 [2018-06-26 22:03:13,522 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:13,522 INFO ]: Abstraction has 105 states and 251 transitions. [2018-06-26 22:03:13,522 INFO ]: Interpolant automaton has 24 states. [2018-06-26 22:03:13,522 INFO ]: Start isEmpty. Operand 105 states and 251 transitions. [2018-06-26 22:03:13,522 INFO ]: Finished isEmpty. Found accepting run of length 75 [2018-06-26 22:03:13,522 INFO ]: Found error trace [2018-06-26 22:03:13,523 INFO ]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:13,523 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:13,524 INFO ]: Analyzing trace with hash -849744055, now seen corresponding path program 10 times [2018-06-26 22:03:13,524 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:13,524 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:13,524 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:13,524 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:03:13,524 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:13,564 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:13,849 INFO ]: Checked inductivity of 2415 backedges. 1376 proven. 834 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2018-06-26 22:03:13,849 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:13,849 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) [2018-06-26 22:03:13,867 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:03:14,048 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 22:03:14,048 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:14,058 INFO ]: Computing forward predicates... [2018-06-26 22:03:14,089 INFO ]: Checked inductivity of 2415 backedges. 1376 proven. 834 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2018-06-26 22:03:14,122 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:14,122 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-26 22:03:14,122 INFO ]: Interpolant automaton has 13 states [2018-06-26 22:03:14,122 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 22:03:14,122 INFO ]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-26 22:03:14,122 INFO ]: Start difference. First operand 105 states and 251 transitions. Second operand 13 states. [2018-06-26 22:03:14,618 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:14,618 INFO ]: Finished difference Result 177 states and 413 transitions. [2018-06-26 22:03:14,618 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 22:03:14,618 INFO ]: Start accepts. Automaton has 13 states. Word has length 74 [2018-06-26 22:03:14,619 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:14,619 INFO ]: With dead ends: 177 [2018-06-26 22:03:14,619 INFO ]: Without dead ends: 115 [2018-06-26 22:03:14,619 INFO ]: 0 DeclaredPredicates, 143 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-26 22:03:14,619 INFO ]: Start minimizeSevpa. Operand 115 states. [2018-06-26 22:03:14,622 INFO ]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-06-26 22:03:14,622 INFO ]: Start removeUnreachable. Operand 111 states. [2018-06-26 22:03:14,623 INFO ]: Finished removeUnreachable. Reduced from 111 states to 111 states and 265 transitions. [2018-06-26 22:03:14,623 INFO ]: Start accepts. Automaton has 111 states and 265 transitions. Word has length 74 [2018-06-26 22:03:14,623 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:14,623 INFO ]: Abstraction has 111 states and 265 transitions. [2018-06-26 22:03:14,623 INFO ]: Interpolant automaton has 13 states. [2018-06-26 22:03:14,623 INFO ]: Start isEmpty. Operand 111 states and 265 transitions. [2018-06-26 22:03:14,624 INFO ]: Finished isEmpty. Found accepting run of length 81 [2018-06-26 22:03:14,624 INFO ]: Found error trace [2018-06-26 22:03:14,624 INFO ]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:14,624 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:14,624 INFO ]: Analyzing trace with hash -414275132, now seen corresponding path program 11 times [2018-06-26 22:03:14,624 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:14,624 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:14,625 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:14,625 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:03:14,625 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:14,679 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:15,132 INFO ]: Checked inductivity of 2850 backedges. 985 proven. 1724 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-06-26 22:03:15,183 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:15,183 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-26 22:03:15,188 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 22:03:15,549 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2018-06-26 22:03:15,549 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:15,570 INFO ]: Computing forward predicates... [2018-06-26 22:03:15,619 INFO ]: Checked inductivity of 2850 backedges. 985 proven. 1724 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-06-26 22:03:15,655 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:15,655 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-06-26 22:03:15,656 INFO ]: Interpolant automaton has 19 states [2018-06-26 22:03:15,656 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-26 22:03:15,656 INFO ]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-06-26 22:03:15,656 INFO ]: Start difference. First operand 111 states and 265 transitions. Second operand 19 states. [2018-06-26 22:03:17,255 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:17,255 INFO ]: Finished difference Result 705 states and 1678 transitions. [2018-06-26 22:03:17,255 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-26 22:03:17,255 INFO ]: Start accepts. Automaton has 19 states. Word has length 80 [2018-06-26 22:03:17,255 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:17,258 INFO ]: With dead ends: 705 [2018-06-26 22:03:17,258 INFO ]: Without dead ends: 705 [2018-06-26 22:03:17,259 INFO ]: 0 DeclaredPredicates, 170 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=339, Invalid=851, Unknown=0, NotChecked=0, Total=1190 [2018-06-26 22:03:17,259 INFO ]: Start minimizeSevpa. Operand 705 states. [2018-06-26 22:03:17,270 INFO ]: Finished minimizeSevpa. Reduced states from 705 to 293. [2018-06-26 22:03:17,270 INFO ]: Start removeUnreachable. Operand 293 states. [2018-06-26 22:03:17,271 INFO ]: Finished removeUnreachable. Reduced from 293 states to 293 states and 722 transitions. [2018-06-26 22:03:17,271 INFO ]: Start accepts. Automaton has 293 states and 722 transitions. Word has length 80 [2018-06-26 22:03:17,272 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:17,272 INFO ]: Abstraction has 293 states and 722 transitions. [2018-06-26 22:03:17,272 INFO ]: Interpolant automaton has 19 states. [2018-06-26 22:03:17,272 INFO ]: Start isEmpty. Operand 293 states and 722 transitions. [2018-06-26 22:03:17,273 INFO ]: Finished isEmpty. Found accepting run of length 81 [2018-06-26 22:03:17,273 INFO ]: Found error trace [2018-06-26 22:03:17,273 INFO ]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:17,273 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:17,273 INFO ]: Analyzing trace with hash 1423073169, now seen corresponding path program 1 times [2018-06-26 22:03:17,273 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:17,273 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:17,274 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:17,274 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:03:17,274 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:17,324 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:17,602 INFO ]: Checked inductivity of 2850 backedges. 1025 proven. 1685 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-06-26 22:03:17,602 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:17,602 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-26 22:03:17,608 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:03:17,826 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:17,840 INFO ]: Computing forward predicates... [2018-06-26 22:03:17,886 INFO ]: Checked inductivity of 2850 backedges. 1025 proven. 1685 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-06-26 22:03:17,918 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:17,919 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-06-26 22:03:17,919 INFO ]: Interpolant automaton has 19 states [2018-06-26 22:03:17,919 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-26 22:03:17,919 INFO ]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-06-26 22:03:17,919 INFO ]: Start difference. First operand 293 states and 722 transitions. Second operand 19 states. [2018-06-26 22:03:19,364 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:19,364 INFO ]: Finished difference Result 889 states and 2122 transitions. [2018-06-26 22:03:19,365 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-26 22:03:19,365 INFO ]: Start accepts. Automaton has 19 states. Word has length 80 [2018-06-26 22:03:19,365 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:19,369 INFO ]: With dead ends: 889 [2018-06-26 22:03:19,369 INFO ]: Without dead ends: 889 [2018-06-26 22:03:19,369 INFO ]: 0 DeclaredPredicates, 171 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=386, Invalid=874, Unknown=0, NotChecked=0, Total=1260 [2018-06-26 22:03:19,370 INFO ]: Start minimizeSevpa. Operand 889 states. [2018-06-26 22:03:19,378 INFO ]: Finished minimizeSevpa. Reduced states from 889 to 119. [2018-06-26 22:03:19,378 INFO ]: Start removeUnreachable. Operand 119 states. [2018-06-26 22:03:19,379 INFO ]: Finished removeUnreachable. Reduced from 119 states to 119 states and 284 transitions. [2018-06-26 22:03:19,379 INFO ]: Start accepts. Automaton has 119 states and 284 transitions. Word has length 80 [2018-06-26 22:03:19,379 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:19,379 INFO ]: Abstraction has 119 states and 284 transitions. [2018-06-26 22:03:19,379 INFO ]: Interpolant automaton has 19 states. [2018-06-26 22:03:19,379 INFO ]: Start isEmpty. Operand 119 states and 284 transitions. [2018-06-26 22:03:19,380 INFO ]: Finished isEmpty. Found accepting run of length 85 [2018-06-26 22:03:19,380 INFO ]: Found error trace [2018-06-26 22:03:19,380 INFO ]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:19,380 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:19,380 INFO ]: Analyzing trace with hash 245124375, now seen corresponding path program 12 times [2018-06-26 22:03:19,380 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:19,380 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:19,381 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:19,381 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:03:19,381 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:19,435 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:20,119 INFO ]: Checked inductivity of 3160 backedges. 1782 proven. 1140 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2018-06-26 22:03:20,119 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:20,119 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-26 22:03:20,124 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 22:03:20,500 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 41 check-sat command(s) [2018-06-26 22:03:20,500 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:20,513 INFO ]: Computing forward predicates... [2018-06-26 22:03:20,551 INFO ]: Checked inductivity of 3160 backedges. 1782 proven. 1140 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2018-06-26 22:03:20,583 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:20,583 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-26 22:03:20,583 INFO ]: Interpolant automaton has 15 states [2018-06-26 22:03:20,584 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 22:03:20,584 INFO ]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-06-26 22:03:20,584 INFO ]: Start difference. First operand 119 states and 284 transitions. Second operand 15 states. [2018-06-26 22:03:20,948 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:20,948 INFO ]: Finished difference Result 199 states and 465 transitions. [2018-06-26 22:03:20,948 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 22:03:20,948 INFO ]: Start accepts. Automaton has 15 states. Word has length 84 [2018-06-26 22:03:20,948 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:20,949 INFO ]: With dead ends: 199 [2018-06-26 22:03:20,949 INFO ]: Without dead ends: 129 [2018-06-26 22:03:20,949 INFO ]: 0 DeclaredPredicates, 163 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-06-26 22:03:20,949 INFO ]: Start minimizeSevpa. Operand 129 states. [2018-06-26 22:03:20,957 INFO ]: Finished minimizeSevpa. Reduced states from 129 to 125. [2018-06-26 22:03:20,957 INFO ]: Start removeUnreachable. Operand 125 states. [2018-06-26 22:03:20,957 INFO ]: Finished removeUnreachable. Reduced from 125 states to 125 states and 298 transitions. [2018-06-26 22:03:20,957 INFO ]: Start accepts. Automaton has 125 states and 298 transitions. Word has length 84 [2018-06-26 22:03:20,958 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:20,958 INFO ]: Abstraction has 125 states and 298 transitions. [2018-06-26 22:03:20,958 INFO ]: Interpolant automaton has 15 states. [2018-06-26 22:03:20,958 INFO ]: Start isEmpty. Operand 125 states and 298 transitions. [2018-06-26 22:03:20,959 INFO ]: Finished isEmpty. Found accepting run of length 91 [2018-06-26 22:03:20,959 INFO ]: Found error trace [2018-06-26 22:03:20,959 INFO ]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:20,959 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:20,959 INFO ]: Analyzing trace with hash -78485038, now seen corresponding path program 13 times [2018-06-26 22:03:20,959 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:20,959 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:20,959 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:20,959 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:03:20,959 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:21,014 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:22,089 INFO ]: Checked inductivity of 3655 backedges. 1267 proven. 2226 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-06-26 22:03:22,089 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:22,089 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-26 22:03:22,094 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:03:22,341 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:22,363 INFO ]: Computing forward predicates... [2018-06-26 22:03:22,767 INFO ]: Checked inductivity of 3655 backedges. 1313 proven. 2181 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-06-26 22:03:22,801 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:22,801 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 30 [2018-06-26 22:03:22,801 INFO ]: Interpolant automaton has 30 states [2018-06-26 22:03:22,801 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-26 22:03:22,802 INFO ]: CoverageRelationStatistics Valid=165, Invalid=705, Unknown=0, NotChecked=0, Total=870 [2018-06-26 22:03:22,802 INFO ]: Start difference. First operand 125 states and 298 transitions. Second operand 30 states. [2018-06-26 22:03:24,360 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:24,360 INFO ]: Finished difference Result 557 states and 1316 transitions. [2018-06-26 22:03:24,364 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-26 22:03:24,364 INFO ]: Start accepts. Automaton has 30 states. Word has length 90 [2018-06-26 22:03:24,364 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:24,366 INFO ]: With dead ends: 557 [2018-06-26 22:03:24,366 INFO ]: Without dead ends: 557 [2018-06-26 22:03:24,367 INFO ]: 0 DeclaredPredicates, 202 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=762, Invalid=2544, Unknown=0, NotChecked=0, Total=3306 [2018-06-26 22:03:24,367 INFO ]: Start minimizeSevpa. Operand 557 states. [2018-06-26 22:03:24,373 INFO ]: Finished minimizeSevpa. Reduced states from 557 to 133. [2018-06-26 22:03:24,373 INFO ]: Start removeUnreachable. Operand 133 states. [2018-06-26 22:03:24,373 INFO ]: Finished removeUnreachable. Reduced from 133 states to 133 states and 317 transitions. [2018-06-26 22:03:24,373 INFO ]: Start accepts. Automaton has 133 states and 317 transitions. Word has length 90 [2018-06-26 22:03:24,374 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:24,374 INFO ]: Abstraction has 133 states and 317 transitions. [2018-06-26 22:03:24,374 INFO ]: Interpolant automaton has 30 states. [2018-06-26 22:03:24,374 INFO ]: Start isEmpty. Operand 133 states and 317 transitions. [2018-06-26 22:03:24,374 INFO ]: Finished isEmpty. Found accepting run of length 95 [2018-06-26 22:03:24,374 INFO ]: Found error trace [2018-06-26 22:03:24,374 INFO ]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:24,375 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:24,375 INFO ]: Analyzing trace with hash -75147739, now seen corresponding path program 14 times [2018-06-26 22:03:24,375 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:24,375 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:24,376 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:24,376 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:03:24,376 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:24,429 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:24,886 INFO ]: Checked inductivity of 4005 backedges. 2240 proven. 1494 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2018-06-26 22:03:24,886 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:24,886 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-26 22:03:24,891 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 22:03:25,215 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 22:03:25,216 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:25,243 INFO ]: Computing forward predicates... [2018-06-26 22:03:25,282 INFO ]: Checked inductivity of 4005 backedges. 2240 proven. 1494 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2018-06-26 22:03:25,317 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:25,317 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-06-26 22:03:25,317 INFO ]: Interpolant automaton has 16 states [2018-06-26 22:03:25,317 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 22:03:25,318 INFO ]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-06-26 22:03:25,318 INFO ]: Start difference. First operand 133 states and 317 transitions. Second operand 16 states. [2018-06-26 22:03:25,788 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:25,788 INFO ]: Finished difference Result 221 states and 515 transitions. [2018-06-26 22:03:25,789 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 22:03:25,789 INFO ]: Start accepts. Automaton has 16 states. Word has length 94 [2018-06-26 22:03:25,789 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:25,790 INFO ]: With dead ends: 221 [2018-06-26 22:03:25,790 INFO ]: Without dead ends: 143 [2018-06-26 22:03:25,790 INFO ]: 0 DeclaredPredicates, 183 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-06-26 22:03:25,790 INFO ]: Start minimizeSevpa. Operand 143 states. [2018-06-26 22:03:25,794 INFO ]: Finished minimizeSevpa. Reduced states from 143 to 139. [2018-06-26 22:03:25,794 INFO ]: Start removeUnreachable. Operand 139 states. [2018-06-26 22:03:25,794 INFO ]: Finished removeUnreachable. Reduced from 139 states to 139 states and 331 transitions. [2018-06-26 22:03:25,794 INFO ]: Start accepts. Automaton has 139 states and 331 transitions. Word has length 94 [2018-06-26 22:03:25,795 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:25,795 INFO ]: Abstraction has 139 states and 331 transitions. [2018-06-26 22:03:25,795 INFO ]: Interpolant automaton has 16 states. [2018-06-26 22:03:25,795 INFO ]: Start isEmpty. Operand 139 states and 331 transitions. [2018-06-26 22:03:25,796 INFO ]: Finished isEmpty. Found accepting run of length 101 [2018-06-26 22:03:25,796 INFO ]: Found error trace [2018-06-26 22:03:25,796 INFO ]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:25,796 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:25,796 INFO ]: Analyzing trace with hash -1017707232, now seen corresponding path program 15 times [2018-06-26 22:03:25,796 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:25,796 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:25,796 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:25,796 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:03:25,796 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:25,863 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:26,608 INFO ]: Checked inductivity of 4560 backedges. 1637 proven. 2741 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-06-26 22:03:26,608 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:26,608 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:03:26,614 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 22:03:27,137 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-06-26 22:03:27,137 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:27,161 INFO ]: Computing forward predicates... [2018-06-26 22:03:27,218 INFO ]: Checked inductivity of 4560 backedges. 1637 proven. 2741 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-06-26 22:03:27,254 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:27,254 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-06-26 22:03:27,254 INFO ]: Interpolant automaton has 23 states [2018-06-26 22:03:27,255 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-26 22:03:27,255 INFO ]: CoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2018-06-26 22:03:27,255 INFO ]: Start difference. First operand 139 states and 331 transitions. Second operand 23 states. [2018-06-26 22:03:28,752 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:28,752 INFO ]: Finished difference Result 389 states and 917 transitions. [2018-06-26 22:03:28,752 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-26 22:03:28,752 INFO ]: Start accepts. Automaton has 23 states. Word has length 100 [2018-06-26 22:03:28,752 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:28,753 INFO ]: With dead ends: 389 [2018-06-26 22:03:28,753 INFO ]: Without dead ends: 389 [2018-06-26 22:03:28,754 INFO ]: 0 DeclaredPredicates, 215 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=571, Invalid=1321, Unknown=0, NotChecked=0, Total=1892 [2018-06-26 22:03:28,754 INFO ]: Start minimizeSevpa. Operand 389 states. [2018-06-26 22:03:28,760 INFO ]: Finished minimizeSevpa. Reduced states from 389 to 147. [2018-06-26 22:03:28,760 INFO ]: Start removeUnreachable. Operand 147 states. [2018-06-26 22:03:28,761 INFO ]: Finished removeUnreachable. Reduced from 147 states to 147 states and 350 transitions. [2018-06-26 22:03:28,761 INFO ]: Start accepts. Automaton has 147 states and 350 transitions. Word has length 100 [2018-06-26 22:03:28,761 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:28,761 INFO ]: Abstraction has 147 states and 350 transitions. [2018-06-26 22:03:28,761 INFO ]: Interpolant automaton has 23 states. [2018-06-26 22:03:28,761 INFO ]: Start isEmpty. Operand 147 states and 350 transitions. [2018-06-26 22:03:28,762 INFO ]: Finished isEmpty. Found accepting run of length 105 [2018-06-26 22:03:28,762 INFO ]: Found error trace [2018-06-26 22:03:28,762 INFO ]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:28,762 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:28,762 INFO ]: Analyzing trace with hash -1374709133, now seen corresponding path program 16 times [2018-06-26 22:03:28,762 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:28,763 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:28,764 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:28,764 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:03:28,764 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:28,827 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:29,092 INFO ]: Checked inductivity of 4950 backedges. 2750 proven. 1896 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2018-06-26 22:03:29,093 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:29,093 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-26 22:03:29,099 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 22:03:29,366 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 22:03:29,367 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:29,389 INFO ]: Computing forward predicates... [2018-06-26 22:03:29,433 INFO ]: Checked inductivity of 4950 backedges. 2750 proven. 1896 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2018-06-26 22:03:29,468 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:29,468 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-06-26 22:03:29,469 INFO ]: Interpolant automaton has 18 states [2018-06-26 22:03:29,469 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-26 22:03:29,469 INFO ]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-06-26 22:03:29,469 INFO ]: Start difference. First operand 147 states and 350 transitions. Second operand 18 states. [2018-06-26 22:03:30,800 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:30,800 INFO ]: Finished difference Result 243 states and 567 transitions. [2018-06-26 22:03:30,801 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-26 22:03:30,801 INFO ]: Start accepts. Automaton has 18 states. Word has length 104 [2018-06-26 22:03:30,801 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:30,802 INFO ]: With dead ends: 243 [2018-06-26 22:03:30,802 INFO ]: Without dead ends: 157 [2018-06-26 22:03:30,802 INFO ]: 0 DeclaredPredicates, 203 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-06-26 22:03:30,802 INFO ]: Start minimizeSevpa. Operand 157 states. [2018-06-26 22:03:30,806 INFO ]: Finished minimizeSevpa. Reduced states from 157 to 153. [2018-06-26 22:03:30,806 INFO ]: Start removeUnreachable. Operand 153 states. [2018-06-26 22:03:30,806 INFO ]: Finished removeUnreachable. Reduced from 153 states to 153 states and 364 transitions. [2018-06-26 22:03:30,806 INFO ]: Start accepts. Automaton has 153 states and 364 transitions. Word has length 104 [2018-06-26 22:03:30,806 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:30,806 INFO ]: Abstraction has 153 states and 364 transitions. [2018-06-26 22:03:30,807 INFO ]: Interpolant automaton has 18 states. [2018-06-26 22:03:30,807 INFO ]: Start isEmpty. Operand 153 states and 364 transitions. [2018-06-26 22:03:30,807 INFO ]: Finished isEmpty. Found accepting run of length 111 [2018-06-26 22:03:30,807 INFO ]: Found error trace [2018-06-26 22:03:30,807 INFO ]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:30,807 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:30,808 INFO ]: Analyzing trace with hash 307956654, now seen corresponding path program 17 times [2018-06-26 22:03:30,808 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:30,808 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:30,808 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:30,808 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:03:30,808 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:30,883 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:31,296 INFO ]: Checked inductivity of 5565 backedges. 1939 proven. 3422 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-06-26 22:03:31,296 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:31,296 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-26 22:03:31,302 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 22:03:31,938 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 53 check-sat command(s) [2018-06-26 22:03:31,938 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:31,961 INFO ]: Computing forward predicates... [2018-06-26 22:03:32,022 INFO ]: Checked inductivity of 5565 backedges. 1939 proven. 3422 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-06-26 22:03:32,057 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:32,058 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-06-26 22:03:32,058 INFO ]: Interpolant automaton has 25 states [2018-06-26 22:03:32,058 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-26 22:03:32,058 INFO ]: CoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2018-06-26 22:03:32,058 INFO ]: Start difference. First operand 153 states and 364 transitions. Second operand 25 states. [2018-06-26 22:03:36,766 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:36,766 INFO ]: Finished difference Result 1299 states and 3085 transitions. [2018-06-26 22:03:36,766 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-26 22:03:36,766 INFO ]: Start accepts. Automaton has 25 states. Word has length 110 [2018-06-26 22:03:36,766 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:36,770 INFO ]: With dead ends: 1299 [2018-06-26 22:03:36,770 INFO ]: Without dead ends: 1299 [2018-06-26 22:03:36,771 INFO ]: 0 DeclaredPredicates, 236 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=597, Invalid=1565, Unknown=0, NotChecked=0, Total=2162 [2018-06-26 22:03:36,771 INFO ]: Start minimizeSevpa. Operand 1299 states. [2018-06-26 22:03:36,787 INFO ]: Finished minimizeSevpa. Reduced states from 1299 to 497. [2018-06-26 22:03:36,787 INFO ]: Start removeUnreachable. Operand 497 states. [2018-06-26 22:03:36,788 INFO ]: Finished removeUnreachable. Reduced from 497 states to 497 states and 1214 transitions. [2018-06-26 22:03:36,789 INFO ]: Start accepts. Automaton has 497 states and 1214 transitions. Word has length 110 [2018-06-26 22:03:36,789 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:36,789 INFO ]: Abstraction has 497 states and 1214 transitions. [2018-06-26 22:03:36,789 INFO ]: Interpolant automaton has 25 states. [2018-06-26 22:03:36,789 INFO ]: Start isEmpty. Operand 497 states and 1214 transitions. [2018-06-26 22:03:36,791 INFO ]: Finished isEmpty. Found accepting run of length 111 [2018-06-26 22:03:36,791 INFO ]: Found error trace [2018-06-26 22:03:36,791 INFO ]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:36,791 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:36,791 INFO ]: Analyzing trace with hash -1935909701, now seen corresponding path program 2 times [2018-06-26 22:03:36,791 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:36,791 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:36,792 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:36,792 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:03:36,792 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:36,859 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:37,230 INFO ]: Checked inductivity of 5565 backedges. 1997 proven. 3365 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-06-26 22:03:37,230 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:37,230 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-26 22:03:37,235 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 22:03:37,525 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 22:03:37,525 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:37,546 INFO ]: Computing forward predicates... Received shutdown request... [2018-06-26 22:03:37,573 INFO ]: Timeout while computing interpolants [2018-06-26 22:03:37,775 WARN ]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:03:37,775 WARN ]: Verification canceled [2018-06-26 22:03:37,777 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 22:03:37,777 WARN ]: Timeout [2018-06-26 22:03:37,778 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 10:03:37 BasicIcfg [2018-06-26 22:03:37,778 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 22:03:37,778 INFO ]: Toolchain (without parser) took 53937.75 ms. Allocated memory was 302.5 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 257.0 MB in the beginning and 679.1 MB in the end (delta: -422.0 MB). Peak memory consumption was 809.0 MB. Max. memory is 3.6 GB. [2018-06-26 22:03:37,779 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 302.5 MB. Free memory is still 268.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 22:03:37,780 INFO ]: ChcToBoogie took 56.98 ms. Allocated memory is still 302.5 MB. Free memory was 256.0 MB in the beginning and 254.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 22:03:37,780 INFO ]: Boogie Preprocessor took 46.65 ms. Allocated memory is still 302.5 MB. Free memory was 254.0 MB in the beginning and 253.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. [2018-06-26 22:03:37,780 INFO ]: RCFGBuilder took 228.60 ms. Allocated memory is still 302.5 MB. Free memory was 253.0 MB in the beginning and 244.0 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-26 22:03:37,780 INFO ]: BlockEncodingV2 took 6055.13 ms. Allocated memory was 302.5 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 244.0 MB in the beginning and 686.4 MB in the end (delta: -442.4 MB). Peak memory consumption was 912.4 MB. Max. memory is 3.6 GB. [2018-06-26 22:03:37,781 INFO ]: TraceAbstraction took 47542.93 ms. Allocated memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: 175.6 MB). Free memory was 686.4 MB in the beginning and 679.1 MB in the end (delta: 7.4 MB). Peak memory consumption was 183.0 MB. Max. memory is 3.6 GB. [2018-06-26 22:03:37,782 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 119 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 302.5 MB. Free memory is still 268.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 56.98 ms. Allocated memory is still 302.5 MB. Free memory was 256.0 MB in the beginning and 254.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 46.65 ms. Allocated memory is still 302.5 MB. Free memory was 254.0 MB in the beginning and 253.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 228.60 ms. Allocated memory is still 302.5 MB. Free memory was 253.0 MB in the beginning and 244.0 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 6055.13 ms. Allocated memory was 302.5 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 244.0 MB in the beginning and 686.4 MB in the end (delta: -442.4 MB). Peak memory consumption was 912.4 MB. Max. memory is 3.6 GB. * TraceAbstraction took 47542.93 ms. Allocated memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: 175.6 MB). Free memory was 686.4 MB in the beginning and 679.1 MB in the end (delta: 7.4 MB). Peak memory consumption was 183.0 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 111 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 4 quantified variables from 5 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 47.4s OverallTime, 35 OverallIterations, 11 TraceHistogramMax, 27.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 171 SDtfs, 69 SDslu, 719 SDs, 0 SdLazy, 22899 SolverSat, 10001 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2780 GetRequests, 2284 SyntacticMatches, 1 SemanticMatches, 495 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3427 ImplicationChecksByTransitivity, 10.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=497occurred in iteration=34, 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.2s AutomataMinimizationTime, 34 MinimizatonAttempts, 3580 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.0s SsaConstructionTime, 5.0s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 2797 NumberOfCodeBlocks, 2782 NumberOfCodeBlocksAsserted, 333 NumberOfCheckSat, 2742 ConstructedInterpolants, 0 QuantifiedInterpolants, 715193 SizeOfPredicates, 0 NumberOfNonLiveVariables, 35606 ConjunctsInSsa, 3157 ConjunctsInUnsatCore, 55 InterpolantComputations, 13 PerfectInterpolantSequences, 45652/89118 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/up4.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_22-03-37-797.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/up4.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_22-03-37-797.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/up4.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_22-03-37-797.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/up4.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_22-03-37-797.csv Completed graceful shutdown