java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/real-life/threadpooling_product_WithProcedures.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2eb0a67 [2018-10-03 08:35:16,954 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-03 08:35:16,956 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-03 08:35:16,969 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-03 08:35:16,970 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-03 08:35:16,971 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-03 08:35:16,972 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-03 08:35:16,974 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-03 08:35:16,975 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-03 08:35:16,976 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-03 08:35:16,977 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-03 08:35:16,977 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-03 08:35:16,978 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-03 08:35:16,979 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-03 08:35:16,980 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-03 08:35:16,981 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-03 08:35:16,982 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-03 08:35:16,983 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-03 08:35:16,985 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-03 08:35:16,987 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-03 08:35:16,988 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-03 08:35:16,989 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-03 08:35:16,991 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-03 08:35:16,991 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-03 08:35:16,992 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-03 08:35:16,993 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-03 08:35:16,993 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-03 08:35:16,995 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-03 08:35:16,996 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-03 08:35:16,999 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-03 08:35:16,999 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-03 08:35:17,000 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-03 08:35:17,000 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-03 08:35:17,000 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-03 08:35:17,001 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-03 08:35:17,002 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-03 08:35:17,002 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-03 08:35:17,024 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-03 08:35:17,025 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-03 08:35:17,026 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-03 08:35:17,026 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-03 08:35:17,027 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-03 08:35:17,028 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-03 08:35:17,028 INFO L133 SettingsManager]: * Use SBE=true [2018-10-03 08:35:17,028 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-03 08:35:17,028 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-03 08:35:17,029 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-03 08:35:17,029 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-03 08:35:17,029 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-03 08:35:17,029 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-03 08:35:17,029 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-03 08:35:17,029 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-03 08:35:17,029 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-03 08:35:17,030 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-03 08:35:17,030 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-03 08:35:17,030 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-03 08:35:17,030 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-03 08:35:17,030 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-03 08:35:17,031 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-03 08:35:17,031 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-03 08:35:17,031 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-03 08:35:17,031 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-03 08:35:17,032 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-03 08:35:17,032 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-03 08:35:17,032 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-03 08:35:17,032 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-03 08:35:17,032 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-03 08:35:17,089 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-03 08:35:17,102 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-03 08:35:17,106 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-03 08:35:17,108 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-03 08:35:17,108 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-03 08:35:17,109 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithProcedures.bpl [2018-10-03 08:35:17,110 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithProcedures.bpl' [2018-10-03 08:35:17,164 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-03 08:35:17,167 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-03 08:35:17,168 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-03 08:35:17,168 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-03 08:35:17,169 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-03 08:35:17,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:35:17" (1/1) ... [2018-10-03 08:35:17,204 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:35:17" (1/1) ... [2018-10-03 08:35:17,213 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-03 08:35:17,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-03 08:35:17,214 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-03 08:35:17,214 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-03 08:35:17,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:35:17" (1/1) ... [2018-10-03 08:35:17,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:35:17" (1/1) ... [2018-10-03 08:35:17,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:35:17" (1/1) ... [2018-10-03 08:35:17,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:35:17" (1/1) ... [2018-10-03 08:35:17,231 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:35:17" (1/1) ... [2018-10-03 08:35:17,234 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:35:17" (1/1) ... [2018-10-03 08:35:17,236 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:35:17" (1/1) ... [2018-10-03 08:35:17,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-03 08:35:17,238 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-03 08:35:17,238 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-03 08:35:17,238 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-03 08:35:17,239 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:35:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 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 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-03 08:35:17,317 INFO L130 BoogieDeclarations]: Found specification of procedure l1l0 [2018-10-03 08:35:17,318 INFO L138 BoogieDeclarations]: Found implementation of procedure l1l0 [2018-10-03 08:35:17,318 INFO L130 BoogieDeclarations]: Found specification of procedure l0l1 [2018-10-03 08:35:17,318 INFO L138 BoogieDeclarations]: Found implementation of procedure l0l1 [2018-10-03 08:35:17,318 INFO L130 BoogieDeclarations]: Found specification of procedure l0l0 [2018-10-03 08:35:17,318 INFO L138 BoogieDeclarations]: Found implementation of procedure l0l0 [2018-10-03 08:35:17,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-03 08:35:17,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-03 08:35:17,319 INFO L130 BoogieDeclarations]: Found specification of procedure l1l1 [2018-10-03 08:35:17,319 INFO L138 BoogieDeclarations]: Found implementation of procedure l1l1 [2018-10-03 08:35:17,887 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-03 08:35:17,887 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 08:35:17 BoogieIcfgContainer [2018-10-03 08:35:17,887 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-03 08:35:17,889 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-03 08:35:17,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-03 08:35:17,892 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-03 08:35:17,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:35:17" (1/2) ... [2018-10-03 08:35:17,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65c9363f and model type threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 08:35:17, skipping insertion in model container [2018-10-03 08:35:17,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 08:35:17" (2/2) ... [2018-10-03 08:35:17,896 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product_WithProcedures.bpl [2018-10-03 08:35:17,906 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-03 08:35:17,914 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-10-03 08:35:17,964 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-03 08:35:17,965 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-03 08:35:17,965 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-03 08:35:17,966 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-03 08:35:17,966 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-03 08:35:17,966 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-03 08:35:17,966 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-03 08:35:17,966 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-03 08:35:17,966 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-03 08:35:17,985 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-10-03 08:35:17,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-03 08:35:17,991 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:17,992 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:17,993 INFO L423 AbstractCegarLoop]: === Iteration 1 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:17,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:17,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1282157605, now seen corresponding path program 1 times [2018-10-03 08:35:18,001 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:18,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:18,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:18,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:18,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:18,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:18,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:18,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-03 08:35:18,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-03 08:35:18,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-03 08:35:18,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-03 08:35:18,280 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 6 states. [2018-10-03 08:35:19,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:19,093 INFO L93 Difference]: Finished difference Result 72 states and 100 transitions. [2018-10-03 08:35:19,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-03 08:35:19,097 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-03 08:35:19,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:19,111 INFO L225 Difference]: With dead ends: 72 [2018-10-03 08:35:19,111 INFO L226 Difference]: Without dead ends: 70 [2018-10-03 08:35:19,115 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-03 08:35:19,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-03 08:35:19,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 48. [2018-10-03 08:35:19,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-03 08:35:19,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2018-10-03 08:35:19,159 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 7 [2018-10-03 08:35:19,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:19,160 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2018-10-03 08:35:19,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-03 08:35:19,161 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2018-10-03 08:35:19,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-03 08:35:19,162 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:19,162 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:19,163 INFO L423 AbstractCegarLoop]: === Iteration 2 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:19,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:19,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1272619553, now seen corresponding path program 1 times [2018-10-03 08:35:19,163 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:19,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:19,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:19,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:19,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:19,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:19,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:19,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-03 08:35:19,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-03 08:35:19,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-03 08:35:19,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-03 08:35:19,290 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand 6 states. [2018-10-03 08:35:20,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:20,053 INFO L93 Difference]: Finished difference Result 81 states and 113 transitions. [2018-10-03 08:35:20,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-03 08:35:20,054 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-03 08:35:20,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:20,057 INFO L225 Difference]: With dead ends: 81 [2018-10-03 08:35:20,057 INFO L226 Difference]: Without dead ends: 79 [2018-10-03 08:35:20,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-03 08:35:20,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-03 08:35:20,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 57. [2018-10-03 08:35:20,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-03 08:35:20,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 78 transitions. [2018-10-03 08:35:20,072 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 78 transitions. Word has length 7 [2018-10-03 08:35:20,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:20,072 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 78 transitions. [2018-10-03 08:35:20,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-03 08:35:20,072 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2018-10-03 08:35:20,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-03 08:35:20,075 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:20,075 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:20,075 INFO L423 AbstractCegarLoop]: === Iteration 3 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:20,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:20,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1601446133, now seen corresponding path program 1 times [2018-10-03 08:35:20,076 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:20,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:20,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:20,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:20,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:20,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:20,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:20,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-03 08:35:20,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-03 08:35:20,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-03 08:35:20,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-03 08:35:20,279 INFO L87 Difference]: Start difference. First operand 57 states and 78 transitions. Second operand 7 states. [2018-10-03 08:35:21,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:21,267 INFO L93 Difference]: Finished difference Result 122 states and 175 transitions. [2018-10-03 08:35:21,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-03 08:35:21,272 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-10-03 08:35:21,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:21,274 INFO L225 Difference]: With dead ends: 122 [2018-10-03 08:35:21,274 INFO L226 Difference]: Without dead ends: 120 [2018-10-03 08:35:21,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-03 08:35:21,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-03 08:35:21,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 73. [2018-10-03 08:35:21,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-03 08:35:21,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2018-10-03 08:35:21,291 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 103 transitions. Word has length 10 [2018-10-03 08:35:21,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:21,291 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 103 transitions. [2018-10-03 08:35:21,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-03 08:35:21,292 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 103 transitions. [2018-10-03 08:35:21,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-03 08:35:21,293 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:21,293 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:21,294 INFO L423 AbstractCegarLoop]: === Iteration 4 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:21,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:21,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1152651256, now seen corresponding path program 1 times [2018-10-03 08:35:21,295 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:21,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:21,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:21,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:21,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:21,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:21,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:35:21,402 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:35:21,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:21,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:35:21,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:21,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-03 08:35:21,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2018-10-03 08:35:21,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-03 08:35:21,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-03 08:35:21,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-03 08:35:21,599 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. Second operand 9 states. [2018-10-03 08:35:22,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:22,426 INFO L93 Difference]: Finished difference Result 168 states and 243 transitions. [2018-10-03 08:35:22,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-03 08:35:22,426 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2018-10-03 08:35:22,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:22,428 INFO L225 Difference]: With dead ends: 168 [2018-10-03 08:35:22,428 INFO L226 Difference]: Without dead ends: 121 [2018-10-03 08:35:22,431 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2018-10-03 08:35:22,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-03 08:35:22,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 97. [2018-10-03 08:35:22,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-03 08:35:22,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 136 transitions. [2018-10-03 08:35:22,451 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 136 transitions. Word has length 10 [2018-10-03 08:35:22,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:22,452 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 136 transitions. [2018-10-03 08:35:22,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-03 08:35:22,452 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 136 transitions. [2018-10-03 08:35:22,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-03 08:35:22,454 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:22,454 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:22,457 INFO L423 AbstractCegarLoop]: === Iteration 5 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:22,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:22,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1536370777, now seen corresponding path program 1 times [2018-10-03 08:35:22,457 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:22,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:22,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:22,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:22,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:22,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:22,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:35:22,554 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-10-03 08:35:22,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:22,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:35:22,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:22,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:35:22,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-10-03 08:35:22,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-03 08:35:22,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-03 08:35:22,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-10-03 08:35:22,840 INFO L87 Difference]: Start difference. First operand 97 states and 136 transitions. Second operand 10 states. [2018-10-03 08:35:23,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:23,624 INFO L93 Difference]: Finished difference Result 164 states and 232 transitions. [2018-10-03 08:35:23,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-03 08:35:23,628 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-10-03 08:35:23,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:23,630 INFO L225 Difference]: With dead ends: 164 [2018-10-03 08:35:23,630 INFO L226 Difference]: Without dead ends: 162 [2018-10-03 08:35:23,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-10-03 08:35:23,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-03 08:35:23,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 109. [2018-10-03 08:35:23,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-03 08:35:23,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2018-10-03 08:35:23,679 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 11 [2018-10-03 08:35:23,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:23,679 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2018-10-03 08:35:23,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-03 08:35:23,680 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2018-10-03 08:35:23,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-03 08:35:23,681 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:23,682 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:23,682 INFO L423 AbstractCegarLoop]: === Iteration 6 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:23,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:23,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1150793287, now seen corresponding path program 1 times [2018-10-03 08:35:23,683 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:23,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:23,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:23,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:23,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:23,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:23,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:23,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:35:23,772 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-10-03 08:35:23,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:23,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:35:23,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:23,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:35:23,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-10-03 08:35:23,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-03 08:35:23,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-03 08:35:23,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-10-03 08:35:23,960 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand 10 states. [2018-10-03 08:35:25,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:25,031 INFO L93 Difference]: Finished difference Result 181 states and 254 transitions. [2018-10-03 08:35:25,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-03 08:35:25,034 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-10-03 08:35:25,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:25,035 INFO L225 Difference]: With dead ends: 181 [2018-10-03 08:35:25,035 INFO L226 Difference]: Without dead ends: 179 [2018-10-03 08:35:25,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-10-03 08:35:25,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-03 08:35:25,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 117. [2018-10-03 08:35:25,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-03 08:35:25,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 164 transitions. [2018-10-03 08:35:25,059 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 164 transitions. Word has length 11 [2018-10-03 08:35:25,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:25,059 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 164 transitions. [2018-10-03 08:35:25,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-03 08:35:25,060 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 164 transitions. [2018-10-03 08:35:25,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-03 08:35:25,061 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:25,062 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:25,062 INFO L423 AbstractCegarLoop]: === Iteration 7 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:25,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:25,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1829652612, now seen corresponding path program 1 times [2018-10-03 08:35:25,063 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:25,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:25,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:25,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:25,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:25,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:25,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:35:25,203 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-10-03 08:35:25,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:25,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:35:25,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:25,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-03 08:35:25,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2018-10-03 08:35:25,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-03 08:35:25,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-03 08:35:25,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-03 08:35:25,422 INFO L87 Difference]: Start difference. First operand 117 states and 164 transitions. Second operand 9 states. [2018-10-03 08:35:26,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:26,592 INFO L93 Difference]: Finished difference Result 217 states and 304 transitions. [2018-10-03 08:35:26,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-03 08:35:26,593 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-10-03 08:35:26,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:26,594 INFO L225 Difference]: With dead ends: 217 [2018-10-03 08:35:26,594 INFO L226 Difference]: Without dead ends: 133 [2018-10-03 08:35:26,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2018-10-03 08:35:26,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-03 08:35:26,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 119. [2018-10-03 08:35:26,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-03 08:35:26,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 160 transitions. [2018-10-03 08:35:26,616 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 160 transitions. Word has length 13 [2018-10-03 08:35:26,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:26,616 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 160 transitions. [2018-10-03 08:35:26,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-03 08:35:26,616 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 160 transitions. [2018-10-03 08:35:26,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-03 08:35:26,617 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:26,618 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:26,618 INFO L423 AbstractCegarLoop]: === Iteration 8 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:26,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:26,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1433054771, now seen corresponding path program 1 times [2018-10-03 08:35:26,618 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:26,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:26,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:26,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:26,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:26,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:26,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:35:26,731 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-10-03 08:35:26,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:26,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:35:27,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:27,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:35:27,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 12 [2018-10-03 08:35:27,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-03 08:35:27,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-03 08:35:27,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-10-03 08:35:27,221 INFO L87 Difference]: Start difference. First operand 119 states and 160 transitions. Second operand 13 states. [2018-10-03 08:35:28,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:28,893 INFO L93 Difference]: Finished difference Result 194 states and 266 transitions. [2018-10-03 08:35:28,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-03 08:35:28,894 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-10-03 08:35:28,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:28,895 INFO L225 Difference]: With dead ends: 194 [2018-10-03 08:35:28,896 INFO L226 Difference]: Without dead ends: 192 [2018-10-03 08:35:28,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=266, Invalid=856, Unknown=0, NotChecked=0, Total=1122 [2018-10-03 08:35:28,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-03 08:35:28,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 181. [2018-10-03 08:35:28,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-03 08:35:28,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 257 transitions. [2018-10-03 08:35:28,936 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 257 transitions. Word has length 14 [2018-10-03 08:35:28,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:28,937 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 257 transitions. [2018-10-03 08:35:28,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-03 08:35:28,937 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 257 transitions. [2018-10-03 08:35:28,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-03 08:35:28,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:28,938 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:28,939 INFO L423 AbstractCegarLoop]: === Iteration 9 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:28,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:28,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1436992942, now seen corresponding path program 1 times [2018-10-03 08:35:28,944 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:28,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:28,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:28,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:28,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:29,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:29,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:35:29,059 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:35:29,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:29,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:35:29,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:29,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:35:29,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 12 [2018-10-03 08:35:29,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-03 08:35:29,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-03 08:35:29,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-10-03 08:35:29,422 INFO L87 Difference]: Start difference. First operand 181 states and 257 transitions. Second operand 14 states. [2018-10-03 08:35:30,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:30,747 INFO L93 Difference]: Finished difference Result 246 states and 347 transitions. [2018-10-03 08:35:30,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-03 08:35:30,749 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-03 08:35:30,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:30,751 INFO L225 Difference]: With dead ends: 246 [2018-10-03 08:35:30,751 INFO L226 Difference]: Without dead ends: 244 [2018-10-03 08:35:30,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2018-10-03 08:35:30,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-03 08:35:30,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 193. [2018-10-03 08:35:30,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-03 08:35:30,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 274 transitions. [2018-10-03 08:35:30,789 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 274 transitions. Word has length 14 [2018-10-03 08:35:30,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:30,789 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 274 transitions. [2018-10-03 08:35:30,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-03 08:35:30,790 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 274 transitions. [2018-10-03 08:35:30,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-03 08:35:30,791 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:30,791 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:30,791 INFO L423 AbstractCegarLoop]: === Iteration 10 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:30,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:30,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1436993326, now seen corresponding path program 1 times [2018-10-03 08:35:30,792 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:30,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:30,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:30,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:30,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:30,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:30,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:35:30,870 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-10-03 08:35:30,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:30,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:35:31,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:31,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:35:31,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2018-10-03 08:35:31,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-03 08:35:31,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-03 08:35:31,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-10-03 08:35:31,085 INFO L87 Difference]: Start difference. First operand 193 states and 274 transitions. Second operand 14 states. [2018-10-03 08:35:33,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:33,089 INFO L93 Difference]: Finished difference Result 288 states and 406 transitions. [2018-10-03 08:35:33,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-03 08:35:33,094 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-03 08:35:33,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:33,096 INFO L225 Difference]: With dead ends: 288 [2018-10-03 08:35:33,096 INFO L226 Difference]: Without dead ends: 286 [2018-10-03 08:35:33,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=338, Invalid=1068, Unknown=0, NotChecked=0, Total=1406 [2018-10-03 08:35:33,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-03 08:35:33,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 221. [2018-10-03 08:35:33,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-03 08:35:33,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 315 transitions. [2018-10-03 08:35:33,130 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 315 transitions. Word has length 14 [2018-10-03 08:35:33,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:33,130 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 315 transitions. [2018-10-03 08:35:33,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-03 08:35:33,130 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 315 transitions. [2018-10-03 08:35:33,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-03 08:35:33,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:33,131 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:33,132 INFO L423 AbstractCegarLoop]: === Iteration 11 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:33,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:33,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1791986342, now seen corresponding path program 1 times [2018-10-03 08:35:33,132 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:33,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:33,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:33,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:33,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:33,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:33,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:35:33,228 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-10-03 08:35:33,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:33,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:35:33,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:33,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:35:33,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2018-10-03 08:35:33,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-03 08:35:33,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-03 08:35:33,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-10-03 08:35:33,373 INFO L87 Difference]: Start difference. First operand 221 states and 315 transitions. Second operand 14 states. [2018-10-03 08:35:34,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:34,422 INFO L93 Difference]: Finished difference Result 314 states and 443 transitions. [2018-10-03 08:35:34,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-03 08:35:34,426 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-03 08:35:34,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:34,428 INFO L225 Difference]: With dead ends: 314 [2018-10-03 08:35:34,428 INFO L226 Difference]: Without dead ends: 312 [2018-10-03 08:35:34,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=307, Invalid=815, Unknown=0, NotChecked=0, Total=1122 [2018-10-03 08:35:34,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-10-03 08:35:34,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 243. [2018-10-03 08:35:34,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-03 08:35:34,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 349 transitions. [2018-10-03 08:35:34,468 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 349 transitions. Word has length 14 [2018-10-03 08:35:34,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:34,468 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 349 transitions. [2018-10-03 08:35:34,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-03 08:35:34,469 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 349 transitions. [2018-10-03 08:35:34,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-03 08:35:34,469 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:34,470 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:34,470 INFO L423 AbstractCegarLoop]: === Iteration 12 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:34,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:34,470 INFO L82 PathProgramCache]: Analyzing trace with hash 844488035, now seen corresponding path program 1 times [2018-10-03 08:35:34,470 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:34,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:34,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:34,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:34,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:34,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:34,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:35:34,669 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-10-03 08:35:34,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:34,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:35:34,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:34,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:35:34,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 12 [2018-10-03 08:35:34,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-03 08:35:34,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-03 08:35:34,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-10-03 08:35:34,828 INFO L87 Difference]: Start difference. First operand 243 states and 349 transitions. Second operand 13 states. [2018-10-03 08:35:35,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:35,693 INFO L93 Difference]: Finished difference Result 322 states and 462 transitions. [2018-10-03 08:35:35,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-03 08:35:35,693 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-10-03 08:35:35,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:35,695 INFO L225 Difference]: With dead ends: 322 [2018-10-03 08:35:35,695 INFO L226 Difference]: Without dead ends: 320 [2018-10-03 08:35:35,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=266, Invalid=856, Unknown=0, NotChecked=0, Total=1122 [2018-10-03 08:35:35,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-10-03 08:35:35,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 302. [2018-10-03 08:35:35,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-03 08:35:35,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 444 transitions. [2018-10-03 08:35:35,750 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 444 transitions. Word has length 14 [2018-10-03 08:35:35,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:35,750 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 444 transitions. [2018-10-03 08:35:35,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-03 08:35:35,750 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 444 transitions. [2018-10-03 08:35:35,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-03 08:35:35,751 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:35,751 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:35,751 INFO L423 AbstractCegarLoop]: === Iteration 13 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:35,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:35,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1052420626, now seen corresponding path program 1 times [2018-10-03 08:35:35,752 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:35,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:35,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:35,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:35,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:36,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:36,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:35:36,347 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-10-03 08:35:36,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:36,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:35:36,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:36,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:35:36,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2018-10-03 08:35:36,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-03 08:35:36,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-03 08:35:36,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-10-03 08:35:36,577 INFO L87 Difference]: Start difference. First operand 302 states and 444 transitions. Second operand 14 states. [2018-10-03 08:35:37,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:37,993 INFO L93 Difference]: Finished difference Result 378 states and 544 transitions. [2018-10-03 08:35:37,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-03 08:35:37,996 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-03 08:35:37,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:38,000 INFO L225 Difference]: With dead ends: 378 [2018-10-03 08:35:38,000 INFO L226 Difference]: Without dead ends: 376 [2018-10-03 08:35:38,001 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=307, Invalid=815, Unknown=0, NotChecked=0, Total=1122 [2018-10-03 08:35:38,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-10-03 08:35:38,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 301. [2018-10-03 08:35:38,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-10-03 08:35:38,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 443 transitions. [2018-10-03 08:35:38,072 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 443 transitions. Word has length 14 [2018-10-03 08:35:38,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:38,072 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 443 transitions. [2018-10-03 08:35:38,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-03 08:35:38,073 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 443 transitions. [2018-10-03 08:35:38,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-03 08:35:38,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:38,074 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:38,074 INFO L423 AbstractCegarLoop]: === Iteration 14 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:38,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:38,074 INFO L82 PathProgramCache]: Analyzing trace with hash 697427610, now seen corresponding path program 1 times [2018-10-03 08:35:38,074 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:38,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:38,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:38,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:38,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:38,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:38,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:35:38,230 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-10-03 08:35:38,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:38,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:35:38,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:38,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:35:38,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 14 [2018-10-03 08:35:38,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-03 08:35:38,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-03 08:35:38,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-10-03 08:35:38,431 INFO L87 Difference]: Start difference. First operand 301 states and 443 transitions. Second operand 15 states. [2018-10-03 08:35:40,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:40,113 INFO L93 Difference]: Finished difference Result 395 states and 572 transitions. [2018-10-03 08:35:40,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-03 08:35:40,113 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-10-03 08:35:40,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:40,116 INFO L225 Difference]: With dead ends: 395 [2018-10-03 08:35:40,116 INFO L226 Difference]: Without dead ends: 393 [2018-10-03 08:35:40,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=347, Invalid=1135, Unknown=0, NotChecked=0, Total=1482 [2018-10-03 08:35:40,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-10-03 08:35:40,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 312. [2018-10-03 08:35:40,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-10-03 08:35:40,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 459 transitions. [2018-10-03 08:35:40,174 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 459 transitions. Word has length 14 [2018-10-03 08:35:40,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:40,174 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 459 transitions. [2018-10-03 08:35:40,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-03 08:35:40,174 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 459 transitions. [2018-10-03 08:35:40,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-03 08:35:40,175 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:40,175 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:40,176 INFO L423 AbstractCegarLoop]: === Iteration 15 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:40,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:40,176 INFO L82 PathProgramCache]: Analyzing trace with hash 697427226, now seen corresponding path program 1 times [2018-10-03 08:35:40,176 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:40,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:40,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:40,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:40,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:40,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:40,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:35:40,261 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-10-03 08:35:40,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:40,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:35:40,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:40,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:35:40,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2018-10-03 08:35:40,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-03 08:35:40,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-03 08:35:40,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-10-03 08:35:40,457 INFO L87 Difference]: Start difference. First operand 312 states and 459 transitions. Second operand 13 states. [2018-10-03 08:35:41,569 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-10-03 08:35:43,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:43,073 INFO L93 Difference]: Finished difference Result 383 states and 560 transitions. [2018-10-03 08:35:43,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-03 08:35:43,074 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-10-03 08:35:43,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:43,076 INFO L225 Difference]: With dead ends: 383 [2018-10-03 08:35:43,076 INFO L226 Difference]: Without dead ends: 381 [2018-10-03 08:35:43,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2018-10-03 08:35:43,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-10-03 08:35:43,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 328. [2018-10-03 08:35:43,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-10-03 08:35:43,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 482 transitions. [2018-10-03 08:35:43,142 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 482 transitions. Word has length 14 [2018-10-03 08:35:43,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:43,142 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 482 transitions. [2018-10-03 08:35:43,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-03 08:35:43,143 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 482 transitions. [2018-10-03 08:35:43,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-03 08:35:43,144 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:43,144 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:43,144 INFO L423 AbstractCegarLoop]: === Iteration 16 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:43,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:43,144 INFO L82 PathProgramCache]: Analyzing trace with hash 406900684, now seen corresponding path program 1 times [2018-10-03 08:35:43,145 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:43,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:43,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:43,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:43,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:43,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:43,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:35:43,295 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-10-03 08:35:43,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:43,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:35:43,483 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:43,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:35:43,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-10-03 08:35:43,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-03 08:35:43,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-03 08:35:43,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-10-03 08:35:43,506 INFO L87 Difference]: Start difference. First operand 328 states and 482 transitions. Second operand 16 states. [2018-10-03 08:35:45,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:45,198 INFO L93 Difference]: Finished difference Result 429 states and 618 transitions. [2018-10-03 08:35:45,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-03 08:35:45,199 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2018-10-03 08:35:45,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:45,201 INFO L225 Difference]: With dead ends: 429 [2018-10-03 08:35:45,201 INFO L226 Difference]: Without dead ends: 427 [2018-10-03 08:35:45,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=579, Invalid=1401, Unknown=0, NotChecked=0, Total=1980 [2018-10-03 08:35:45,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-10-03 08:35:45,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 242. [2018-10-03 08:35:45,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-03 08:35:45,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 351 transitions. [2018-10-03 08:35:45,299 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 351 transitions. Word has length 17 [2018-10-03 08:35:45,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:45,299 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 351 transitions. [2018-10-03 08:35:45,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-03 08:35:45,299 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 351 transitions. [2018-10-03 08:35:45,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-03 08:35:45,300 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:45,300 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:45,305 INFO L423 AbstractCegarLoop]: === Iteration 17 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:45,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:45,305 INFO L82 PathProgramCache]: Analyzing trace with hash 2143481530, now seen corresponding path program 1 times [2018-10-03 08:35:45,305 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:45,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:45,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:45,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:45,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:45,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:45,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:45,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:35:45,496 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:35:45,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:45,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:35:45,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:45,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:35:45,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-10-03 08:35:45,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-03 08:35:45,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-03 08:35:45,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-10-03 08:35:45,678 INFO L87 Difference]: Start difference. First operand 242 states and 351 transitions. Second operand 16 states. [2018-10-03 08:35:47,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:47,094 INFO L93 Difference]: Finished difference Result 330 states and 466 transitions. [2018-10-03 08:35:47,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-03 08:35:47,095 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2018-10-03 08:35:47,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:47,097 INFO L225 Difference]: With dead ends: 330 [2018-10-03 08:35:47,097 INFO L226 Difference]: Without dead ends: 328 [2018-10-03 08:35:47,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=579, Invalid=1401, Unknown=0, NotChecked=0, Total=1980 [2018-10-03 08:35:47,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-03 08:35:47,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 158. [2018-10-03 08:35:47,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-03 08:35:47,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 226 transitions. [2018-10-03 08:35:47,160 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 226 transitions. Word has length 17 [2018-10-03 08:35:47,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:47,160 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 226 transitions. [2018-10-03 08:35:47,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-03 08:35:47,161 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 226 transitions. [2018-10-03 08:35:47,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-03 08:35:47,161 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:47,162 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:47,162 INFO L423 AbstractCegarLoop]: === Iteration 18 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:47,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:47,162 INFO L82 PathProgramCache]: Analyzing trace with hash -653821292, now seen corresponding path program 1 times [2018-10-03 08:35:47,162 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:47,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:47,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:47,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:47,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:47,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:47,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:35:47,254 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-10-03 08:35:47,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:47,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:35:47,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:47,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:35:47,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-10-03 08:35:47,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-03 08:35:47,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-03 08:35:47,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-10-03 08:35:47,393 INFO L87 Difference]: Start difference. First operand 158 states and 226 transitions. Second operand 12 states. [2018-10-03 08:35:47,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:47,939 INFO L93 Difference]: Finished difference Result 271 states and 380 transitions. [2018-10-03 08:35:47,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-03 08:35:47,939 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-10-03 08:35:47,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:47,940 INFO L225 Difference]: With dead ends: 271 [2018-10-03 08:35:47,941 INFO L226 Difference]: Without dead ends: 269 [2018-10-03 08:35:47,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2018-10-03 08:35:47,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-03 08:35:48,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 180. [2018-10-03 08:35:48,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-03 08:35:48,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 258 transitions. [2018-10-03 08:35:48,019 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 258 transitions. Word has length 18 [2018-10-03 08:35:48,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:48,019 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 258 transitions. [2018-10-03 08:35:48,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-03 08:35:48,020 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 258 transitions. [2018-10-03 08:35:48,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-03 08:35:48,021 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:48,021 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:48,021 INFO L423 AbstractCegarLoop]: === Iteration 19 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:48,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:48,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1014964826, now seen corresponding path program 1 times [2018-10-03 08:35:48,022 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:48,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:48,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:48,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:48,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:48,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:48,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:35:48,657 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-10-03 08:35:48,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:48,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:35:48,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:48,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-03 08:35:48,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2018-10-03 08:35:48,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-03 08:35:48,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-03 08:35:48,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-10-03 08:35:48,796 INFO L87 Difference]: Start difference. First operand 180 states and 258 transitions. Second operand 13 states. [2018-10-03 08:35:51,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:51,408 INFO L93 Difference]: Finished difference Result 741 states and 1047 transitions. [2018-10-03 08:35:51,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-03 08:35:51,408 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-03 08:35:51,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:51,411 INFO L225 Difference]: With dead ends: 741 [2018-10-03 08:35:51,411 INFO L226 Difference]: Without dead ends: 564 [2018-10-03 08:35:51,414 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2559 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1290, Invalid=6192, Unknown=0, NotChecked=0, Total=7482 [2018-10-03 08:35:51,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2018-10-03 08:35:51,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 341. [2018-10-03 08:35:51,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-10-03 08:35:51,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 486 transitions. [2018-10-03 08:35:51,539 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 486 transitions. Word has length 18 [2018-10-03 08:35:51,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:51,540 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 486 transitions. [2018-10-03 08:35:51,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-03 08:35:51,540 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 486 transitions. [2018-10-03 08:35:51,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-03 08:35:51,540 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:51,541 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:51,541 INFO L423 AbstractCegarLoop]: === Iteration 20 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:51,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:51,541 INFO L82 PathProgramCache]: Analyzing trace with hash -155045024, now seen corresponding path program 1 times [2018-10-03 08:35:51,541 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:51,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:51,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:51,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:51,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:51,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:51,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:35:51,642 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-10-03 08:35:51,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:51,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:35:51,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:51,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:35:51,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2018-10-03 08:35:51,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-03 08:35:51,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-03 08:35:51,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-10-03 08:35:51,805 INFO L87 Difference]: Start difference. First operand 341 states and 486 transitions. Second operand 13 states. [2018-10-03 08:35:53,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:53,489 INFO L93 Difference]: Finished difference Result 809 states and 1155 transitions. [2018-10-03 08:35:53,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-03 08:35:53,490 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-03 08:35:53,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:53,492 INFO L225 Difference]: With dead ends: 809 [2018-10-03 08:35:53,493 INFO L226 Difference]: Without dead ends: 470 [2018-10-03 08:35:53,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=462, Invalid=1518, Unknown=0, NotChecked=0, Total=1980 [2018-10-03 08:35:53,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-10-03 08:35:53,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 368. [2018-10-03 08:35:53,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-03 08:35:53,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 523 transitions. [2018-10-03 08:35:53,667 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 523 transitions. Word has length 18 [2018-10-03 08:35:53,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:53,667 INFO L480 AbstractCegarLoop]: Abstraction has 368 states and 523 transitions. [2018-10-03 08:35:53,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-03 08:35:53,668 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 523 transitions. [2018-10-03 08:35:53,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-03 08:35:53,669 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:53,669 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:53,669 INFO L423 AbstractCegarLoop]: === Iteration 21 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:53,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:53,669 INFO L82 PathProgramCache]: Analyzing trace with hash 393788879, now seen corresponding path program 1 times [2018-10-03 08:35:53,670 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:53,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:53,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:53,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:53,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:54,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:54,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:35:54,174 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-10-03 08:35:54,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:54,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:35:54,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:54,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:35:54,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-03 08:35:54,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-03 08:35:54,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-03 08:35:54,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-10-03 08:35:54,352 INFO L87 Difference]: Start difference. First operand 368 states and 523 transitions. Second operand 13 states. [2018-10-03 08:35:56,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:56,194 INFO L93 Difference]: Finished difference Result 1106 states and 1568 transitions. [2018-10-03 08:35:56,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-03 08:35:56,194 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-03 08:35:56,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:56,198 INFO L225 Difference]: With dead ends: 1106 [2018-10-03 08:35:56,198 INFO L226 Difference]: Without dead ends: 724 [2018-10-03 08:35:56,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1093 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=678, Invalid=2628, Unknown=0, NotChecked=0, Total=3306 [2018-10-03 08:35:56,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2018-10-03 08:35:56,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 519. [2018-10-03 08:35:56,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2018-10-03 08:35:56,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 739 transitions. [2018-10-03 08:35:56,428 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 739 transitions. Word has length 18 [2018-10-03 08:35:56,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:56,428 INFO L480 AbstractCegarLoop]: Abstraction has 519 states and 739 transitions. [2018-10-03 08:35:56,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-03 08:35:56,429 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 739 transitions. [2018-10-03 08:35:56,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-03 08:35:56,430 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:56,430 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:56,430 INFO L423 AbstractCegarLoop]: === Iteration 22 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:56,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:56,430 INFO L82 PathProgramCache]: Analyzing trace with hash -216264799, now seen corresponding path program 1 times [2018-10-03 08:35:56,431 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:56,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:56,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:56,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:56,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:56,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:56,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:35:56,529 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-10-03 08:35:56,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:56,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:56,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:35:56,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:56,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:35:56,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2018-10-03 08:35:56,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-03 08:35:56,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-03 08:35:56,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-10-03 08:35:56,628 INFO L87 Difference]: Start difference. First operand 519 states and 739 transitions. Second operand 11 states. [2018-10-03 08:35:57,482 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-03 08:35:58,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:58,207 INFO L93 Difference]: Finished difference Result 711 states and 1002 transitions. [2018-10-03 08:35:58,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-03 08:35:58,208 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-10-03 08:35:58,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:58,211 INFO L225 Difference]: With dead ends: 711 [2018-10-03 08:35:58,211 INFO L226 Difference]: Without dead ends: 709 [2018-10-03 08:35:58,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2018-10-03 08:35:58,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-10-03 08:35:58,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 498. [2018-10-03 08:35:58,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2018-10-03 08:35:58,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 704 transitions. [2018-10-03 08:35:58,368 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 704 transitions. Word has length 18 [2018-10-03 08:35:58,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:58,368 INFO L480 AbstractCegarLoop]: Abstraction has 498 states and 704 transitions. [2018-10-03 08:35:58,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-03 08:35:58,369 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 704 transitions. [2018-10-03 08:35:58,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-03 08:35:58,370 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:58,370 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:58,370 INFO L423 AbstractCegarLoop]: === Iteration 23 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:58,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:58,370 INFO L82 PathProgramCache]: Analyzing trace with hash 983482113, now seen corresponding path program 1 times [2018-10-03 08:35:58,370 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:58,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:58,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:58,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:58,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:58,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:58,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:35:58,800 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-10-03 08:35:58,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:58,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:35:58,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:58,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-03 08:35:58,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 13 [2018-10-03 08:35:58,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-03 08:35:58,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-03 08:35:58,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-10-03 08:35:58,931 INFO L87 Difference]: Start difference. First operand 498 states and 704 transitions. Second operand 13 states. [2018-10-03 08:36:00,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:00,868 INFO L93 Difference]: Finished difference Result 1319 states and 1864 transitions. [2018-10-03 08:36:00,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-03 08:36:00,869 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-03 08:36:00,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:00,872 INFO L225 Difference]: With dead ends: 1319 [2018-10-03 08:36:00,873 INFO L226 Difference]: Without dead ends: 823 [2018-10-03 08:36:00,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=477, Invalid=1415, Unknown=0, NotChecked=0, Total=1892 [2018-10-03 08:36:00,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2018-10-03 08:36:01,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 566. [2018-10-03 08:36:01,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2018-10-03 08:36:01,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 809 transitions. [2018-10-03 08:36:01,097 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 809 transitions. Word has length 18 [2018-10-03 08:36:01,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:01,097 INFO L480 AbstractCegarLoop]: Abstraction has 566 states and 809 transitions. [2018-10-03 08:36:01,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-03 08:36:01,098 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 809 transitions. [2018-10-03 08:36:01,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-03 08:36:01,099 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:01,099 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:01,099 INFO L423 AbstractCegarLoop]: === Iteration 24 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:01,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:01,099 INFO L82 PathProgramCache]: Analyzing trace with hash 801556786, now seen corresponding path program 1 times [2018-10-03 08:36:01,100 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:01,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:01,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:01,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:01,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:01,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:01,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:36:01,224 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-10-03 08:36:01,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:01,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:36:01,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:01,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:36:01,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-10-03 08:36:01,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-03 08:36:01,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-03 08:36:01,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-10-03 08:36:01,368 INFO L87 Difference]: Start difference. First operand 566 states and 809 transitions. Second operand 12 states. [2018-10-03 08:36:02,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:02,223 INFO L93 Difference]: Finished difference Result 766 states and 1086 transitions. [2018-10-03 08:36:02,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-03 08:36:02,224 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-10-03 08:36:02,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:02,226 INFO L225 Difference]: With dead ends: 766 [2018-10-03 08:36:02,226 INFO L226 Difference]: Without dead ends: 764 [2018-10-03 08:36:02,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2018-10-03 08:36:02,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2018-10-03 08:36:02,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 608. [2018-10-03 08:36:02,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-10-03 08:36:02,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 869 transitions. [2018-10-03 08:36:02,418 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 869 transitions. Word has length 18 [2018-10-03 08:36:02,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:02,418 INFO L480 AbstractCegarLoop]: Abstraction has 608 states and 869 transitions. [2018-10-03 08:36:02,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-03 08:36:02,418 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 869 transitions. [2018-10-03 08:36:02,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-03 08:36:02,419 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:02,420 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:02,420 INFO L423 AbstractCegarLoop]: === Iteration 25 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:02,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:02,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1593301430, now seen corresponding path program 1 times [2018-10-03 08:36:02,420 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:02,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:02,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:02,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:02,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:02,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:02,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:36:02,518 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-10-03 08:36:02,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:02,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:36:02,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:02,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-03 08:36:02,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2018-10-03 08:36:02,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-03 08:36:02,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-03 08:36:02,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-10-03 08:36:02,875 INFO L87 Difference]: Start difference. First operand 608 states and 869 transitions. Second operand 13 states. [2018-10-03 08:36:05,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:05,678 INFO L93 Difference]: Finished difference Result 2095 states and 2968 transitions. [2018-10-03 08:36:05,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-03 08:36:05,678 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-03 08:36:05,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:05,684 INFO L225 Difference]: With dead ends: 2095 [2018-10-03 08:36:05,684 INFO L226 Difference]: Without dead ends: 1329 [2018-10-03 08:36:05,690 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2559 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1290, Invalid=6192, Unknown=0, NotChecked=0, Total=7482 [2018-10-03 08:36:05,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2018-10-03 08:36:06,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 992. [2018-10-03 08:36:06,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2018-10-03 08:36:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1402 transitions. [2018-10-03 08:36:06,026 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1402 transitions. Word has length 18 [2018-10-03 08:36:06,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:06,026 INFO L480 AbstractCegarLoop]: Abstraction has 992 states and 1402 transitions. [2018-10-03 08:36:06,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-03 08:36:06,027 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1402 transitions. [2018-10-03 08:36:06,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-03 08:36:06,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:06,028 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:06,028 INFO L423 AbstractCegarLoop]: === Iteration 26 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:06,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:06,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1366841759, now seen corresponding path program 1 times [2018-10-03 08:36:06,028 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:06,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:06,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:06,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:06,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:06,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:06,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:36:06,138 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-10-03 08:36:06,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:06,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:36:06,213 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:06,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:36:06,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2018-10-03 08:36:06,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-03 08:36:06,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-03 08:36:06,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-10-03 08:36:06,235 INFO L87 Difference]: Start difference. First operand 992 states and 1402 transitions. Second operand 11 states. [2018-10-03 08:36:07,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:07,468 INFO L93 Difference]: Finished difference Result 1291 states and 1819 transitions. [2018-10-03 08:36:07,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-03 08:36:07,469 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-10-03 08:36:07,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:07,473 INFO L225 Difference]: With dead ends: 1291 [2018-10-03 08:36:07,473 INFO L226 Difference]: Without dead ends: 1289 [2018-10-03 08:36:07,474 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2018-10-03 08:36:07,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2018-10-03 08:36:07,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1028. [2018-10-03 08:36:07,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028 states. [2018-10-03 08:36:07,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1454 transitions. [2018-10-03 08:36:07,775 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1454 transitions. Word has length 18 [2018-10-03 08:36:07,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:07,775 INFO L480 AbstractCegarLoop]: Abstraction has 1028 states and 1454 transitions. [2018-10-03 08:36:07,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-03 08:36:07,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1454 transitions. [2018-10-03 08:36:07,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-03 08:36:07,776 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:07,776 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:07,777 INFO L423 AbstractCegarLoop]: === Iteration 27 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:07,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:07,777 INFO L82 PathProgramCache]: Analyzing trace with hash -817918193, now seen corresponding path program 1 times [2018-10-03 08:36:07,777 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:07,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:07,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:07,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:07,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:08,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:08,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:36:08,129 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:36:08,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:08,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:36:08,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:08,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-03 08:36:08,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 13 [2018-10-03 08:36:08,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-03 08:36:08,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-03 08:36:08,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-10-03 08:36:08,257 INFO L87 Difference]: Start difference. First operand 1028 states and 1454 transitions. Second operand 13 states. [2018-10-03 08:36:09,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:09,830 INFO L93 Difference]: Finished difference Result 2222 states and 3144 transitions. [2018-10-03 08:36:09,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-03 08:36:09,831 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-03 08:36:09,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:09,835 INFO L225 Difference]: With dead ends: 2222 [2018-10-03 08:36:09,835 INFO L226 Difference]: Without dead ends: 1132 [2018-10-03 08:36:09,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=477, Invalid=1415, Unknown=0, NotChecked=0, Total=1892 [2018-10-03 08:36:09,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2018-10-03 08:36:10,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 831. [2018-10-03 08:36:10,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2018-10-03 08:36:10,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1173 transitions. [2018-10-03 08:36:10,110 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1173 transitions. Word has length 18 [2018-10-03 08:36:10,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:10,110 INFO L480 AbstractCegarLoop]: Abstraction has 831 states and 1173 transitions. [2018-10-03 08:36:10,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-03 08:36:10,110 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1173 transitions. [2018-10-03 08:36:10,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-03 08:36:10,111 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:10,111 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:10,112 INFO L423 AbstractCegarLoop]: === Iteration 28 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:10,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:10,112 INFO L82 PathProgramCache]: Analyzing trace with hash -228224959, now seen corresponding path program 1 times [2018-10-03 08:36:10,112 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:10,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:10,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:10,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:10,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:10,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:10,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:36:10,209 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:36:10,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:10,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:36:10,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:10,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:36:10,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-03 08:36:10,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-03 08:36:10,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-03 08:36:10,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-10-03 08:36:10,391 INFO L87 Difference]: Start difference. First operand 831 states and 1173 transitions. Second operand 13 states. [2018-10-03 08:36:12,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:12,431 INFO L93 Difference]: Finished difference Result 1989 states and 2785 transitions. [2018-10-03 08:36:12,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-03 08:36:12,431 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-03 08:36:12,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:12,436 INFO L225 Difference]: With dead ends: 1989 [2018-10-03 08:36:12,436 INFO L226 Difference]: Without dead ends: 1130 [2018-10-03 08:36:12,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=678, Invalid=2628, Unknown=0, NotChecked=0, Total=3306 [2018-10-03 08:36:12,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2018-10-03 08:36:12,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 806. [2018-10-03 08:36:12,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2018-10-03 08:36:12,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1135 transitions. [2018-10-03 08:36:12,740 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1135 transitions. Word has length 18 [2018-10-03 08:36:12,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:12,741 INFO L480 AbstractCegarLoop]: Abstraction has 806 states and 1135 transitions. [2018-10-03 08:36:12,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-03 08:36:12,741 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1135 transitions. [2018-10-03 08:36:12,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-03 08:36:12,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:12,742 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:12,743 INFO L423 AbstractCegarLoop]: === Iteration 29 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:12,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:12,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1122647006, now seen corresponding path program 1 times [2018-10-03 08:36:12,743 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:12,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:12,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:12,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:12,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:12,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:12,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:36:12,845 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:36:12,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:12,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:36:12,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:12,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:36:12,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-10-03 08:36:12,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-03 08:36:12,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-03 08:36:12,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-10-03 08:36:12,982 INFO L87 Difference]: Start difference. First operand 806 states and 1135 transitions. Second operand 11 states. [2018-10-03 08:36:14,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:14,259 INFO L93 Difference]: Finished difference Result 1022 states and 1428 transitions. [2018-10-03 08:36:14,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-03 08:36:14,260 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-10-03 08:36:14,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:14,265 INFO L225 Difference]: With dead ends: 1022 [2018-10-03 08:36:14,265 INFO L226 Difference]: Without dead ends: 1020 [2018-10-03 08:36:14,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=727, Unknown=0, NotChecked=0, Total=930 [2018-10-03 08:36:14,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2018-10-03 08:36:14,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 838. [2018-10-03 08:36:14,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2018-10-03 08:36:14,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1182 transitions. [2018-10-03 08:36:14,606 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1182 transitions. Word has length 22 [2018-10-03 08:36:14,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:14,607 INFO L480 AbstractCegarLoop]: Abstraction has 838 states and 1182 transitions. [2018-10-03 08:36:14,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-03 08:36:14,607 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1182 transitions. [2018-10-03 08:36:14,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-03 08:36:14,608 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:14,608 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:14,608 INFO L423 AbstractCegarLoop]: === Iteration 30 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:14,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:14,609 INFO L82 PathProgramCache]: Analyzing trace with hash 15880131, now seen corresponding path program 1 times [2018-10-03 08:36:14,609 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:14,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:14,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:14,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:14,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:14,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:14,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:36:14,772 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:36:14,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:14,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:36:14,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:14,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:36:14,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-10-03 08:36:14,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-03 08:36:14,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-03 08:36:14,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-10-03 08:36:14,877 INFO L87 Difference]: Start difference. First operand 838 states and 1182 transitions. Second operand 10 states. [2018-10-03 08:36:16,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:16,577 INFO L93 Difference]: Finished difference Result 1127 states and 1575 transitions. [2018-10-03 08:36:16,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-03 08:36:16,578 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-10-03 08:36:16,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:16,582 INFO L225 Difference]: With dead ends: 1127 [2018-10-03 08:36:16,582 INFO L226 Difference]: Without dead ends: 1125 [2018-10-03 08:36:16,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2018-10-03 08:36:16,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2018-10-03 08:36:16,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 852. [2018-10-03 08:36:16,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2018-10-03 08:36:16,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1203 transitions. [2018-10-03 08:36:16,897 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1203 transitions. Word has length 22 [2018-10-03 08:36:16,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:16,898 INFO L480 AbstractCegarLoop]: Abstraction has 852 states and 1203 transitions. [2018-10-03 08:36:16,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-03 08:36:16,898 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1203 transitions. [2018-10-03 08:36:16,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-03 08:36:16,899 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:16,899 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:16,900 INFO L423 AbstractCegarLoop]: === Iteration 31 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:16,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:16,900 INFO L82 PathProgramCache]: Analyzing trace with hash -510719313, now seen corresponding path program 1 times [2018-10-03 08:36:16,900 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:16,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:16,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:16,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:16,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:17,083 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:17,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:36:17,083 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:36:17,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:17,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:17,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:36:17,679 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:17,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:36:17,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-03 08:36:17,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-03 08:36:17,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-03 08:36:17,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-10-03 08:36:17,703 INFO L87 Difference]: Start difference. First operand 852 states and 1203 transitions. Second operand 14 states. [2018-10-03 08:36:19,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:19,356 INFO L93 Difference]: Finished difference Result 1127 states and 1578 transitions. [2018-10-03 08:36:19,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-03 08:36:19,356 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2018-10-03 08:36:19,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:19,360 INFO L225 Difference]: With dead ends: 1127 [2018-10-03 08:36:19,360 INFO L226 Difference]: Without dead ends: 1125 [2018-10-03 08:36:19,361 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=548, Invalid=1432, Unknown=0, NotChecked=0, Total=1980 [2018-10-03 08:36:19,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2018-10-03 08:36:19,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 830. [2018-10-03 08:36:19,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2018-10-03 08:36:19,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1171 transitions. [2018-10-03 08:36:19,670 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1171 transitions. Word has length 22 [2018-10-03 08:36:19,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:19,670 INFO L480 AbstractCegarLoop]: Abstraction has 830 states and 1171 transitions. [2018-10-03 08:36:19,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-03 08:36:19,671 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1171 transitions. [2018-10-03 08:36:19,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-03 08:36:19,672 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:19,672 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:19,672 INFO L423 AbstractCegarLoop]: === Iteration 32 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:19,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:19,673 INFO L82 PathProgramCache]: Analyzing trace with hash 627807824, now seen corresponding path program 1 times [2018-10-03 08:36:19,673 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:19,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:19,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:19,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:19,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:19,816 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:19,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:36:19,816 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:36:19,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:19,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:36:20,032 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:20,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:36:20,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2018-10-03 08:36:20,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-03 08:36:20,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-03 08:36:20,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-10-03 08:36:20,054 INFO L87 Difference]: Start difference. First operand 830 states and 1171 transitions. Second operand 15 states. [2018-10-03 08:36:21,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:21,611 INFO L93 Difference]: Finished difference Result 1072 states and 1499 transitions. [2018-10-03 08:36:21,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-03 08:36:21,611 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-10-03 08:36:21,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:21,615 INFO L225 Difference]: With dead ends: 1072 [2018-10-03 08:36:21,615 INFO L226 Difference]: Without dead ends: 1070 [2018-10-03 08:36:21,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=359, Invalid=973, Unknown=0, NotChecked=0, Total=1332 [2018-10-03 08:36:21,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2018-10-03 08:36:21,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 788. [2018-10-03 08:36:21,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2018-10-03 08:36:21,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1104 transitions. [2018-10-03 08:36:21,921 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1104 transitions. Word has length 22 [2018-10-03 08:36:21,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:21,921 INFO L480 AbstractCegarLoop]: Abstraction has 788 states and 1104 transitions. [2018-10-03 08:36:21,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-03 08:36:21,921 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1104 transitions. [2018-10-03 08:36:21,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-03 08:36:21,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:21,923 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:21,923 INFO L423 AbstractCegarLoop]: === Iteration 33 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:21,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:21,924 INFO L82 PathProgramCache]: Analyzing trace with hash 345073063, now seen corresponding path program 1 times [2018-10-03 08:36:21,924 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:21,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:21,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:21,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:21,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:22,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:22,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:36:22,142 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:36:22,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:22,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:36:22,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:22,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:36:22,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-10-03 08:36:22,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-03 08:36:22,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-03 08:36:22,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-10-03 08:36:22,241 INFO L87 Difference]: Start difference. First operand 788 states and 1104 transitions. Second operand 10 states. [2018-10-03 08:36:23,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:23,577 INFO L93 Difference]: Finished difference Result 1025 states and 1426 transitions. [2018-10-03 08:36:23,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-03 08:36:23,578 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-10-03 08:36:23,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:23,582 INFO L225 Difference]: With dead ends: 1025 [2018-10-03 08:36:23,582 INFO L226 Difference]: Without dead ends: 1023 [2018-10-03 08:36:23,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2018-10-03 08:36:23,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2018-10-03 08:36:23,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 818. [2018-10-03 08:36:23,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2018-10-03 08:36:23,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1149 transitions. [2018-10-03 08:36:23,942 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1149 transitions. Word has length 22 [2018-10-03 08:36:23,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:23,942 INFO L480 AbstractCegarLoop]: Abstraction has 818 states and 1149 transitions. [2018-10-03 08:36:23,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-03 08:36:23,942 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1149 transitions. [2018-10-03 08:36:23,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-03 08:36:23,943 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:23,944 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:23,944 INFO L423 AbstractCegarLoop]: === Iteration 34 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:23,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:23,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1613894486, now seen corresponding path program 1 times [2018-10-03 08:36:23,944 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:23,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:23,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:23,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:23,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:24,105 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:24,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:36:24,105 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:36:24,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:24,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:36:24,236 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:24,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:36:24,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2018-10-03 08:36:24,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-03 08:36:24,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-03 08:36:24,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-10-03 08:36:24,259 INFO L87 Difference]: Start difference. First operand 818 states and 1149 transitions. Second operand 15 states. [2018-10-03 08:36:26,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:26,037 INFO L93 Difference]: Finished difference Result 1057 states and 1481 transitions. [2018-10-03 08:36:26,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-03 08:36:26,037 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-10-03 08:36:26,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:26,041 INFO L225 Difference]: With dead ends: 1057 [2018-10-03 08:36:26,041 INFO L226 Difference]: Without dead ends: 1055 [2018-10-03 08:36:26,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=359, Invalid=973, Unknown=0, NotChecked=0, Total=1332 [2018-10-03 08:36:26,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2018-10-03 08:36:26,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 770. [2018-10-03 08:36:26,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2018-10-03 08:36:26,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1073 transitions. [2018-10-03 08:36:26,328 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1073 transitions. Word has length 22 [2018-10-03 08:36:26,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:26,329 INFO L480 AbstractCegarLoop]: Abstraction has 770 states and 1073 transitions. [2018-10-03 08:36:26,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-03 08:36:26,329 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1073 transitions. [2018-10-03 08:36:26,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-03 08:36:26,330 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:26,330 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:26,330 INFO L423 AbstractCegarLoop]: === Iteration 35 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:26,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:26,330 INFO L82 PathProgramCache]: Analyzing trace with hash -488650854, now seen corresponding path program 1 times [2018-10-03 08:36:26,330 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:26,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:26,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:26,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:26,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:27,003 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:27,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:36:27,004 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:36:27,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:27,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:36:27,139 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:36:27,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:36:27,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-10-03 08:36:27,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-03 08:36:27,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-03 08:36:27,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-10-03 08:36:27,161 INFO L87 Difference]: Start difference. First operand 770 states and 1073 transitions. Second operand 15 states. [2018-10-03 08:36:29,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:29,715 INFO L93 Difference]: Finished difference Result 1779 states and 2438 transitions. [2018-10-03 08:36:29,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-03 08:36:29,716 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-10-03 08:36:29,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:29,721 INFO L225 Difference]: With dead ends: 1779 [2018-10-03 08:36:29,721 INFO L226 Difference]: Without dead ends: 1507 [2018-10-03 08:36:29,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1037, Invalid=3655, Unknown=0, NotChecked=0, Total=4692 [2018-10-03 08:36:29,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2018-10-03 08:36:30,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1174. [2018-10-03 08:36:30,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2018-10-03 08:36:30,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1623 transitions. [2018-10-03 08:36:30,197 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1623 transitions. Word has length 25 [2018-10-03 08:36:30,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:30,198 INFO L480 AbstractCegarLoop]: Abstraction has 1174 states and 1623 transitions. [2018-10-03 08:36:30,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-03 08:36:30,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1623 transitions. [2018-10-03 08:36:30,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-03 08:36:30,199 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:30,199 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:30,200 INFO L423 AbstractCegarLoop]: === Iteration 36 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:30,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:30,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1608047085, now seen corresponding path program 1 times [2018-10-03 08:36:30,200 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:30,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:30,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:30,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:30,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:30,449 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:30,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:36:30,450 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:36:30,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:30,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:36:30,573 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:36:30,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:36:30,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-10-03 08:36:30,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-03 08:36:30,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-03 08:36:30,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-10-03 08:36:30,595 INFO L87 Difference]: Start difference. First operand 1174 states and 1623 transitions. Second operand 15 states. [2018-10-03 08:36:33,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:33,177 INFO L93 Difference]: Finished difference Result 2685 states and 3700 transitions. [2018-10-03 08:36:33,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-03 08:36:33,177 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-10-03 08:36:33,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:33,184 INFO L225 Difference]: With dead ends: 2685 [2018-10-03 08:36:33,184 INFO L226 Difference]: Without dead ends: 1652 [2018-10-03 08:36:33,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=782, Invalid=2758, Unknown=0, NotChecked=0, Total=3540 [2018-10-03 08:36:33,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2018-10-03 08:36:33,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1212. [2018-10-03 08:36:33,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1212 states. [2018-10-03 08:36:33,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1681 transitions. [2018-10-03 08:36:33,714 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1681 transitions. Word has length 25 [2018-10-03 08:36:33,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:33,714 INFO L480 AbstractCegarLoop]: Abstraction has 1212 states and 1681 transitions. [2018-10-03 08:36:33,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-03 08:36:33,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1681 transitions. [2018-10-03 08:36:33,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-03 08:36:33,716 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:33,716 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:33,716 INFO L423 AbstractCegarLoop]: === Iteration 37 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:33,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:33,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1101622072, now seen corresponding path program 1 times [2018-10-03 08:36:33,717 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:33,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:33,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:33,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:33,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:34,658 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:34,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:36:34,659 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:36:34,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:34,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:36:34,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:36:34,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:36:34,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-10-03 08:36:34,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-03 08:36:34,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-03 08:36:34,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-10-03 08:36:34,922 INFO L87 Difference]: Start difference. First operand 1212 states and 1681 transitions. Second operand 15 states. [2018-10-03 08:36:37,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:37,845 INFO L93 Difference]: Finished difference Result 2130 states and 2907 transitions. [2018-10-03 08:36:37,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-03 08:36:37,846 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-10-03 08:36:37,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:37,853 INFO L225 Difference]: With dead ends: 2130 [2018-10-03 08:36:37,853 INFO L226 Difference]: Without dead ends: 1946 [2018-10-03 08:36:37,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1010, Invalid=3546, Unknown=0, NotChecked=0, Total=4556 [2018-10-03 08:36:37,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2018-10-03 08:36:38,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1616. [2018-10-03 08:36:38,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1616 states. [2018-10-03 08:36:38,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2248 transitions. [2018-10-03 08:36:38,519 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2248 transitions. Word has length 25 [2018-10-03 08:36:38,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:38,519 INFO L480 AbstractCegarLoop]: Abstraction has 1616 states and 2248 transitions. [2018-10-03 08:36:38,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-03 08:36:38,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2248 transitions. [2018-10-03 08:36:38,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-03 08:36:38,521 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:38,521 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:38,521 INFO L423 AbstractCegarLoop]: === Iteration 38 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:38,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:38,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1649781575, now seen corresponding path program 1 times [2018-10-03 08:36:38,522 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:38,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:38,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:38,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:38,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:38,623 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:38,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:36:38,624 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:36:38,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:38,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:36:38,763 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:36:38,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:36:38,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-10-03 08:36:38,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-03 08:36:38,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-03 08:36:38,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-10-03 08:36:38,784 INFO L87 Difference]: Start difference. First operand 1616 states and 2248 transitions. Second operand 15 states. [2018-10-03 08:36:41,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:41,788 INFO L93 Difference]: Finished difference Result 3372 states and 4705 transitions. [2018-10-03 08:36:41,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-03 08:36:41,789 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-10-03 08:36:41,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:41,798 INFO L225 Difference]: With dead ends: 3372 [2018-10-03 08:36:41,798 INFO L226 Difference]: Without dead ends: 2040 [2018-10-03 08:36:41,803 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=782, Invalid=2758, Unknown=0, NotChecked=0, Total=3540 [2018-10-03 08:36:41,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2040 states. [2018-10-03 08:36:42,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2040 to 1575. [2018-10-03 08:36:42,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2018-10-03 08:36:42,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2199 transitions. [2018-10-03 08:36:42,421 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2199 transitions. Word has length 25 [2018-10-03 08:36:42,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:42,421 INFO L480 AbstractCegarLoop]: Abstraction has 1575 states and 2199 transitions. [2018-10-03 08:36:42,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-03 08:36:42,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2199 transitions. [2018-10-03 08:36:42,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-03 08:36:42,423 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:42,423 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:42,423 INFO L423 AbstractCegarLoop]: === Iteration 39 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:42,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:42,424 INFO L82 PathProgramCache]: Analyzing trace with hash -664447164, now seen corresponding path program 2 times [2018-10-03 08:36:42,424 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:42,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:42,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:42,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:42,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:42,614 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:42,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:36:42,615 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:36:42,624 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:36:42,674 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:36:42,674 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:36:42,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:36:42,913 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:42,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:36:42,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-10-03 08:36:42,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-03 08:36:42,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-03 08:36:42,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-10-03 08:36:42,934 INFO L87 Difference]: Start difference. First operand 1575 states and 2199 transitions. Second operand 20 states. [2018-10-03 08:36:49,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:49,840 INFO L93 Difference]: Finished difference Result 2646 states and 3763 transitions. [2018-10-03 08:36:49,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-03 08:36:49,840 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2018-10-03 08:36:49,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:49,850 INFO L225 Difference]: With dead ends: 2646 [2018-10-03 08:36:49,850 INFO L226 Difference]: Without dead ends: 2644 [2018-10-03 08:36:49,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4956 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3132, Invalid=9524, Unknown=0, NotChecked=0, Total=12656 [2018-10-03 08:36:49,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2644 states. [2018-10-03 08:36:50,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2644 to 1833. [2018-10-03 08:36:50,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1833 states. [2018-10-03 08:36:50,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2576 transitions. [2018-10-03 08:36:50,601 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2576 transitions. Word has length 29 [2018-10-03 08:36:50,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:50,602 INFO L480 AbstractCegarLoop]: Abstraction has 1833 states and 2576 transitions. [2018-10-03 08:36:50,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-03 08:36:50,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2576 transitions. [2018-10-03 08:36:50,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-03 08:36:50,604 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:50,604 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:50,604 INFO L423 AbstractCegarLoop]: === Iteration 40 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:50,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:50,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1030242552, now seen corresponding path program 2 times [2018-10-03 08:36:50,604 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:50,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:50,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:50,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:36:50,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:50,796 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:50,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:36:50,797 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:36:50,804 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:36:50,855 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:36:50,856 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:36:50,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:36:51,295 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:51,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:36:51,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2018-10-03 08:36:51,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-03 08:36:51,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-03 08:36:51,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-10-03 08:36:51,317 INFO L87 Difference]: Start difference. First operand 1833 states and 2576 transitions. Second operand 21 states. [2018-10-03 08:36:58,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:58,225 INFO L93 Difference]: Finished difference Result 2887 states and 4117 transitions. [2018-10-03 08:36:58,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-03 08:36:58,225 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2018-10-03 08:36:58,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:58,231 INFO L225 Difference]: With dead ends: 2887 [2018-10-03 08:36:58,231 INFO L226 Difference]: Without dead ends: 2885 [2018-10-03 08:36:58,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 5023 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3166, Invalid=9716, Unknown=0, NotChecked=0, Total=12882 [2018-10-03 08:36:58,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2885 states. [2018-10-03 08:36:59,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2885 to 2102. [2018-10-03 08:36:59,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states. [2018-10-03 08:36:59,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 2970 transitions. [2018-10-03 08:36:59,035 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 2970 transitions. Word has length 29 [2018-10-03 08:36:59,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:59,036 INFO L480 AbstractCegarLoop]: Abstraction has 2102 states and 2970 transitions. [2018-10-03 08:36:59,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-03 08:36:59,036 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 2970 transitions. [2018-10-03 08:36:59,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-03 08:36:59,038 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:59,038 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:59,039 INFO L423 AbstractCegarLoop]: === Iteration 41 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:59,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:59,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1174012687, now seen corresponding path program 2 times [2018-10-03 08:36:59,039 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:59,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:59,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:59,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:36:59,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:59,531 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-03 08:36:59,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:36:59,531 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:36:59,540 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:36:59,597 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:36:59,597 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:36:59,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:37:00,029 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:37:00,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:37:00,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-03 08:37:00,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-03 08:37:00,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-03 08:37:00,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-10-03 08:37:00,051 INFO L87 Difference]: Start difference. First operand 2102 states and 2970 transitions. Second operand 16 states. [2018-10-03 08:37:05,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:37:05,576 INFO L93 Difference]: Finished difference Result 6948 states and 9725 transitions. [2018-10-03 08:37:05,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-10-03 08:37:05,576 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-10-03 08:37:05,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:37:05,588 INFO L225 Difference]: With dead ends: 6948 [2018-10-03 08:37:05,588 INFO L226 Difference]: Without dead ends: 4896 [2018-10-03 08:37:05,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6484 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2880, Invalid=14150, Unknown=0, NotChecked=0, Total=17030 [2018-10-03 08:37:05,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4896 states. [2018-10-03 08:37:07,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4896 to 3634. [2018-10-03 08:37:07,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3634 states. [2018-10-03 08:37:07,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3634 states to 3634 states and 5080 transitions. [2018-10-03 08:37:07,029 INFO L78 Accepts]: Start accepts. Automaton has 3634 states and 5080 transitions. Word has length 33 [2018-10-03 08:37:07,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:37:07,029 INFO L480 AbstractCegarLoop]: Abstraction has 3634 states and 5080 transitions. [2018-10-03 08:37:07,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-03 08:37:07,029 INFO L276 IsEmpty]: Start isEmpty. Operand 3634 states and 5080 transitions. [2018-10-03 08:37:07,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-03 08:37:07,032 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:37:07,032 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:37:07,032 INFO L423 AbstractCegarLoop]: === Iteration 42 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:37:07,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:37:07,032 INFO L82 PathProgramCache]: Analyzing trace with hash -2110003385, now seen corresponding path program 1 times [2018-10-03 08:37:07,032 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:37:07,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:37:07,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:37:07,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:37:07,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:37:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:37:07,217 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:37:07,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:37:07,218 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:37:07,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:37:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:37:07,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:37:07,396 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-03 08:37:07,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:37:07,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2018-10-03 08:37:07,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-03 08:37:07,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-03 08:37:07,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-10-03 08:37:07,419 INFO L87 Difference]: Start difference. First operand 3634 states and 5080 transitions. Second operand 18 states. [2018-10-03 08:37:14,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:37:14,008 INFO L93 Difference]: Finished difference Result 5436 states and 7576 transitions. [2018-10-03 08:37:14,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-03 08:37:14,009 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2018-10-03 08:37:14,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:37:14,022 INFO L225 Difference]: With dead ends: 5436 [2018-10-03 08:37:14,022 INFO L226 Difference]: Without dead ends: 5349 [2018-10-03 08:37:14,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2508 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1401, Invalid=6609, Unknown=0, NotChecked=0, Total=8010 [2018-10-03 08:37:14,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5349 states. [2018-10-03 08:37:15,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5349 to 4022. [2018-10-03 08:37:15,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4022 states. [2018-10-03 08:37:15,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4022 states to 4022 states and 5648 transitions. [2018-10-03 08:37:15,776 INFO L78 Accepts]: Start accepts. Automaton has 4022 states and 5648 transitions. Word has length 33 [2018-10-03 08:37:15,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:37:15,777 INFO L480 AbstractCegarLoop]: Abstraction has 4022 states and 5648 transitions. [2018-10-03 08:37:15,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-03 08:37:15,777 INFO L276 IsEmpty]: Start isEmpty. Operand 4022 states and 5648 transitions. [2018-10-03 08:37:15,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-03 08:37:15,780 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:37:15,780 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:37:15,780 INFO L423 AbstractCegarLoop]: === Iteration 43 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:37:15,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:37:15,780 INFO L82 PathProgramCache]: Analyzing trace with hash -895180230, now seen corresponding path program 3 times [2018-10-03 08:37:15,781 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:37:15,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:37:15,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:37:15,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:37:15,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:37:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:37:16,134 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:37:16,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:37:16,135 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:37:16,143 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 08:37:16,201 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-03 08:37:16,201 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:37:16,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:37:17,181 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-03 08:37:17,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:37:17,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2018-10-03 08:37:17,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-03 08:37:17,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-03 08:37:17,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2018-10-03 08:37:17,203 INFO L87 Difference]: Start difference. First operand 4022 states and 5648 transitions. Second operand 22 states. [2018-10-03 08:37:29,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:37:29,105 INFO L93 Difference]: Finished difference Result 8032 states and 11417 transitions. [2018-10-03 08:37:29,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-03 08:37:29,105 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 33 [2018-10-03 08:37:29,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:37:29,128 INFO L225 Difference]: With dead ends: 8032 [2018-10-03 08:37:29,128 INFO L226 Difference]: Without dead ends: 7935 [2018-10-03 08:37:29,134 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8181 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=4070, Invalid=17686, Unknown=0, NotChecked=0, Total=21756 [2018-10-03 08:37:29,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7935 states. [2018-10-03 08:37:31,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7935 to 4327. [2018-10-03 08:37:31,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4327 states. [2018-10-03 08:37:31,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4327 states to 4327 states and 6121 transitions. [2018-10-03 08:37:31,230 INFO L78 Accepts]: Start accepts. Automaton has 4327 states and 6121 transitions. Word has length 33 [2018-10-03 08:37:31,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:37:31,230 INFO L480 AbstractCegarLoop]: Abstraction has 4327 states and 6121 transitions. [2018-10-03 08:37:31,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-03 08:37:31,230 INFO L276 IsEmpty]: Start isEmpty. Operand 4327 states and 6121 transitions. [2018-10-03 08:37:31,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-03 08:37:31,233 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:37:31,234 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:37:31,234 INFO L423 AbstractCegarLoop]: === Iteration 44 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:37:31,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:37:31,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1250173630, now seen corresponding path program 1 times [2018-10-03 08:37:31,234 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:37:31,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:37:31,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:37:31,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:37:31,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:37:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:37:31,463 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:37:31,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:37:31,464 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:37:31,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:37:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:37:31,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:37:31,813 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:37:31,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:37:31,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2018-10-03 08:37:31,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-03 08:37:31,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-03 08:37:31,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-10-03 08:37:31,835 INFO L87 Difference]: Start difference. First operand 4327 states and 6121 transitions. Second operand 19 states. [2018-10-03 08:37:40,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:37:40,033 INFO L93 Difference]: Finished difference Result 9177 states and 12958 transitions. [2018-10-03 08:37:40,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-10-03 08:37:40,033 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2018-10-03 08:37:40,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:37:40,046 INFO L225 Difference]: With dead ends: 9177 [2018-10-03 08:37:40,046 INFO L226 Difference]: Without dead ends: 5991 [2018-10-03 08:37:40,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4514 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2969, Invalid=11311, Unknown=0, NotChecked=0, Total=14280 [2018-10-03 08:37:40,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5991 states. [2018-10-03 08:37:41,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5991 to 4147. [2018-10-03 08:37:41,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4147 states. [2018-10-03 08:37:41,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4147 states to 4147 states and 5817 transitions. [2018-10-03 08:37:41,949 INFO L78 Accepts]: Start accepts. Automaton has 4147 states and 5817 transitions. Word has length 33 [2018-10-03 08:37:41,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:37:41,949 INFO L480 AbstractCegarLoop]: Abstraction has 4147 states and 5817 transitions. [2018-10-03 08:37:41,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-03 08:37:41,949 INFO L276 IsEmpty]: Start isEmpty. Operand 4147 states and 5817 transitions. [2018-10-03 08:37:41,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-03 08:37:41,953 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:37:41,953 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:37:41,954 INFO L423 AbstractCegarLoop]: === Iteration 45 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:37:41,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:37:41,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1810158453, now seen corresponding path program 2 times [2018-10-03 08:37:41,954 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:37:41,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:37:41,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:37:41,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:37:41,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:37:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:37:42,747 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:37:42,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:37:42,747 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:37:42,755 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:37:42,816 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:37:42,816 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:37:42,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:37:42,949 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:37:42,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:37:42,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 17 [2018-10-03 08:37:42,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-03 08:37:42,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-03 08:37:42,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2018-10-03 08:37:42,970 INFO L87 Difference]: Start difference. First operand 4147 states and 5817 transitions. Second operand 18 states. [2018-10-03 08:37:48,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:37:48,295 INFO L93 Difference]: Finished difference Result 5255 states and 7327 transitions. [2018-10-03 08:37:48,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-03 08:37:48,296 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2018-10-03 08:37:48,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:37:48,305 INFO L225 Difference]: With dead ends: 5255 [2018-10-03 08:37:48,305 INFO L226 Difference]: Without dead ends: 5253 [2018-10-03 08:37:48,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=346, Invalid=1460, Unknown=0, NotChecked=0, Total=1806 [2018-10-03 08:37:48,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5253 states. [2018-10-03 08:37:50,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5253 to 4447. [2018-10-03 08:37:50,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4447 states. [2018-10-03 08:37:50,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4447 states to 4447 states and 6228 transitions. [2018-10-03 08:37:50,387 INFO L78 Accepts]: Start accepts. Automaton has 4447 states and 6228 transitions. Word has length 33 [2018-10-03 08:37:50,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:37:50,387 INFO L480 AbstractCegarLoop]: Abstraction has 4447 states and 6228 transitions. [2018-10-03 08:37:50,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-03 08:37:50,387 INFO L276 IsEmpty]: Start isEmpty. Operand 4447 states and 6228 transitions. [2018-10-03 08:37:50,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-03 08:37:50,390 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:37:50,390 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:37:50,391 INFO L423 AbstractCegarLoop]: === Iteration 46 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:37:50,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:37:50,391 INFO L82 PathProgramCache]: Analyzing trace with hash -667748710, now seen corresponding path program 1 times [2018-10-03 08:37:50,391 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:37:50,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:37:50,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:37:50,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:37:50,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:37:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:37:50,523 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:37:50,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:37:50,523 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:37:50,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:37:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:37:50,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:37:50,715 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-03 08:37:50,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:37:50,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2018-10-03 08:37:50,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-03 08:37:50,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-03 08:37:50,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-10-03 08:37:50,737 INFO L87 Difference]: Start difference. First operand 4447 states and 6228 transitions. Second operand 18 states. [2018-10-03 08:38:01,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:38:01,141 INFO L93 Difference]: Finished difference Result 7721 states and 10805 transitions. [2018-10-03 08:38:01,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-03 08:38:01,141 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2018-10-03 08:38:01,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:38:01,153 INFO L225 Difference]: With dead ends: 7721 [2018-10-03 08:38:01,153 INFO L226 Difference]: Without dead ends: 7719 [2018-10-03 08:38:01,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3331 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1278, Invalid=8228, Unknown=0, NotChecked=0, Total=9506 [2018-10-03 08:38:01,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7719 states. [2018-10-03 08:38:03,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7719 to 5438. [2018-10-03 08:38:03,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5438 states. [2018-10-03 08:38:03,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5438 states to 5438 states and 7651 transitions. [2018-10-03 08:38:03,871 INFO L78 Accepts]: Start accepts. Automaton has 5438 states and 7651 transitions. Word has length 33 [2018-10-03 08:38:03,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:38:03,872 INFO L480 AbstractCegarLoop]: Abstraction has 5438 states and 7651 transitions. [2018-10-03 08:38:03,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-03 08:38:03,872 INFO L276 IsEmpty]: Start isEmpty. Operand 5438 states and 7651 transitions. [2018-10-03 08:38:03,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-03 08:38:03,875 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:38:03,875 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:38:03,876 INFO L423 AbstractCegarLoop]: === Iteration 47 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:38:03,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:38:03,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1146614399, now seen corresponding path program 2 times [2018-10-03 08:38:03,876 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:38:03,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:38:03,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:38:03,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:38:03,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:38:03,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:38:03,963 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-03 08:38:03,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:38:03,963 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:38:03,971 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:38:04,026 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:38:04,026 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:38:04,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:38:04,118 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:38:04,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:38:04,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-03 08:38:04,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-03 08:38:04,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-03 08:38:04,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-10-03 08:38:04,140 INFO L87 Difference]: Start difference. First operand 5438 states and 7651 transitions. Second operand 16 states. [2018-10-03 08:38:07,812 WARN L178 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-03 08:38:08,219 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-03 08:38:08,551 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-03 08:38:13,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:38:13,704 INFO L93 Difference]: Finished difference Result 15976 states and 22278 transitions. [2018-10-03 08:38:13,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-10-03 08:38:13,705 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-10-03 08:38:13,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:38:13,717 INFO L225 Difference]: With dead ends: 15976 [2018-10-03 08:38:13,718 INFO L226 Difference]: Without dead ends: 10483 [2018-10-03 08:38:13,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6466 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2880, Invalid=14150, Unknown=0, NotChecked=0, Total=17030 [2018-10-03 08:38:13,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10483 states. [2018-10-03 08:38:17,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10483 to 8111. [2018-10-03 08:38:17,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8111 states. [2018-10-03 08:38:17,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8111 states to 8111 states and 11260 transitions. [2018-10-03 08:38:17,537 INFO L78 Accepts]: Start accepts. Automaton has 8111 states and 11260 transitions. Word has length 33 [2018-10-03 08:38:17,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:38:17,538 INFO L480 AbstractCegarLoop]: Abstraction has 8111 states and 11260 transitions. [2018-10-03 08:38:17,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-03 08:38:17,538 INFO L276 IsEmpty]: Start isEmpty. Operand 8111 states and 11260 transitions. [2018-10-03 08:38:17,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-03 08:38:17,542 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:38:17,542 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:38:17,542 INFO L423 AbstractCegarLoop]: === Iteration 48 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:38:17,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:38:17,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1449531796, now seen corresponding path program 1 times [2018-10-03 08:38:17,542 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:38:17,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:38:17,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:38:17,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:38:17,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:38:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:38:17,856 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:38:17,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:38:17,857 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:38:17,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:38:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:38:17,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:38:18,034 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-03 08:38:18,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:38:18,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-10-03 08:38:18,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-03 08:38:18,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-03 08:38:18,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-10-03 08:38:18,056 INFO L87 Difference]: Start difference. First operand 8111 states and 11260 transitions. Second operand 19 states. [2018-10-03 08:38:26,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:38:26,686 INFO L93 Difference]: Finished difference Result 10277 states and 14246 transitions. [2018-10-03 08:38:26,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-03 08:38:26,686 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2018-10-03 08:38:26,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:38:26,700 INFO L225 Difference]: With dead ends: 10277 [2018-10-03 08:38:26,700 INFO L226 Difference]: Without dead ends: 10275 [2018-10-03 08:38:26,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=978, Invalid=4424, Unknown=0, NotChecked=0, Total=5402 [2018-10-03 08:38:26,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10275 states. [2018-10-03 08:38:30,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10275 to 8291. [2018-10-03 08:38:30,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8291 states. [2018-10-03 08:38:30,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8291 states to 8291 states and 11531 transitions. [2018-10-03 08:38:30,803 INFO L78 Accepts]: Start accepts. Automaton has 8291 states and 11531 transitions. Word has length 33 [2018-10-03 08:38:30,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:38:30,803 INFO L480 AbstractCegarLoop]: Abstraction has 8291 states and 11531 transitions. [2018-10-03 08:38:30,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-03 08:38:30,804 INFO L276 IsEmpty]: Start isEmpty. Operand 8291 states and 11531 transitions. [2018-10-03 08:38:30,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-03 08:38:30,809 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:38:30,809 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:38:30,809 INFO L423 AbstractCegarLoop]: === Iteration 49 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:38:30,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:38:30,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1026480992, now seen corresponding path program 1 times [2018-10-03 08:38:30,809 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:38:30,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:38:30,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:38:30,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:38:30,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:38:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:38:31,017 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:38:31,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:38:31,018 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:38:31,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:38:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:38:31,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:38:31,182 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:38:31,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:38:31,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2018-10-03 08:38:31,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-03 08:38:31,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-03 08:38:31,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-10-03 08:38:31,203 INFO L87 Difference]: Start difference. First operand 8291 states and 11531 transitions. Second operand 19 states. [2018-10-03 08:38:41,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:38:41,576 INFO L93 Difference]: Finished difference Result 16294 states and 22694 transitions. [2018-10-03 08:38:41,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-03 08:38:41,577 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2018-10-03 08:38:41,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:38:41,591 INFO L225 Difference]: With dead ends: 16294 [2018-10-03 08:38:41,591 INFO L226 Difference]: Without dead ends: 9999 [2018-10-03 08:38:41,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4530 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2859, Invalid=11183, Unknown=0, NotChecked=0, Total=14042 [2018-10-03 08:38:41,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9999 states. [2018-10-03 08:38:45,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9999 to 8241. [2018-10-03 08:38:45,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8241 states. [2018-10-03 08:38:45,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8241 states to 8241 states and 11466 transitions. [2018-10-03 08:38:45,802 INFO L78 Accepts]: Start accepts. Automaton has 8241 states and 11466 transitions. Word has length 33 [2018-10-03 08:38:45,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:38:45,803 INFO L480 AbstractCegarLoop]: Abstraction has 8241 states and 11466 transitions. [2018-10-03 08:38:45,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-03 08:38:45,803 INFO L276 IsEmpty]: Start isEmpty. Operand 8241 states and 11466 transitions. [2018-10-03 08:38:45,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-03 08:38:45,807 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:38:45,807 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:38:45,807 INFO L423 AbstractCegarLoop]: === Iteration 50 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:38:45,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:38:45,807 INFO L82 PathProgramCache]: Analyzing trace with hash 610357864, now seen corresponding path program 3 times [2018-10-03 08:38:45,807 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:38:45,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:38:45,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:38:45,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:38:45,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:38:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:38:46,135 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:38:46,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:38:46,136 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:38:46,144 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 08:38:46,202 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-03 08:38:46,202 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:38:46,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:38:46,317 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:38:46,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:38:46,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 21 [2018-10-03 08:38:46,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-03 08:38:46,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-03 08:38:46,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2018-10-03 08:38:46,338 INFO L87 Difference]: Start difference. First operand 8241 states and 11466 transitions. Second operand 21 states. [2018-10-03 08:38:51,167 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2018-10-03 08:39:06,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:39:06,997 INFO L93 Difference]: Finished difference Result 25684 states and 35500 transitions. [2018-10-03 08:39:06,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-10-03 08:39:06,998 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2018-10-03 08:39:06,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:39:07,016 INFO L225 Difference]: With dead ends: 25684 [2018-10-03 08:39:07,017 INFO L226 Difference]: Without dead ends: 16698 [2018-10-03 08:39:07,038 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18096 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=6678, Invalid=35142, Unknown=0, NotChecked=0, Total=41820 [2018-10-03 08:39:07,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16698 states. [2018-10-03 08:39:11,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16698 to 10011. [2018-10-03 08:39:11,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10011 states. [2018-10-03 08:39:11,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10011 states to 10011 states and 13930 transitions. [2018-10-03 08:39:11,986 INFO L78 Accepts]: Start accepts. Automaton has 10011 states and 13930 transitions. Word has length 33 [2018-10-03 08:39:11,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:39:11,986 INFO L480 AbstractCegarLoop]: Abstraction has 10011 states and 13930 transitions. [2018-10-03 08:39:11,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-03 08:39:11,986 INFO L276 IsEmpty]: Start isEmpty. Operand 10011 states and 13930 transitions. [2018-10-03 08:39:11,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-03 08:39:11,991 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:39:11,991 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:39:11,991 INFO L423 AbstractCegarLoop]: === Iteration 51 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:39:11,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:39:11,991 INFO L82 PathProgramCache]: Analyzing trace with hash 690693469, now seen corresponding path program 1 times [2018-10-03 08:39:11,992 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:39:11,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:39:11,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:39:11,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:39:11,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:39:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:39:12,132 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:39:12,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:39:12,133 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:39:12,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:39:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:39:12,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:39:12,375 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-03 08:39:12,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:39:12,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-10-03 08:39:12,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-03 08:39:12,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-03 08:39:12,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2018-10-03 08:39:12,397 INFO L87 Difference]: Start difference. First operand 10011 states and 13930 transitions. Second operand 21 states. [2018-10-03 08:39:24,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:39:24,739 INFO L93 Difference]: Finished difference Result 12668 states and 17557 transitions. [2018-10-03 08:39:24,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-03 08:39:24,740 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2018-10-03 08:39:24,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:39:24,754 INFO L225 Difference]: With dead ends: 12668 [2018-10-03 08:39:24,754 INFO L226 Difference]: Without dead ends: 12586 [2018-10-03 08:39:24,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2220 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=841, Invalid=6131, Unknown=0, NotChecked=0, Total=6972 [2018-10-03 08:39:24,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12586 states. Received shutdown request... [2018-10-03 08:39:30,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12586 to 10468. [2018-10-03 08:39:30,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10468 states. [2018-10-03 08:39:30,250 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-03 08:39:30,256 WARN L205 ceAbstractionStarter]: Timeout [2018-10-03 08:39:30,256 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 08:39:30 BoogieIcfgContainer [2018-10-03 08:39:30,256 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-03 08:39:30,257 INFO L168 Benchmark]: Toolchain (without parser) took 253092.08 ms. Allocated memory was 1.6 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-10-03 08:39:30,258 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 08:39:30,258 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.41 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 08:39:30,258 INFO L168 Benchmark]: Boogie Preprocessor took 23.64 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 08:39:30,259 INFO L168 Benchmark]: RCFGBuilder took 649.71 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-03 08:39:30,259 INFO L168 Benchmark]: TraceAbstraction took 252367.54 ms. Allocated memory was 1.6 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-10-03 08:39:30,262 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.41 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.64 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 649.71 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 252367.54 ms. Allocated memory was 1.6 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 66). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 99). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 121]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 121). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 112]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 112). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 48 locations, 4 error locations. TIMEOUT Result, 252.2s OverallTime, 51 OverallIterations, 4 TraceHistogramMax, 185.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3758 SDtfs, 10438 SDslu, 7427 SDs, 0 SdLazy, 52271 SolverSat, 14023 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 53.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3857 GetRequests, 1041 SyntacticMatches, 11 SemanticMatches, 2805 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 85743 ImplicationChecksByTransitivity, 73.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10011occurred in iteration=50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 43.3s AutomataMinimizationTime, 51 MinimizatonAttempts, 32101 StatesRemovedByMinimization, 50 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 19.4s InterpolantComputationTime, 2108 NumberOfCodeBlocks, 2108 NumberOfCodeBlocksAsserted, 108 NumberOfCheckSat, 2009 ConstructedInterpolants, 32 QuantifiedInterpolants, 222893 SizeOfPredicates, 797 NumberOfNonLiveVariables, 14213 ConjunctsInSsa, 1503 ConjunctsInUnsatCore, 99 InterpolantComputations, 9 PerfectInterpolantSequences, 199/778 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/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product_WithProcedures.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-03_08-39-30-272.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product_WithProcedures.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-03_08-39-30-272.csv Completed graceful shutdown