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_PUPT.epf -i ../../../trunk/examples/programs/real-life/threadpooling_product.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:24:50,744 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:24:50,746 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:24:50,762 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:24:50,763 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:24:50,764 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:24:50,766 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:24:50,769 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:24:50,771 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:24:50,773 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:24:50,774 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:24:50,776 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:24:50,777 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:24:50,779 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:24:50,786 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:24:50,787 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:24:50,790 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:24:50,791 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:24:50,795 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:24:50,799 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:24:50,800 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:24:50,801 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:24:50,804 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:24:50,804 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:24:50,804 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:24:50,805 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:24:50,806 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:24:50,807 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:24:50,808 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:24:50,811 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:24:50,811 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:24:50,812 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:24:50,812 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:24:50,812 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:24:50,813 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:24:50,816 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:24:50,816 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-01 00:24:50,836 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:24:50,839 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:24:50,840 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:24:50,840 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:24:50,840 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:24:50,841 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:24:50,841 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:24:50,841 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:24:50,841 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:24:50,842 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:24:50,843 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:24:50,843 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:24:50,843 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:24:50,843 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:24:50,843 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:24:50,843 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:24:50,844 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:24:50,844 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:24:50,844 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:24:50,844 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:24:50,844 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:24:50,845 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:24:50,845 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:24:50,845 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:24:50,845 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:24:50,845 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:24:50,845 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:24:50,846 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:24:50,846 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:24:50,846 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:24:50,846 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:24:50,903 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:24:50,915 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:24:50,918 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:24:50,920 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:24:50,921 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:24:50,921 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product.bpl [2018-10-01 00:24:50,922 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product.bpl' [2018-10-01 00:24:50,977 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:24:50,980 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:24:50,981 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:24:50,981 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:24:50,982 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:24:51,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:50" (1/1) ... [2018-10-01 00:24:51,016 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:50" (1/1) ... [2018-10-01 00:24:51,021 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-01 00:24:51,021 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-01 00:24:51,021 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-01 00:24:51,023 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:24:51,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:24:51,024 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:24:51,025 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:24:51,037 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:50" (1/1) ... [2018-10-01 00:24:51,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:50" (1/1) ... [2018-10-01 00:24:51,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:50" (1/1) ... [2018-10-01 00:24:51,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:50" (1/1) ... [2018-10-01 00:24:51,041 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:50" (1/1) ... [2018-10-01 00:24:51,045 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:50" (1/1) ... [2018-10-01 00:24:51,046 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:50" (1/1) ... [2018-10-01 00:24:51,048 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:24:51,048 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:24:51,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:24:51,049 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:24:51,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:50" (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-01 00:24:51,127 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-10-01 00:24:51,127 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-10-01 00:24:51,127 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-10-01 00:24:51,738 INFO L345 CfgBuilder]: Using library mode [2018-10-01 00:24:51,739 INFO L202 PluginConnector]: Adding new model threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:24:51 BoogieIcfgContainer [2018-10-01 00:24:51,739 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:24:51,740 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:24:51,740 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:24:51,744 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:24:51,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:50" (1/2) ... [2018-10-01 00:24:51,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cff90ea and model type threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:24:51, skipping insertion in model container [2018-10-01 00:24:51,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:24:51" (2/2) ... [2018-10-01 00:24:51,748 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product.bpl [2018-10-01 00:24:51,759 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:24:51,768 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-10-01 00:24:51,825 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:24:51,826 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:24:51,826 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:24:51,826 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:24:51,826 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:24:51,826 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:24:51,827 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:24:51,827 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:24:51,827 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:24:51,845 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-10-01 00:24:51,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-01 00:24:51,852 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:51,853 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-01 00:24:51,854 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:51,861 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:51,862 INFO L82 PathProgramCache]: Analyzing trace with hash 28755683, now seen corresponding path program 1 times [2018-10-01 00:24:51,864 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:51,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:51,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:51,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:51,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:52,167 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-01 00:24:52,169 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:52,170 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:24:52,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:24:52,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:24:52,188 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:52,189 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2018-10-01 00:24:53,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:53,908 INFO L93 Difference]: Finished difference Result 49 states and 85 transitions. [2018-10-01 00:24:53,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-01 00:24:53,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-01 00:24:53,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:53,927 INFO L225 Difference]: With dead ends: 49 [2018-10-01 00:24:53,927 INFO L226 Difference]: Without dead ends: 47 [2018-10-01 00:24:53,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:24:53,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-01 00:24:53,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2018-10-01 00:24:53,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-01 00:24:53,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2018-10-01 00:24:53,974 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 5 [2018-10-01 00:24:53,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:53,975 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2018-10-01 00:24:53,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:24:53,975 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2018-10-01 00:24:53,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-01 00:24:53,976 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:53,976 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-01 00:24:53,977 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:53,977 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:53,978 INFO L82 PathProgramCache]: Analyzing trace with hash 28971747, now seen corresponding path program 1 times [2018-10-01 00:24:53,978 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:53,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:53,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:53,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:53,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:54,061 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-01 00:24:54,061 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:54,061 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:24:54,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:24:54,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:24:54,064 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:54,064 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 5 states. [2018-10-01 00:24:54,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:54,770 INFO L93 Difference]: Finished difference Result 57 states and 99 transitions. [2018-10-01 00:24:54,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-01 00:24:54,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-01 00:24:54,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:54,774 INFO L225 Difference]: With dead ends: 57 [2018-10-01 00:24:54,774 INFO L226 Difference]: Without dead ends: 55 [2018-10-01 00:24:54,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:24:54,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-01 00:24:54,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2018-10-01 00:24:54,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-01 00:24:54,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 63 transitions. [2018-10-01 00:24:54,785 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 63 transitions. Word has length 5 [2018-10-01 00:24:54,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:54,785 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 63 transitions. [2018-10-01 00:24:54,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:24:54,785 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 63 transitions. [2018-10-01 00:24:54,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-01 00:24:54,786 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:54,786 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:24:54,787 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:54,787 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:54,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1864688358, now seen corresponding path program 1 times [2018-10-01 00:24:54,788 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:54,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:54,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:54,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:54,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:54,921 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-01 00:24:54,921 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:54,922 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-01 00:24:54,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:24:54,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:24:54,923 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:54,923 INFO L87 Difference]: Start difference. First operand 38 states and 63 transitions. Second operand 7 states. [2018-10-01 00:24:56,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:56,370 INFO L93 Difference]: Finished difference Result 84 states and 147 transitions. [2018-10-01 00:24:56,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-01 00:24:56,371 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-10-01 00:24:56,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:56,374 INFO L225 Difference]: With dead ends: 84 [2018-10-01 00:24:56,374 INFO L226 Difference]: Without dead ends: 82 [2018-10-01 00:24:56,375 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:24:56,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-01 00:24:56,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 51. [2018-10-01 00:24:56,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-01 00:24:56,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 86 transitions. [2018-10-01 00:24:56,388 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 86 transitions. Word has length 7 [2018-10-01 00:24:56,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:56,388 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 86 transitions. [2018-10-01 00:24:56,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:24:56,388 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 86 transitions. [2018-10-01 00:24:56,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-01 00:24:56,389 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:56,390 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-10-01 00:24:56,390 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:56,390 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:56,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1865765160, now seen corresponding path program 1 times [2018-10-01 00:24:56,391 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:56,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:56,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:56,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:56,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:56,526 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-01 00:24:56,527 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:24:56,527 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-01 00:24:56,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:56,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:24:56,646 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-01 00:24:56,668 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-01 00:24:56,668 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2018-10-01 00:24:56,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:24:56,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:24:56,669 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:56,670 INFO L87 Difference]: Start difference. First operand 51 states and 86 transitions. Second operand 9 states. [2018-10-01 00:24:59,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:59,064 INFO L93 Difference]: Finished difference Result 142 states and 245 transitions. [2018-10-01 00:24:59,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-01 00:24:59,065 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2018-10-01 00:24:59,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:59,067 INFO L225 Difference]: With dead ends: 142 [2018-10-01 00:24:59,067 INFO L226 Difference]: Without dead ends: 108 [2018-10-01 00:24:59,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:24:59,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-01 00:24:59,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 73. [2018-10-01 00:24:59,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-01 00:24:59,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 120 transitions. [2018-10-01 00:24:59,084 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 120 transitions. Word has length 7 [2018-10-01 00:24:59,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:59,084 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 120 transitions. [2018-10-01 00:24:59,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:24:59,084 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 120 transitions. [2018-10-01 00:24:59,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 00:24:59,085 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:59,086 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:24:59,086 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:59,086 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:59,086 INFO L82 PathProgramCache]: Analyzing trace with hash 964893579, now seen corresponding path program 1 times [2018-10-01 00:24:59,087 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:59,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:59,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:59,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:59,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:59,222 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-01 00:24:59,223 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:24:59,223 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-01 00:24:59,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:59,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:24:59,298 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-01 00:24:59,321 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-01 00:24:59,321 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 10 [2018-10-01 00:24:59,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-01 00:24:59,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-01 00:24:59,323 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:59,323 INFO L87 Difference]: Start difference. First operand 73 states and 120 transitions. Second operand 11 states. [2018-10-01 00:25:02,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:02,624 INFO L93 Difference]: Finished difference Result 148 states and 240 transitions. [2018-10-01 00:25:02,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-01 00:25:02,625 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2018-10-01 00:25:02,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:02,627 INFO L225 Difference]: With dead ends: 148 [2018-10-01 00:25:02,627 INFO L226 Difference]: Without dead ends: 97 [2018-10-01 00:25:02,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:25:02,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-01 00:25:02,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2018-10-01 00:25:02,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-01 00:25:02,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 119 transitions. [2018-10-01 00:25:02,644 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 119 transitions. Word has length 9 [2018-10-01 00:25:02,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:02,645 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 119 transitions. [2018-10-01 00:25:02,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-01 00:25:02,645 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 119 transitions. [2018-10-01 00:25:02,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-01 00:25:02,646 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:02,646 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:02,646 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:02,647 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:02,647 INFO L82 PathProgramCache]: Analyzing trace with hash 101966393, now seen corresponding path program 1 times [2018-10-01 00:25:02,647 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:02,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:02,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:02,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:02,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:02,758 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-01 00:25:02,758 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:02,758 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-01 00:25:02,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:02,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:02,905 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-01 00:25:02,928 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:02,928 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-01 00:25:02,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:25:02,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:25:02,929 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:02,929 INFO L87 Difference]: Start difference. First operand 78 states and 119 transitions. Second operand 14 states. [2018-10-01 00:25:05,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:05,399 INFO L93 Difference]: Finished difference Result 124 states and 193 transitions. [2018-10-01 00:25:05,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-01 00:25:05,400 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-01 00:25:05,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:05,401 INFO L225 Difference]: With dead ends: 124 [2018-10-01 00:25:05,402 INFO L226 Difference]: Without dead ends: 123 [2018-10-01 00:25:05,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:25:05,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-01 00:25:05,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 107. [2018-10-01 00:25:05,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-01 00:25:05,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 173 transitions. [2018-10-01 00:25:05,425 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 173 transitions. Word has length 10 [2018-10-01 00:25:05,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:05,426 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 173 transitions. [2018-10-01 00:25:05,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:25:05,426 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 173 transitions. [2018-10-01 00:25:05,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-01 00:25:05,427 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:05,427 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:05,428 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:05,428 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:05,428 INFO L82 PathProgramCache]: Analyzing trace with hash 103259259, now seen corresponding path program 1 times [2018-10-01 00:25:05,428 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:05,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:05,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:05,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:05,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:05,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:05,524 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:25:05,524 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:25:05,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:25:05,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:25:05,525 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:05,525 INFO L87 Difference]: Start difference. First operand 107 states and 173 transitions. Second operand 8 states. [2018-10-01 00:25:06,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:06,937 INFO L93 Difference]: Finished difference Result 132 states and 203 transitions. [2018-10-01 00:25:06,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-01 00:25:06,937 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-10-01 00:25:06,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:06,938 INFO L225 Difference]: With dead ends: 132 [2018-10-01 00:25:06,938 INFO L226 Difference]: Without dead ends: 130 [2018-10-01 00:25:06,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:25:06,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-01 00:25:06,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 121. [2018-10-01 00:25:06,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-01 00:25:06,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 196 transitions. [2018-10-01 00:25:06,960 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 196 transitions. Word has length 10 [2018-10-01 00:25:06,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:06,960 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 196 transitions. [2018-10-01 00:25:06,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:25:06,961 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 196 transitions. [2018-10-01 00:25:06,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-01 00:25:06,962 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:06,962 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:06,962 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:06,963 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:06,963 INFO L82 PathProgramCache]: Analyzing trace with hash -176034144, now seen corresponding path program 1 times [2018-10-01 00:25:06,963 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:06,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:06,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:06,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:06,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:07,057 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-01 00:25:07,058 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:07,058 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-01 00:25:07,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:07,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:07,690 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-01 00:25:07,727 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:07,727 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-10-01 00:25:07,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:25:07,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:25:07,728 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:07,728 INFO L87 Difference]: Start difference. First operand 121 states and 196 transitions. Second operand 14 states. [2018-10-01 00:25:11,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:11,489 INFO L93 Difference]: Finished difference Result 162 states and 262 transitions. [2018-10-01 00:25:11,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-01 00:25:11,490 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-01 00:25:11,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:11,491 INFO L225 Difference]: With dead ends: 162 [2018-10-01 00:25:11,491 INFO L226 Difference]: Without dead ends: 160 [2018-10-01 00:25:11,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:25:11,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-01 00:25:11,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 129. [2018-10-01 00:25:11,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-01 00:25:11,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 209 transitions. [2018-10-01 00:25:11,516 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 209 transitions. Word has length 10 [2018-10-01 00:25:11,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:11,516 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 209 transitions. [2018-10-01 00:25:11,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:25:11,516 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 209 transitions. [2018-10-01 00:25:11,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-01 00:25:11,517 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:11,518 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:11,518 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:11,518 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:11,518 INFO L82 PathProgramCache]: Analyzing trace with hash -176034432, now seen corresponding path program 1 times [2018-10-01 00:25:11,518 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:11,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:11,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:11,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:11,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:11,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:11,790 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-01 00:25:11,790 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:11,790 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-01 00:25:11,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:11,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:11,938 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-01 00:25:11,960 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:11,960 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2018-10-01 00:25:11,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-01 00:25:11,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-01 00:25:11,960 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:11,960 INFO L87 Difference]: Start difference. First operand 129 states and 209 transitions. Second operand 13 states. [2018-10-01 00:25:15,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:15,851 INFO L93 Difference]: Finished difference Result 223 states and 343 transitions. [2018-10-01 00:25:15,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-01 00:25:15,853 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2018-10-01 00:25:15,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:15,854 INFO L225 Difference]: With dead ends: 223 [2018-10-01 00:25:15,855 INFO L226 Difference]: Without dead ends: 221 [2018-10-01 00:25:15,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-10-01 00:25:15,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-01 00:25:15,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 167. [2018-10-01 00:25:15,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-01 00:25:15,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 274 transitions. [2018-10-01 00:25:15,894 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 274 transitions. Word has length 10 [2018-10-01 00:25:15,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:15,895 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 274 transitions. [2018-10-01 00:25:15,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-01 00:25:15,895 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 274 transitions. [2018-10-01 00:25:15,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-01 00:25:15,896 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:15,896 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:15,897 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:15,897 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:15,897 INFO L82 PathProgramCache]: Analyzing trace with hash -184622601, now seen corresponding path program 1 times [2018-10-01 00:25:15,897 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:15,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:15,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:15,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:15,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:15,998 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-01 00:25:15,998 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:15,999 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-01 00:25:16,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:16,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:16,140 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-01 00:25:16,162 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:16,162 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-01 00:25:16,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:25:16,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:25:16,163 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:16,163 INFO L87 Difference]: Start difference. First operand 167 states and 274 transitions. Second operand 14 states. [2018-10-01 00:25:18,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:18,649 INFO L93 Difference]: Finished difference Result 222 states and 351 transitions. [2018-10-01 00:25:18,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-01 00:25:18,649 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-01 00:25:18,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:18,650 INFO L225 Difference]: With dead ends: 222 [2018-10-01 00:25:18,650 INFO L226 Difference]: Without dead ends: 221 [2018-10-01 00:25:18,651 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:25:18,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-01 00:25:18,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 181. [2018-10-01 00:25:18,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-01 00:25:18,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 297 transitions. [2018-10-01 00:25:18,678 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 297 transitions. Word has length 10 [2018-10-01 00:25:18,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:18,678 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 297 transitions. [2018-10-01 00:25:18,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:25:18,678 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 297 transitions. [2018-10-01 00:25:18,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-01 00:25:18,679 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:18,679 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:18,680 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:18,680 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:18,680 INFO L82 PathProgramCache]: Analyzing trace with hash -184621319, now seen corresponding path program 1 times [2018-10-01 00:25:18,680 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:18,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:18,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:18,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:18,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:18,772 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-01 00:25:18,773 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:25:18,773 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:25:18,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:25:18,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:25:18,774 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:18,774 INFO L87 Difference]: Start difference. First operand 181 states and 297 transitions. Second operand 8 states. [2018-10-01 00:25:19,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:19,804 INFO L93 Difference]: Finished difference Result 203 states and 320 transitions. [2018-10-01 00:25:19,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-01 00:25:19,805 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-10-01 00:25:19,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:19,806 INFO L225 Difference]: With dead ends: 203 [2018-10-01 00:25:19,806 INFO L226 Difference]: Without dead ends: 201 [2018-10-01 00:25:19,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:25:19,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-10-01 00:25:19,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 183. [2018-10-01 00:25:19,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-01 00:25:19,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 301 transitions. [2018-10-01 00:25:19,828 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 301 transitions. Word has length 10 [2018-10-01 00:25:19,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:19,828 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 301 transitions. [2018-10-01 00:25:19,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:25:19,828 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 301 transitions. [2018-10-01 00:25:19,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-01 00:25:19,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:19,829 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:19,829 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:19,830 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:19,830 INFO L82 PathProgramCache]: Analyzing trace with hash -973282432, now seen corresponding path program 1 times [2018-10-01 00:25:19,830 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:19,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:19,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:19,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:19,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:20,053 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-01 00:25:20,053 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:20,053 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-01 00:25:20,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:20,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:20,194 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-01 00:25:20,216 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:20,216 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-01 00:25:20,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:25:20,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:25:20,217 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:20,217 INFO L87 Difference]: Start difference. First operand 183 states and 301 transitions. Second operand 14 states. [2018-10-01 00:25:22,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:22,302 INFO L93 Difference]: Finished difference Result 241 states and 385 transitions. [2018-10-01 00:25:22,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-01 00:25:22,302 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-01 00:25:22,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:22,304 INFO L225 Difference]: With dead ends: 241 [2018-10-01 00:25:22,304 INFO L226 Difference]: Without dead ends: 240 [2018-10-01 00:25:22,304 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:25:22,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-10-01 00:25:22,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 202. [2018-10-01 00:25:22,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-01 00:25:22,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 336 transitions. [2018-10-01 00:25:22,329 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 336 transitions. Word has length 10 [2018-10-01 00:25:22,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:22,329 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 336 transitions. [2018-10-01 00:25:22,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:25:22,329 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 336 transitions. [2018-10-01 00:25:22,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-01 00:25:22,330 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:22,330 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:22,330 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:22,330 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:22,331 INFO L82 PathProgramCache]: Analyzing trace with hash -973281662, now seen corresponding path program 1 times [2018-10-01 00:25:22,331 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:22,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:22,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:22,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:22,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:22,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:22,416 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-01 00:25:22,417 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:25:22,417 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:25:22,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:25:22,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:25:22,418 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:22,418 INFO L87 Difference]: Start difference. First operand 202 states and 336 transitions. Second operand 8 states. [2018-10-01 00:25:23,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:23,551 INFO L93 Difference]: Finished difference Result 220 states and 353 transitions. [2018-10-01 00:25:23,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-01 00:25:23,552 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-10-01 00:25:23,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:23,553 INFO L225 Difference]: With dead ends: 220 [2018-10-01 00:25:23,553 INFO L226 Difference]: Without dead ends: 218 [2018-10-01 00:25:23,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:25:23,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-01 00:25:23,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 210. [2018-10-01 00:25:23,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-01 00:25:23,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 348 transitions. [2018-10-01 00:25:23,578 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 348 transitions. Word has length 10 [2018-10-01 00:25:23,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:23,578 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 348 transitions. [2018-10-01 00:25:23,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:25:23,578 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 348 transitions. [2018-10-01 00:25:23,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-01 00:25:23,579 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:23,579 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:23,579 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:23,579 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:23,579 INFO L82 PathProgramCache]: Analyzing trace with hash -981870601, now seen corresponding path program 1 times [2018-10-01 00:25:23,580 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:23,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:23,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:23,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:23,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:23,645 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-01 00:25:23,645 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:23,645 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-01 00:25:23,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:23,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:23,821 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-01 00:25:23,842 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:23,843 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2018-10-01 00:25:23,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-01 00:25:23,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-01 00:25:23,843 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:23,843 INFO L87 Difference]: Start difference. First operand 210 states and 348 transitions. Second operand 13 states. [2018-10-01 00:25:27,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:27,539 INFO L93 Difference]: Finished difference Result 320 states and 507 transitions. [2018-10-01 00:25:27,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-01 00:25:27,540 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2018-10-01 00:25:27,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:27,542 INFO L225 Difference]: With dead ends: 320 [2018-10-01 00:25:27,542 INFO L226 Difference]: Without dead ends: 318 [2018-10-01 00:25:27,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:25:27,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-10-01 00:25:27,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 259. [2018-10-01 00:25:27,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-01 00:25:27,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 430 transitions. [2018-10-01 00:25:27,583 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 430 transitions. Word has length 10 [2018-10-01 00:25:27,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:27,583 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 430 transitions. [2018-10-01 00:25:27,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-01 00:25:27,583 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 430 transitions. [2018-10-01 00:25:27,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-01 00:25:27,584 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:27,584 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:27,584 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:27,584 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:27,584 INFO L82 PathProgramCache]: Analyzing trace with hash -981870889, now seen corresponding path program 1 times [2018-10-01 00:25:27,584 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:27,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:27,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:27,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:27,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:27,664 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-01 00:25:27,665 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:27,665 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-01 00:25:27,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:27,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:27,800 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-01 00:25:27,822 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:27,823 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-10-01 00:25:27,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:25:27,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:25:27,823 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:27,823 INFO L87 Difference]: Start difference. First operand 259 states and 430 transitions. Second operand 14 states. [2018-10-01 00:25:29,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:29,518 INFO L93 Difference]: Finished difference Result 304 states and 503 transitions. [2018-10-01 00:25:29,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-01 00:25:29,518 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-01 00:25:29,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:29,520 INFO L225 Difference]: With dead ends: 304 [2018-10-01 00:25:29,520 INFO L226 Difference]: Without dead ends: 302 [2018-10-01 00:25:29,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:25:29,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-01 00:25:29,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 270. [2018-10-01 00:25:29,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-10-01 00:25:29,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 448 transitions. [2018-10-01 00:25:29,564 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 448 transitions. Word has length 10 [2018-10-01 00:25:29,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:29,565 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 448 transitions. [2018-10-01 00:25:29,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:25:29,565 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 448 transitions. [2018-10-01 00:25:29,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-01 00:25:29,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:29,566 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:29,566 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:29,566 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:29,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1101306322, now seen corresponding path program 1 times [2018-10-01 00:25:29,566 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:29,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:29,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:29,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:29,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:29,716 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-01 00:25:29,716 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:29,717 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-01 00:25:29,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:29,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:29,798 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-01 00:25:29,821 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:29,821 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-01 00:25:29,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:25:29,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:25:29,822 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:29,822 INFO L87 Difference]: Start difference. First operand 270 states and 448 transitions. Second operand 14 states. [2018-10-01 00:25:31,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:31,545 INFO L93 Difference]: Finished difference Result 281 states and 455 transitions. [2018-10-01 00:25:31,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-01 00:25:31,545 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-01 00:25:31,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:31,547 INFO L225 Difference]: With dead ends: 281 [2018-10-01 00:25:31,547 INFO L226 Difference]: Without dead ends: 280 [2018-10-01 00:25:31,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:25:31,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-10-01 00:25:31,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 270. [2018-10-01 00:25:31,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-10-01 00:25:31,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 447 transitions. [2018-10-01 00:25:31,594 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 447 transitions. Word has length 10 [2018-10-01 00:25:31,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:31,595 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 447 transitions. [2018-10-01 00:25:31,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:25:31,595 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 447 transitions. [2018-10-01 00:25:31,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-01 00:25:31,595 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:31,596 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:31,596 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:31,596 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:31,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1102106644, now seen corresponding path program 1 times [2018-10-01 00:25:31,596 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:31,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:31,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:31,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:31,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:32,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:32,058 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:25:32,058 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:25:32,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:25:32,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:25:32,059 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:32,059 INFO L87 Difference]: Start difference. First operand 270 states and 447 transitions. Second operand 8 states. [2018-10-01 00:25:33,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:33,105 INFO L93 Difference]: Finished difference Result 286 states and 460 transitions. [2018-10-01 00:25:33,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-01 00:25:33,106 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-10-01 00:25:33,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:33,108 INFO L225 Difference]: With dead ends: 286 [2018-10-01 00:25:33,108 INFO L226 Difference]: Without dead ends: 284 [2018-10-01 00:25:33,108 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:25:33,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-10-01 00:25:33,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 268. [2018-10-01 00:25:33,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-01 00:25:33,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 443 transitions. [2018-10-01 00:25:33,159 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 443 transitions. Word has length 10 [2018-10-01 00:25:33,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:33,159 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 443 transitions. [2018-10-01 00:25:33,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:25:33,160 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 443 transitions. [2018-10-01 00:25:33,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:25:33,160 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:33,161 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:33,161 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:33,161 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:33,161 INFO L82 PathProgramCache]: Analyzing trace with hash 240543358, now seen corresponding path program 1 times [2018-10-01 00:25:33,161 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:33,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:33,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:33,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:33,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:34,110 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-01 00:25:34,110 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:34,111 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-01 00:25:34,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:34,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:34,581 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-01 00:25:34,601 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:34,602 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 15 [2018-10-01 00:25:34,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-01 00:25:34,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-01 00:25:34,602 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:34,602 INFO L87 Difference]: Start difference. First operand 268 states and 443 transitions. Second operand 16 states. [2018-10-01 00:25:38,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:38,434 INFO L93 Difference]: Finished difference Result 515 states and 842 transitions. [2018-10-01 00:25:38,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-01 00:25:38,434 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 12 [2018-10-01 00:25:38,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:38,436 INFO L225 Difference]: With dead ends: 515 [2018-10-01 00:25:38,437 INFO L226 Difference]: Without dead ends: 513 [2018-10-01 00:25:38,437 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time [2018-10-01 00:25:38,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-10-01 00:25:38,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 338. [2018-10-01 00:25:38,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-10-01 00:25:38,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 568 transitions. [2018-10-01 00:25:38,497 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 568 transitions. Word has length 12 [2018-10-01 00:25:38,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:38,497 INFO L480 AbstractCegarLoop]: Abstraction has 338 states and 568 transitions. [2018-10-01 00:25:38,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-01 00:25:38,497 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 568 transitions. [2018-10-01 00:25:38,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:25:38,498 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:38,498 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:38,498 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:38,498 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:38,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1525011273, now seen corresponding path program 1 times [2018-10-01 00:25:38,499 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:38,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:38,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:38,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:38,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:38,790 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-01 00:25:38,791 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:38,791 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-01 00:25:38,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:38,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:38,982 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-01 00:25:39,003 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:39,003 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 15 [2018-10-01 00:25:39,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-01 00:25:39,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-01 00:25:39,004 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:39,004 INFO L87 Difference]: Start difference. First operand 338 states and 568 transitions. Second operand 16 states. [2018-10-01 00:25:42,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:42,894 INFO L93 Difference]: Finished difference Result 631 states and 1050 transitions. [2018-10-01 00:25:42,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-01 00:25:42,895 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 12 [2018-10-01 00:25:42,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:42,897 INFO L225 Difference]: With dead ends: 631 [2018-10-01 00:25:42,898 INFO L226 Difference]: Without dead ends: 629 [2018-10-01 00:25:42,898 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:25:42,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-10-01 00:25:42,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 403. [2018-10-01 00:25:42,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-01 00:25:42,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 685 transitions. [2018-10-01 00:25:42,992 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 685 transitions. Word has length 12 [2018-10-01 00:25:42,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:42,993 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 685 transitions. [2018-10-01 00:25:42,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-01 00:25:42,993 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 685 transitions. [2018-10-01 00:25:42,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-01 00:25:42,994 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:42,994 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:42,994 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:42,994 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:42,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1000080215, now seen corresponding path program 1 times [2018-10-01 00:25:42,995 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:42,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:42,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:42,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:42,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:43,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:43,095 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:43,095 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-01 00:25:43,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:43,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:43,193 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-01 00:25:43,213 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-01 00:25:43,214 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-10-01 00:25:43,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:25:43,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:25:43,214 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:43,214 INFO L87 Difference]: Start difference. First operand 403 states and 685 transitions. Second operand 14 states. [2018-10-01 00:25:48,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:48,636 INFO L93 Difference]: Finished difference Result 1330 states and 2225 transitions. [2018-10-01 00:25:48,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-01 00:25:48,636 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-01 00:25:48,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:48,639 INFO L225 Difference]: With dead ends: 1330 [2018-10-01 00:25:48,639 INFO L226 Difference]: Without dead ends: 929 [2018-10-01 00:25:48,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:25:48,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2018-10-01 00:25:48,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 694. [2018-10-01 00:25:48,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2018-10-01 00:25:48,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1171 transitions. [2018-10-01 00:25:48,770 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1171 transitions. Word has length 13 [2018-10-01 00:25:48,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:48,770 INFO L480 AbstractCegarLoop]: Abstraction has 694 states and 1171 transitions. [2018-10-01 00:25:48,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:25:48,770 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1171 transitions. [2018-10-01 00:25:48,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-01 00:25:48,771 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:48,771 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:48,772 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:48,772 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:48,772 INFO L82 PathProgramCache]: Analyzing trace with hash -86603521, now seen corresponding path program 1 times [2018-10-01 00:25:48,772 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:48,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:48,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:48,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:48,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:48,858 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-01 00:25:48,859 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:48,859 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-01 00:25:48,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:48,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:49,238 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-01 00:25:49,258 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:49,259 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-10-01 00:25:49,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:25:49,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:25:49,259 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:49,259 INFO L87 Difference]: Start difference. First operand 694 states and 1171 transitions. Second operand 14 states. [2018-10-01 00:25:53,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:53,023 INFO L93 Difference]: Finished difference Result 1552 states and 2594 transitions. [2018-10-01 00:25:53,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-01 00:25:53,023 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-01 00:25:53,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:53,026 INFO L225 Difference]: With dead ends: 1552 [2018-10-01 00:25:53,026 INFO L226 Difference]: Without dead ends: 859 [2018-10-01 00:25:53,028 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:25:53,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2018-10-01 00:25:53,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 697. [2018-10-01 00:25:53,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2018-10-01 00:25:53,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1175 transitions. [2018-10-01 00:25:53,168 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1175 transitions. Word has length 13 [2018-10-01 00:25:53,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:53,168 INFO L480 AbstractCegarLoop]: Abstraction has 697 states and 1175 transitions. [2018-10-01 00:25:53,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:25:53,169 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1175 transitions. [2018-10-01 00:25:53,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-01 00:25:53,169 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:53,170 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:53,170 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:53,170 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:53,170 INFO L82 PathProgramCache]: Analyzing trace with hash -63701769, now seen corresponding path program 1 times [2018-10-01 00:25:53,170 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:53,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:53,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:53,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:53,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:53,307 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-01 00:25:53,308 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:53,308 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-01 00:25:53,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:53,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:53,436 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-01 00:25:53,458 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:53,458 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-10-01 00:25:53,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-01 00:25:53,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-01 00:25:53,459 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:53,459 INFO L87 Difference]: Start difference. First operand 697 states and 1175 transitions. Second operand 13 states. [2018-10-01 00:25:56,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:56,238 INFO L93 Difference]: Finished difference Result 1535 states and 2564 transitions. [2018-10-01 00:25:56,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-01 00:25:56,239 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-10-01 00:25:56,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:56,243 INFO L225 Difference]: With dead ends: 1535 [2018-10-01 00:25:56,243 INFO L226 Difference]: Without dead ends: 839 [2018-10-01 00:25:56,244 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:25:56,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-10-01 00:25:56,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 765. [2018-10-01 00:25:56,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2018-10-01 00:25:56,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1284 transitions. [2018-10-01 00:25:56,452 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1284 transitions. Word has length 13 [2018-10-01 00:25:56,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:56,452 INFO L480 AbstractCegarLoop]: Abstraction has 765 states and 1284 transitions. [2018-10-01 00:25:56,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-01 00:25:56,453 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1284 transitions. [2018-10-01 00:25:56,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-01 00:25:56,453 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:56,454 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:56,454 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:56,454 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:56,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1761298639, now seen corresponding path program 1 times [2018-10-01 00:25:56,454 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:56,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:56,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:56,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:56,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:56,964 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-01 00:25:56,965 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:56,965 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-01 00:25:56,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:56,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:57,050 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-01 00:25:57,072 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:57,072 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-10-01 00:25:57,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-01 00:25:57,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-01 00:25:57,073 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:57,073 INFO L87 Difference]: Start difference. First operand 765 states and 1284 transitions. Second operand 10 states. [2018-10-01 00:25:58,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:58,842 INFO L93 Difference]: Finished difference Result 873 states and 1444 transitions. [2018-10-01 00:25:58,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-01 00:25:58,842 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-10-01 00:25:58,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:58,845 INFO L225 Difference]: With dead ends: 873 [2018-10-01 00:25:58,845 INFO L226 Difference]: Without dead ends: 871 [2018-10-01 00:25:58,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:25:58,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-10-01 00:25:58,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 756. [2018-10-01 00:25:58,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 756 states. [2018-10-01 00:25:58,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1266 transitions. [2018-10-01 00:25:58,987 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1266 transitions. Word has length 13 [2018-10-01 00:25:58,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:58,987 INFO L480 AbstractCegarLoop]: Abstraction has 756 states and 1266 transitions. [2018-10-01 00:25:58,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-01 00:25:58,987 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1266 transitions. [2018-10-01 00:25:58,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-01 00:25:58,988 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:58,988 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:58,989 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:58,989 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:58,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1799471129, now seen corresponding path program 1 times [2018-10-01 00:25:58,989 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:58,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:58,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:58,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:58,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:59,068 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-01 00:25:59,068 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:59,069 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-01 00:25:59,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:59,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:59,352 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-01 00:25:59,372 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-01 00:25:59,372 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-10-01 00:25:59,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:25:59,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:25:59,373 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:59,373 INFO L87 Difference]: Start difference. First operand 756 states and 1266 transitions. Second operand 14 states. [2018-10-01 00:26:04,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:04,486 INFO L93 Difference]: Finished difference Result 1931 states and 3204 transitions. [2018-10-01 00:26:04,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-01 00:26:04,486 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-01 00:26:04,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:04,490 INFO L225 Difference]: With dead ends: 1931 [2018-10-01 00:26:04,490 INFO L226 Difference]: Without dead ends: 1176 [2018-10-01 00:26:04,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:26:04,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2018-10-01 00:26:04,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 835. [2018-10-01 00:26:04,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2018-10-01 00:26:04,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1399 transitions. [2018-10-01 00:26:04,663 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1399 transitions. Word has length 13 [2018-10-01 00:26:04,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:04,663 INFO L480 AbstractCegarLoop]: Abstraction has 835 states and 1399 transitions. [2018-10-01 00:26:04,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:26:04,663 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1399 transitions. [2018-10-01 00:26:04,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-01 00:26:04,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:04,664 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:04,665 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:04,665 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:04,665 INFO L82 PathProgramCache]: Analyzing trace with hash 267374077, now seen corresponding path program 1 times [2018-10-01 00:26:04,665 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:04,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:04,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:04,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:04,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:04,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:04,748 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-01 00:26:04,748 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:04,748 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-01 00:26:04,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:04,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:04,796 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-01 00:26:04,817 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:04,817 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-10-01 00:26:04,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-01 00:26:04,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-01 00:26:04,818 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:04,818 INFO L87 Difference]: Start difference. First operand 835 states and 1399 transitions. Second operand 10 states. [2018-10-01 00:26:06,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:06,786 INFO L93 Difference]: Finished difference Result 974 states and 1611 transitions. [2018-10-01 00:26:06,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-01 00:26:06,787 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-10-01 00:26:06,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:06,790 INFO L225 Difference]: With dead ends: 974 [2018-10-01 00:26:06,790 INFO L226 Difference]: Without dead ends: 972 [2018-10-01 00:26:06,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:26:06,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2018-10-01 00:26:06,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 833. [2018-10-01 00:26:06,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2018-10-01 00:26:06,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1397 transitions. [2018-10-01 00:26:06,959 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1397 transitions. Word has length 13 [2018-10-01 00:26:06,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:06,959 INFO L480 AbstractCegarLoop]: Abstraction has 833 states and 1397 transitions. [2018-10-01 00:26:06,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-01 00:26:06,959 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1397 transitions. [2018-10-01 00:26:06,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-01 00:26:06,960 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:06,960 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:06,960 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:06,960 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:06,961 INFO L82 PathProgramCache]: Analyzing trace with hash 290277111, now seen corresponding path program 1 times [2018-10-01 00:26:06,961 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:06,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:06,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:06,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:06,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:07,094 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-01 00:26:07,094 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:07,094 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-01 00:26:07,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:07,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:07,182 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-01 00:26:07,205 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-01 00:26:07,205 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-10-01 00:26:07,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:26:07,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:26:07,205 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:07,205 INFO L87 Difference]: Start difference. First operand 833 states and 1397 transitions. Second operand 14 states. [2018-10-01 00:26:11,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:11,966 INFO L93 Difference]: Finished difference Result 2001 states and 3315 transitions. [2018-10-01 00:26:11,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-01 00:26:11,967 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-01 00:26:11,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:11,971 INFO L225 Difference]: With dead ends: 2001 [2018-10-01 00:26:11,971 INFO L226 Difference]: Without dead ends: 1165 [2018-10-01 00:26:11,972 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:26:11,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2018-10-01 00:26:12,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 970. [2018-10-01 00:26:12,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2018-10-01 00:26:12,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1613 transitions. [2018-10-01 00:26:12,172 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1613 transitions. Word has length 13 [2018-10-01 00:26:12,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:12,172 INFO L480 AbstractCegarLoop]: Abstraction has 970 states and 1613 transitions. [2018-10-01 00:26:12,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:26:12,172 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1613 transitions. [2018-10-01 00:26:12,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-01 00:26:12,173 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:12,173 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:12,173 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:12,173 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:12,173 INFO L82 PathProgramCache]: Analyzing trace with hash 2115278289, now seen corresponding path program 1 times [2018-10-01 00:26:12,173 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:12,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:12,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:12,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:12,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:12,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:12,249 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-01 00:26:12,250 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:12,250 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-01 00:26:12,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:12,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:12,382 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-01 00:26:12,403 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:12,403 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-10-01 00:26:12,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:26:12,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:26:12,404 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:12,404 INFO L87 Difference]: Start difference. First operand 970 states and 1613 transitions. Second operand 14 states. [2018-10-01 00:26:15,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:15,560 INFO L93 Difference]: Finished difference Result 2094 states and 3453 transitions. [2018-10-01 00:26:15,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-01 00:26:15,560 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-01 00:26:15,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:15,564 INFO L225 Difference]: With dead ends: 2094 [2018-10-01 00:26:15,564 INFO L226 Difference]: Without dead ends: 1121 [2018-10-01 00:26:15,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:26:15,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2018-10-01 00:26:15,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 950. [2018-10-01 00:26:15,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2018-10-01 00:26:15,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1579 transitions. [2018-10-01 00:26:15,753 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1579 transitions. Word has length 13 [2018-10-01 00:26:15,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:15,753 INFO L480 AbstractCegarLoop]: Abstraction has 950 states and 1579 transitions. [2018-10-01 00:26:15,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:26:15,754 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1579 transitions. [2018-10-01 00:26:15,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-01 00:26:15,754 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:15,754 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:15,755 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:15,755 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:15,755 INFO L82 PathProgramCache]: Analyzing trace with hash -2141517287, now seen corresponding path program 1 times [2018-10-01 00:26:15,755 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:15,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:15,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:15,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:15,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:15,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:15,820 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-01 00:26:15,820 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:15,821 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-01 00:26:15,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:15,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:15,958 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-01 00:26:15,979 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:15,979 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-10-01 00:26:15,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-01 00:26:15,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-01 00:26:15,980 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:15,980 INFO L87 Difference]: Start difference. First operand 950 states and 1579 transitions. Second operand 13 states. [2018-10-01 00:26:18,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:18,722 INFO L93 Difference]: Finished difference Result 1334 states and 2168 transitions. [2018-10-01 00:26:18,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-01 00:26:18,722 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-10-01 00:26:18,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:18,726 INFO L225 Difference]: With dead ends: 1334 [2018-10-01 00:26:18,726 INFO L226 Difference]: Without dead ends: 1076 [2018-10-01 00:26:18,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:26:18,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2018-10-01 00:26:18,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 975. [2018-10-01 00:26:18,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 975 states. [2018-10-01 00:26:18,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1619 transitions. [2018-10-01 00:26:18,912 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1619 transitions. Word has length 13 [2018-10-01 00:26:18,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:18,912 INFO L480 AbstractCegarLoop]: Abstraction has 975 states and 1619 transitions. [2018-10-01 00:26:18,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-01 00:26:18,912 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1619 transitions. [2018-10-01 00:26:18,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-01 00:26:18,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:18,913 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:18,913 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:18,913 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:18,913 INFO L82 PathProgramCache]: Analyzing trace with hash 2129075237, now seen corresponding path program 1 times [2018-10-01 00:26:18,914 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:18,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:18,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:18,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:18,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:18,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:19,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:19,023 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:19,023 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-01 00:26:19,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:19,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:19,114 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-01 00:26:19,135 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-01 00:26:19,135 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-10-01 00:26:19,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:26:19,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:26:19,136 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:19,136 INFO L87 Difference]: Start difference. First operand 975 states and 1619 transitions. Second operand 14 states. [2018-10-01 00:26:24,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:24,202 INFO L93 Difference]: Finished difference Result 2736 states and 4494 transitions. [2018-10-01 00:26:24,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-01 00:26:24,202 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-01 00:26:24,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:24,208 INFO L225 Difference]: With dead ends: 2736 [2018-10-01 00:26:24,208 INFO L226 Difference]: Without dead ends: 1758 [2018-10-01 00:26:24,210 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:26:24,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2018-10-01 00:26:24,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1307. [2018-10-01 00:26:24,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1307 states. [2018-10-01 00:26:24,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 2157 transitions. [2018-10-01 00:26:24,479 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 2157 transitions. Word has length 13 [2018-10-01 00:26:24,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:24,479 INFO L480 AbstractCegarLoop]: Abstraction has 1307 states and 2157 transitions. [2018-10-01 00:26:24,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:26:24,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 2157 transitions. [2018-10-01 00:26:24,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-01 00:26:24,480 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:24,480 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:24,480 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:24,480 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:24,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1374166088, now seen corresponding path program 1 times [2018-10-01 00:26:24,481 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:24,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:24,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:24,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:24,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:24,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:24,592 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:24,592 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-01 00:26:24,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:24,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:24,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:24,782 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:24,783 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 18 [2018-10-01 00:26:24,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-01 00:26:24,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-01 00:26:24,783 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:24,783 INFO L87 Difference]: Start difference. First operand 1307 states and 2157 transitions. Second operand 18 states. [2018-10-01 00:26:30,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:30,272 INFO L93 Difference]: Finished difference Result 2855 states and 4676 transitions. [2018-10-01 00:26:30,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-01 00:26:30,273 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2018-10-01 00:26:30,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:30,278 INFO L225 Difference]: With dead ends: 2855 [2018-10-01 00:26:30,278 INFO L226 Difference]: Without dead ends: 1547 [2018-10-01 00:26:30,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:26:30,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2018-10-01 00:26:30,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1230. [2018-10-01 00:26:30,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2018-10-01 00:26:30,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 2012 transitions. [2018-10-01 00:26:30,551 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 2012 transitions. Word has length 15 [2018-10-01 00:26:30,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:30,551 INFO L480 AbstractCegarLoop]: Abstraction has 1230 states and 2012 transitions. [2018-10-01 00:26:30,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-01 00:26:30,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 2012 transitions. [2018-10-01 00:26:30,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-01 00:26:30,552 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:30,552 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:30,553 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:30,553 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:30,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1374164806, now seen corresponding path program 1 times [2018-10-01 00:26:30,553 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:30,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:30,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:30,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:30,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:30,656 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-01 00:26:30,656 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:30,656 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-01 00:26:30,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:30,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:30,949 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-01 00:26:30,971 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:30,971 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 16 [2018-10-01 00:26:30,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-01 00:26:30,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-01 00:26:30,972 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:30,972 INFO L87 Difference]: Start difference. First operand 1230 states and 2012 transitions. Second operand 17 states. [2018-10-01 00:26:34,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:34,711 INFO L93 Difference]: Finished difference Result 1401 states and 2269 transitions. [2018-10-01 00:26:34,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-01 00:26:34,712 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2018-10-01 00:26:34,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:34,716 INFO L225 Difference]: With dead ends: 1401 [2018-10-01 00:26:34,716 INFO L226 Difference]: Without dead ends: 1399 [2018-10-01 00:26:34,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:26:34,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2018-10-01 00:26:34,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1212. [2018-10-01 00:26:34,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1212 states. [2018-10-01 00:26:34,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1981 transitions. [2018-10-01 00:26:34,967 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1981 transitions. Word has length 15 [2018-10-01 00:26:34,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:34,968 INFO L480 AbstractCegarLoop]: Abstraction has 1212 states and 1981 transitions. [2018-10-01 00:26:34,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-01 00:26:34,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1981 transitions. [2018-10-01 00:26:34,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-01 00:26:34,969 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:34,969 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:34,969 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:34,970 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:34,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1511388970, now seen corresponding path program 1 times [2018-10-01 00:26:34,970 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:34,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:34,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:34,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:34,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:35,466 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:35,466 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:35,466 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-01 00:26:35,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:35,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:35,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:35,612 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:35,612 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-10-01 00:26:35,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-01 00:26:35,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-01 00:26:35,613 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:35,613 INFO L87 Difference]: Start difference. First operand 1212 states and 1981 transitions. Second operand 17 states. [2018-10-01 00:26:40,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:40,918 INFO L93 Difference]: Finished difference Result 2660 states and 4318 transitions. [2018-10-01 00:26:40,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-01 00:26:40,918 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2018-10-01 00:26:40,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:40,923 INFO L225 Difference]: With dead ends: 2660 [2018-10-01 00:26:40,923 INFO L226 Difference]: Without dead ends: 1447 [2018-10-01 00:26:40,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-10-01 00:26:40,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2018-10-01 00:26:41,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1135. [2018-10-01 00:26:41,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1135 states. [2018-10-01 00:26:41,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1836 transitions. [2018-10-01 00:26:41,196 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1836 transitions. Word has length 15 [2018-10-01 00:26:41,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:41,197 INFO L480 AbstractCegarLoop]: Abstraction has 1135 states and 1836 transitions. [2018-10-01 00:26:41,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-01 00:26:41,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1836 transitions. [2018-10-01 00:26:41,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-01 00:26:41,198 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:41,198 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:41,198 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:41,198 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:41,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1511389740, now seen corresponding path program 1 times [2018-10-01 00:26:41,199 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:41,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:41,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:41,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:41,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:41,330 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-01 00:26:41,330 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:41,331 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-01 00:26:41,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:41,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:41,445 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-01 00:26:41,466 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:41,466 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 15 [2018-10-01 00:26:41,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-01 00:26:41,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-01 00:26:41,467 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:41,467 INFO L87 Difference]: Start difference. First operand 1135 states and 1836 transitions. Second operand 16 states. [2018-10-01 00:26:42,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:42,841 INFO L93 Difference]: Finished difference Result 1213 states and 1948 transitions. [2018-10-01 00:26:42,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-01 00:26:42,842 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-10-01 00:26:42,842 INFO L84 Accepts]: Finished accepts. each prefix is rejected. [2018-10-01 00:26:42,842 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-10-01 00:26:42,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:42,842 FATAL L834 BasicCegarLoop]: -- [2018-10-01 00:26:42,842 FATAL L835 BasicCegarLoop]: enhanced interpolant automaton broken: counterexample not accepted [2018-10-01 00:26:42,843 FATAL L836 BasicCegarLoop]: word: [2018-10-01 00:26:42,843 FATAL L838 BasicCegarLoop]: havoc next;assume next >= 0;havoc workload;assume workload > 0;working0 := -1;working1 := -1; [2018-10-01 00:26:42,846 FATAL L838 BasicCegarLoop]: begin1 := next;next := next + workload;end1 := next; [2018-10-01 00:26:42,846 FATAL L838 BasicCegarLoop]: assume begin1 < end1; [2018-10-01 00:26:42,846 FATAL L838 BasicCegarLoop]: begin0 := next;next := next + workload;end0 := next; [2018-10-01 00:26:42,846 FATAL L838 BasicCegarLoop]: assume begin0 < end0; [2018-10-01 00:26:42,846 FATAL L838 BasicCegarLoop]: working0 := begin0; [2018-10-01 00:26:42,846 FATAL L838 BasicCegarLoop]: assume working0 != working1;begin0 := begin0 + 1; [2018-10-01 00:26:42,846 FATAL L838 BasicCegarLoop]: assume !(begin0 < end0); [2018-10-01 00:26:42,847 FATAL L838 BasicCegarLoop]: begin0 := next;next := next + workload;end0 := next; [2018-10-01 00:26:42,847 FATAL L838 BasicCegarLoop]: assume begin0 < end0; [2018-10-01 00:26:42,847 FATAL L838 BasicCegarLoop]: working1 := begin1; [2018-10-01 00:26:42,847 FATAL L838 BasicCegarLoop]: assume working0 != working1;begin1 := begin1 + 1; [2018-10-01 00:26:42,847 FATAL L838 BasicCegarLoop]: assume !(begin1 < end1); [2018-10-01 00:26:42,847 FATAL L838 BasicCegarLoop]: working0 := begin0; [2018-10-01 00:26:42,847 FATAL L838 BasicCegarLoop]: assume !(working0 != working1); [2018-10-01 00:26:42,847 FATAL L840 BasicCegarLoop]: original automaton: [2018-10-01 00:26:42,848 FATAL L841 BasicCegarLoop]: FiniteAutomaton nwa = ( alphabet = {"havoc next;assume next >= 0;havoc workload;assume workload > 0;working0 := -1;working1 := -1;" "working1 := begin1;" "assume !(working0 != working1);" "assume working0 != working1;begin1 := begin1 + 1;" "begin0 := next;next := next + workload;end0 := next;" "assume begin1 < end1;" "assume begin0 < end0;" "assume !(begin1 < end1);" "assume !(begin0 < end0);" "begin1 := next;next := next + workload;end1 := next;" "assume begin1 < end1;" "assume !(begin1 < end1);" "working0 := begin0;" "assume !(working0 != working1);" "assume working0 != working1;begin0 := begin0 + 1;" "assume begin0 < end0;" "assume !(begin0 < end0);" "begin1 := next;next := next + workload;end1 := next;" "assume begin1 < end1;" "assume !(begin1 < end1);" "begin0 := next;next := next + workload;end0 := next;" "assume begin0 < end0;" "assume !(begin0 < end0);" "working1 := begin1;" "assume !(working0 != working1);" "assume working0 != working1;begin1 := begin1 + 1;" "assume begin1 < end1;" "assume !(begin1 < end1);" "working0 := begin0;" "assume !(working0 != working1);" "assume working0 != working1;begin0 := begin0 + 1;" "assume begin0 < end0;" "assume !(begin0 < end0);" }, states = {"61632#(<= (+ product_working1 2) product_working0)" "61636#(< 0 product_workload)" "61668#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_begin0)))" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))" "61676#(exists ((product_workload Int)) (and (<= (+ product_working1 (* 2 product_workload)) product_begin0) (< 0 product_workload)))" "61648#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next)))" "61622#true" "61623#false" "61688#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ product_working1 (* 2 product_workload)) product_working0)))" "61625#(= product_end1 product_next)" "61626#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "61627#(and (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (= product_end1 product_begin0))" "61628#(and (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))" "61629#(<= (+ product_begin1 2) product_next)" "61630#(<= (+ product_begin1 2) product_begin0)" "61631#(<= (+ product_working1 2) product_begin0)" }, initialStates = {"61622#true" }, finalStates = {"61623#false" }, transitions = { ("61632#(<= (+ product_working1 2) product_working0)" "assume !(working0 != working1);" "61623#false") ("61636#(< 0 product_workload)" "begin1 := next;next := next + workload;end1 := next;" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))") ("61668#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_begin0)))" "working1 := begin1;" "61676#(exists ((product_workload Int)) (and (<= (+ product_working1 (* 2 product_workload)) product_begin0) (< 0 product_workload)))") ("61668#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_begin0)))" "assume begin0 < end0;" "61668#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_begin0)))") ("61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))" "begin0 := next;next := next + workload;end0 := next;" "61648#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next)))") ("61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))" "assume begin1 < end1;" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))") ("61676#(exists ((product_workload Int)) (and (<= (+ product_working1 (* 2 product_workload)) product_begin0) (< 0 product_workload)))" "assume working0 != working1;begin1 := begin1 + 1;" "61676#(exists ((product_workload Int)) (and (<= (+ product_working1 (* 2 product_workload)) product_begin0) (< 0 product_workload)))") ("61676#(exists ((product_workload Int)) (and (<= (+ product_working1 (* 2 product_workload)) product_begin0) (< 0 product_workload)))" "working0 := begin0;" "61688#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ product_working1 (* 2 product_workload)) product_working0)))") ("61676#(exists ((product_workload Int)) (and (<= (+ product_working1 (* 2 product_workload)) product_begin0) (< 0 product_workload)))" "assume !(begin1 < end1);" "61676#(exists ((product_workload Int)) (and (<= (+ product_working1 (* 2 product_workload)) product_begin0) (< 0 product_workload)))") ("61648#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next)))" "begin0 := next;next := next + workload;end0 := next;" "61668#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_begin0)))") ("61648#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next)))" "working0 := begin0;" "61648#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next)))") ("61648#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next)))" "assume begin0 < end0;" "61648#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next)))") ("61648#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next)))" "assume working0 != working1;begin0 := begin0 + 1;" "61648#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next)))") ("61648#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next)))" "assume !(begin0 < end0);" "61648#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next)))") ("61622#true" "havoc next;assume next >= 0;havoc workload;assume workload > 0;working0 := -1;working1 := -1;" "61636#(< 0 product_workload)") ("61622#true" "havoc next;assume next >= 0;havoc workload;assume workload > 0;working0 := -1;working1 := -1;" "61622#true") ("61622#true" "begin1 := next;next := next + workload;end1 := next;" "61625#(= product_end1 product_next)") ("61688#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ product_working1 (* 2 product_workload)) product_working0)))" "assume !(working0 != working1);" "61623#false") ("61625#(= product_end1 product_next)" "assume begin1 < end1;" "61626#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61626#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "begin0 := next;next := next + workload;end0 := next;" "61627#(and (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (= product_end1 product_begin0))") ("61627#(and (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (= product_end1 product_begin0))" "assume begin0 < end0;" "61628#(and (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))") ("61628#(and (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))" "working0 := begin0;" "61628#(and (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))") ("61628#(and (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))" "assume working0 != working1;begin0 := begin0 + 1;" "61629#(<= (+ product_begin1 2) product_next)") ("61629#(<= (+ product_begin1 2) product_next)" "begin0 := next;next := next + workload;end0 := next;" "61630#(<= (+ product_begin1 2) product_begin0)") ("61629#(<= (+ product_begin1 2) product_next)" "assume !(begin0 < end0);" "61629#(<= (+ product_begin1 2) product_next)") ("61630#(<= (+ product_begin1 2) product_begin0)" "working1 := begin1;" "61631#(<= (+ product_working1 2) product_begin0)") ("61630#(<= (+ product_begin1 2) product_begin0)" "assume begin0 < end0;" "61630#(<= (+ product_begin1 2) product_begin0)") ("61631#(<= (+ product_working1 2) product_begin0)" "assume working0 != working1;begin1 := begin1 + 1;" "61631#(<= (+ product_working1 2) product_begin0)") ("61631#(<= (+ product_working1 2) product_begin0)" "working0 := begin0;" "61632#(<= (+ product_working1 2) product_working0)") ("61631#(<= (+ product_working1 2) product_begin0)" "assume !(begin1 < end1);" "61631#(<= (+ product_working1 2) product_begin0)") } ); [2018-10-01 00:26:42,852 FATAL L842 BasicCegarLoop]: enhanced automaton: [2018-10-01 00:26:42,852 FATAL L843 BasicCegarLoop]: FiniteAutomaton nwa = ( alphabet = {"havoc next;assume next >= 0;havoc workload;assume workload > 0;working0 := -1;working1 := -1;" "working1 := begin1;" "assume !(working0 != working1);" "assume working0 != working1;begin1 := begin1 + 1;" "begin0 := next;next := next + workload;end0 := next;" "assume begin1 < end1;" "assume begin0 < end0;" "assume !(begin1 < end1);" "assume !(begin0 < end0);" "begin1 := next;next := next + workload;end1 := next;" "assume begin1 < end1;" "assume !(begin1 < end1);" "working0 := begin0;" "assume !(working0 != working1);" "assume working0 != working1;begin0 := begin0 + 1;" "assume begin0 < end0;" "assume !(begin0 < end0);" "begin1 := next;next := next + workload;end1 := next;" "assume begin1 < end1;" "assume !(begin1 < end1);" "begin0 := next;next := next + workload;end0 := next;" "assume begin0 < end0;" "assume !(begin0 < end0);" "working1 := begin1;" "assume !(working0 != working1);" "assume working0 != working1;begin1 := begin1 + 1;" "assume begin1 < end1;" "assume !(begin1 < end1);" "working0 := begin0;" "assume !(working0 != working1);" "assume working0 != working1;begin0 := begin0 + 1;" "assume begin0 < end0;" "assume !(begin0 < end0);" }, states = {"61713#(and (< 0 product_workload) (= product_end1 product_next))" "61636#(< 0 product_workload)" "61622#true" "61704#(and (< 0 product_workload) (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (<= (+ product_workload product_begin1) product_next) (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))" "61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "61791#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next))))" }, initialStates = {"61622#true" }, finalStates = {}, transitions = { ("61713#(and (< 0 product_workload) (= product_end1 product_next))" "assume begin1 < end1;" "61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61713#(and (< 0 product_workload) (= product_end1 product_next))" "assume !(begin1 < end1);" "61713#(and (< 0 product_workload) (= product_end1 product_next))") ("61713#(and (< 0 product_workload) (= product_end1 product_next))" "begin0 := next;next := next + workload;end0 := next;" "61636#(< 0 product_workload)") ("61713#(and (< 0 product_workload) (= product_end1 product_next))" "working0 := begin0;" "61713#(and (< 0 product_workload) (= product_end1 product_next))") ("61713#(and (< 0 product_workload) (= product_end1 product_next))" "assume !(working0 != working1);" "61713#(and (< 0 product_workload) (= product_end1 product_next))") ("61713#(and (< 0 product_workload) (= product_end1 product_next))" "assume begin1 < end1;" "61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61713#(and (< 0 product_workload) (= product_end1 product_next))" "assume working0 != working1;begin0 := begin0 + 1;" "61713#(and (< 0 product_workload) (= product_end1 product_next))") ("61713#(and (< 0 product_workload) (= product_end1 product_next))" "assume !(begin1 < end1);" "61713#(and (< 0 product_workload) (= product_end1 product_next))") ("61713#(and (< 0 product_workload) (= product_end1 product_next))" "assume begin0 < end0;" "61713#(and (< 0 product_workload) (= product_end1 product_next))") ("61713#(and (< 0 product_workload) (= product_end1 product_next))" "begin1 := next;next := next + workload;end1 := next;" "61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61713#(and (< 0 product_workload) (= product_end1 product_next))" "assume !(begin0 < end0);" "61713#(and (< 0 product_workload) (= product_end1 product_next))") ("61713#(and (< 0 product_workload) (= product_end1 product_next))" "begin1 := next;next := next + workload;end1 := next;" "61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61636#(< 0 product_workload)" "working1 := begin1;" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume !(working0 != working1);" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume working0 != working1;begin1 := begin1 + 1;" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "begin0 := next;next := next + workload;end0 := next;" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume begin1 < end1;" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume begin0 < end0;" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume !(begin1 < end1);" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "begin1 := next;next := next + workload;end1 := next;" "61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61636#(< 0 product_workload)" "working0 := begin0;" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume !(working0 != working1);" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume working0 != working1;begin0 := begin0 + 1;" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume begin0 < end0;" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume !(begin0 < end0);" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "begin1 := next;next := next + workload;end1 := next;" "61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61636#(< 0 product_workload)" "begin0 := next;next := next + workload;end0 := next;" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume begin0 < end0;" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "working1 := begin1;" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume !(working0 != working1);" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume working0 != working1;begin1 := begin1 + 1;" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume begin1 < end1;" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume !(begin1 < end1);" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "working0 := begin0;" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume !(working0 != working1);" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume working0 != working1;begin0 := begin0 + 1;" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume begin0 < end0;" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume !(begin0 < end0);" "61636#(< 0 product_workload)") ("61622#true" "havoc next;assume next >= 0;havoc workload;assume workload > 0;working0 := -1;working1 := -1;" "61636#(< 0 product_workload)") ("61704#(and (< 0 product_workload) (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (<= (+ product_workload product_begin1) product_next) (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))" "working1 := begin1;" "61704#(and (< 0 product_workload) (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (<= (+ product_workload product_begin1) product_next) (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))") ("61704#(and (< 0 product_workload) (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (<= (+ product_workload product_begin1) product_next) (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))" "assume !(working0 != working1);" "61704#(and (< 0 product_workload) (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (<= (+ product_workload product_begin1) product_next) (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))") ("61704#(and (< 0 product_workload) (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (<= (+ product_workload product_begin1) product_next) (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))" "assume working0 != working1;begin1 := begin1 + 1;" "61636#(< 0 product_workload)") ("61704#(and (< 0 product_workload) (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (<= (+ product_workload product_begin1) product_next) (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))" "working0 := begin0;" "61704#(and (< 0 product_workload) (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (<= (+ product_workload product_begin1) product_next) (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))") ("61704#(and (< 0 product_workload) (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (<= (+ product_workload product_begin1) product_next) (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))" "assume begin0 < end0;" "61704#(and (< 0 product_workload) (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (<= (+ product_workload product_begin1) product_next) (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))") ("61704#(and (< 0 product_workload) (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (<= (+ product_workload product_begin1) product_next) (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))" "assume !(working0 != working1);" "61704#(and (< 0 product_workload) (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (<= (+ product_workload product_begin1) product_next) (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))") ("61704#(and (< 0 product_workload) (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (<= (+ product_workload product_begin1) product_next) (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))" "assume working0 != working1;begin0 := begin0 + 1;" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))") ("61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))" "working1 := begin1;" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))") ("61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))" "assume !(working0 != working1);" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))") ("61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))" "assume working0 != working1;begin1 := begin1 + 1;" "61636#(< 0 product_workload)") ("61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))" "begin0 := next;next := next + workload;end0 := next;" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))") ("61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))" "assume begin0 < end0;" "61791#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next))))") ("61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))" "working1 := begin1;" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))") ("61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))" "assume !(working0 != working1);" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))") ("61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))" "assume working0 != working1;begin1 := begin1 + 1;" "61636#(< 0 product_workload)") ("61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))" "working0 := begin0;" "61791#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next))))") ("61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))" "assume !(working0 != working1);" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))") ("61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))" "assume working0 != working1;begin0 := begin0 + 1;" "61791#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next))))") ("61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))" "assume begin0 < end0;" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))") ("61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))" "assume !(begin0 < end0);" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))") ("61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "working1 := begin1;" "61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume !(working0 != working1);" "61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume working0 != working1;begin1 := begin1 + 1;" "61713#(and (< 0 product_workload) (= product_end1 product_next))") ("61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "begin0 := next;next := next + workload;end0 := next;" "61704#(and (< 0 product_workload) (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (<= (+ product_workload product_begin1) product_next) (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))") ("61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "working0 := begin0;" "61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume !(working0 != working1);" "61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume working0 != working1;begin0 := begin0 + 1;" "61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "working1 := begin1;" "61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume begin0 < end0;" "61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume !(working0 != working1);" "61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume working0 != working1;begin1 := begin1 + 1;" "61713#(and (< 0 product_workload) (= product_end1 product_next))") ("61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume !(begin0 < end0);" "61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume begin1 < end1;" "61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "working1 := begin1;" "61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume !(working0 != working1);" "61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume working0 != working1;begin1 := begin1 + 1;" "61713#(and (< 0 product_workload) (= product_end1 product_next))") ("61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "begin0 := next;next := next + workload;end0 := next;" "61704#(and (< 0 product_workload) (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (<= (+ product_workload product_begin1) product_next) (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))") ("61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "working1 := begin1;" "61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume begin1 < end1;" "61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume !(working0 != working1);" "61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume working0 != working1;begin1 := begin1 + 1;" "61713#(and (< 0 product_workload) (= product_end1 product_next))") ("61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "working0 := begin0;" "61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume !(working0 != working1);" "61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume working0 != working1;begin0 := begin0 + 1;" "61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume begin0 < end0;" "61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume !(begin0 < end0);" "61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61791#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next))))" "working1 := begin1;" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))") ("61791#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next))))" "working0 := begin0;" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))") ("61791#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next))))" "assume !(working0 != working1);" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))") ("61791#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next))))" "assume working0 != working1;begin0 := begin0 + 1;" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))") ("61791#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next))))" "assume begin0 < end0;" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))") ("61791#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next))))" "assume !(begin0 < end0);" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))") } ); [2018-10-01 00:26:42,856 FATAL L844 BasicCegarLoop]: -- [2018-10-01 00:26:42,857 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: enhanced interpolant automaton in iteration 33 broken: counterexample of length 16 not accepted (original is ok) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.checkEnhancement(BasicCegarLoop.java:819) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:719) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:313) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-01 00:26:42,861 INFO L168 Benchmark]: Toolchain (without parser) took 111883.28 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 390.6 MB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 169.8 MB). Peak memory consumption was 560.3 MB. Max. memory is 7.1 GB. [2018-10-01 00:26:42,863 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:26:42,863 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.73 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:26:42,864 INFO L168 Benchmark]: Boogie Preprocessor took 23.67 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:26:42,864 INFO L168 Benchmark]: RCFGBuilder took 690.63 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-01 00:26:42,865 INFO L168 Benchmark]: TraceAbstraction took 111119.89 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 390.6 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.6 MB). Peak memory consumption was 539.2 MB. Max. memory is 7.1 GB. [2018-10-01 00:26:42,869 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.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.73 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.67 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 690.63 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 111119.89 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 390.6 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.6 MB). Peak memory consumption was 539.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: enhanced interpolant automaton in iteration 33 broken: counterexample of length 16 not accepted (original is ok) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: enhanced interpolant automaton in iteration 33 broken: counterexample of length 16 not accepted (original is ok): de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.checkEnhancement(BasicCegarLoop.java:819) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-01_00-26-42-880.csv Received shutdown request...