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_WithProcedures.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:36:28,832 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:36:28,834 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:36:28,846 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:36:28,846 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:36:28,847 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:36:28,848 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:36:28,851 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:36:28,852 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:36:28,853 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:36:28,854 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:36:28,854 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:36:28,855 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:36:28,856 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:36:28,857 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:36:28,858 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:36:28,859 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:36:28,861 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:36:28,863 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:36:28,865 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:36:28,870 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:36:28,877 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:36:28,879 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:36:28,880 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:36:28,880 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:36:28,881 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:36:28,887 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:36:28,888 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:36:28,889 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:36:28,890 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:36:28,890 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:36:28,891 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:36:28,891 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:36:28,891 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:36:28,895 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:36:28,896 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:36:28,896 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-04 09:36:28,925 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:36:28,925 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:36:28,927 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:36:28,927 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:36:28,928 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:36:28,928 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:36:28,928 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:36:28,928 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:36:28,928 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:36:28,929 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:36:28,929 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:36:28,929 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:36:28,929 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:36:28,929 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:36:28,929 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:36:28,930 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:36:28,930 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:36:28,930 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:36:28,930 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:36:28,931 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:36:28,931 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:36:28,931 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:36:28,931 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:36:28,931 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:36:28,932 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:36:28,932 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:36:28,932 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:36:28,932 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:36:28,932 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:36:28,933 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:36:28,933 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 09:36:28,978 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:36:28,990 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:36:28,994 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:36:28,996 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:36:28,996 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:36:28,997 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithProcedures.bpl [2018-10-04 09:36:28,997 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithProcedures.bpl' [2018-10-04 09:36:29,051 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:36:29,053 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:36:29,053 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:36:29,054 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:36:29,054 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:36:29,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:36:29" (1/1) ... [2018-10-04 09:36:29,092 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:36:29" (1/1) ... [2018-10-04 09:36:29,102 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:36:29,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:36:29,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:36:29,104 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:36:29,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:36:29" (1/1) ... [2018-10-04 09:36:29,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:36:29" (1/1) ... [2018-10-04 09:36:29,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:36:29" (1/1) ... [2018-10-04 09:36:29,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:36:29" (1/1) ... [2018-10-04 09:36:29,127 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:36:29" (1/1) ... [2018-10-04 09:36:29,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:36:29" (1/1) ... [2018-10-04 09:36:29,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:36:29" (1/1) ... [2018-10-04 09:36:29,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:36:29,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:36:29,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:36:29,134 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:36:29,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:36:29" (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-04 09:36:29,211 INFO L130 BoogieDeclarations]: Found specification of procedure l1l0 [2018-10-04 09:36:29,211 INFO L138 BoogieDeclarations]: Found implementation of procedure l1l0 [2018-10-04 09:36:29,211 INFO L130 BoogieDeclarations]: Found specification of procedure l0l1 [2018-10-04 09:36:29,212 INFO L138 BoogieDeclarations]: Found implementation of procedure l0l1 [2018-10-04 09:36:29,212 INFO L130 BoogieDeclarations]: Found specification of procedure l0l0 [2018-10-04 09:36:29,212 INFO L138 BoogieDeclarations]: Found implementation of procedure l0l0 [2018-10-04 09:36:29,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 09:36:29,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 09:36:29,213 INFO L130 BoogieDeclarations]: Found specification of procedure l1l1 [2018-10-04 09:36:29,213 INFO L138 BoogieDeclarations]: Found implementation of procedure l1l1 [2018-10-04 09:36:29,767 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 09:36:29,768 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:36:29 BoogieIcfgContainer [2018-10-04 09:36:29,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:36:29,769 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:36:29,769 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:36:29,773 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:36:29,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:36:29" (1/2) ... [2018-10-04 09:36:29,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bc604fc and model type threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:36:29, skipping insertion in model container [2018-10-04 09:36:29,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:36:29" (2/2) ... [2018-10-04 09:36:29,777 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product_WithProcedures.bpl [2018-10-04 09:36:29,787 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:36:29,795 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-10-04 09:36:29,846 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:36:29,847 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:36:29,847 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:36:29,847 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:36:29,847 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:36:29,847 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:36:29,847 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:36:29,848 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:36:29,848 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:36:29,869 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-10-04 09:36:29,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 09:36:29,874 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:29,875 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:36:29,877 INFO L423 AbstractCegarLoop]: === Iteration 1 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:29,884 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:29,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1282157605, now seen corresponding path program 1 times [2018-10-04 09:36:29,889 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:29,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:29,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:29,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:29,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:30,162 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-04 09:36:30,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:36:30,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:36:30,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 09:36:30,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 09:36:30,180 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:30,182 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 6 states. [2018-10-04 09:36:31,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:31,022 INFO L93 Difference]: Finished difference Result 72 states and 100 transitions. [2018-10-04 09:36:31,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 09:36:31,024 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-04 09:36:31,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:31,048 INFO L225 Difference]: With dead ends: 72 [2018-10-04 09:36:31,048 INFO L226 Difference]: Without dead ends: 70 [2018-10-04 09:36:31,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 5 [2018-10-04 09:36:31,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-04 09:36:31,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 48. [2018-10-04 09:36:31,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-04 09:36:31,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2018-10-04 09:36:31,094 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 7 [2018-10-04 09:36:31,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:31,095 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2018-10-04 09:36:31,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 09:36:31,095 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2018-10-04 09:36:31,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 09:36:31,096 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:31,096 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:36:31,097 INFO L423 AbstractCegarLoop]: === Iteration 2 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:31,097 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:31,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1272619553, now seen corresponding path program 1 times [2018-10-04 09:36:31,097 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:31,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:31,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:31,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:31,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:31,220 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-04 09:36:31,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:36:31,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:36:31,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 09:36:31,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 09:36:31,223 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:31,223 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand 6 states. [2018-10-04 09:36:32,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:32,050 INFO L93 Difference]: Finished difference Result 81 states and 113 transitions. [2018-10-04 09:36:32,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 09:36:32,053 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-04 09:36:32,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:32,055 INFO L225 Difference]: With dead ends: 81 [2018-10-04 09:36:32,055 INFO L226 Difference]: Without dead ends: 79 [2018-10-04 09:36:32,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 5 [2018-10-04 09:36:32,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-04 09:36:32,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 57. [2018-10-04 09:36:32,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-04 09:36:32,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 78 transitions. [2018-10-04 09:36:32,070 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 78 transitions. Word has length 7 [2018-10-04 09:36:32,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:32,070 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 78 transitions. [2018-10-04 09:36:32,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 09:36:32,071 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2018-10-04 09:36:32,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 09:36:32,072 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:32,072 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:36:32,073 INFO L423 AbstractCegarLoop]: === Iteration 3 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:32,073 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:32,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1601446133, now seen corresponding path program 1 times [2018-10-04 09:36:32,073 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:32,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:32,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:32,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:32,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:32,219 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-04 09:36:32,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:36:32,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 09:36:32,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:36:32,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:36:32,220 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:32,221 INFO L87 Difference]: Start difference. First operand 57 states and 78 transitions. Second operand 7 states. [2018-10-04 09:36:33,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:33,462 INFO L93 Difference]: Finished difference Result 122 states and 175 transitions. [2018-10-04 09:36:33,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:36:33,464 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-10-04 09:36:33,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:33,467 INFO L225 Difference]: With dead ends: 122 [2018-10-04 09:36:33,467 INFO L226 Difference]: Without dead ends: 120 [2018-10-04 09:36:33,468 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:36:33,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-04 09:36:33,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 73. [2018-10-04 09:36:33,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-04 09:36:33,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2018-10-04 09:36:33,486 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 103 transitions. Word has length 10 [2018-10-04 09:36:33,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:33,486 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 103 transitions. [2018-10-04 09:36:33,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:36:33,487 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 103 transitions. [2018-10-04 09:36:33,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 09:36:33,488 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:33,488 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:36:33,489 INFO L423 AbstractCegarLoop]: === Iteration 4 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:33,489 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:33,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1152651256, now seen corresponding path program 1 times [2018-10-04 09:36:33,489 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:33,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:33,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:33,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:33,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:33,627 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-04 09:36:33,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:36:33,627 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-04 09:36:33,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:33,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:36:33,765 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-04 09:36:33,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 09:36:33,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2018-10-04 09:36:33,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:36:33,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:36:33,797 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:33,797 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. Second operand 9 states. [2018-10-04 09:36:34,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:34,614 INFO L93 Difference]: Finished difference Result 168 states and 243 transitions. [2018-10-04 09:36:34,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 09:36:34,615 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2018-10-04 09:36:34,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:34,617 INFO L225 Difference]: With dead ends: 168 [2018-10-04 09:36:34,618 INFO L226 Difference]: Without dead ends: 121 [2018-10-04 09:36:34,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 15 [2018-10-04 09:36:34,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-04 09:36:34,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 97. [2018-10-04 09:36:34,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-04 09:36:34,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 136 transitions. [2018-10-04 09:36:34,641 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 136 transitions. Word has length 10 [2018-10-04 09:36:34,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:34,642 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 136 transitions. [2018-10-04 09:36:34,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:36:34,642 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 136 transitions. [2018-10-04 09:36:34,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 09:36:34,644 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:34,644 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:36:34,644 INFO L423 AbstractCegarLoop]: === Iteration 5 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:34,645 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:34,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1536370777, now seen corresponding path program 1 times [2018-10-04 09:36:34,645 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:34,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:34,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:34,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:34,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:34,770 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-04 09:36:34,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:36:34,771 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-04 09:36:34,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:34,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:34,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:36:34,902 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-04 09:36:34,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:36:34,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-10-04 09:36:34,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:36:34,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:36:34,925 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:34,925 INFO L87 Difference]: Start difference. First operand 97 states and 136 transitions. Second operand 10 states. [2018-10-04 09:36:35,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:35,811 INFO L93 Difference]: Finished difference Result 164 states and 232 transitions. [2018-10-04 09:36:35,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:36:35,812 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-10-04 09:36:35,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:35,814 INFO L225 Difference]: With dead ends: 164 [2018-10-04 09:36:35,814 INFO L226 Difference]: Without dead ends: 162 [2018-10-04 09:36:35,815 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 10 [2018-10-04 09:36:35,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-04 09:36:35,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 109. [2018-10-04 09:36:35,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-04 09:36:35,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2018-10-04 09:36:35,840 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 11 [2018-10-04 09:36:35,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:35,840 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2018-10-04 09:36:35,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:36:35,841 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2018-10-04 09:36:35,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 09:36:35,842 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:35,843 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:36:35,843 INFO L423 AbstractCegarLoop]: === Iteration 6 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:35,843 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:35,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1150793287, now seen corresponding path program 1 times [2018-10-04 09:36:35,844 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:35,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:35,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:35,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:35,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:35,960 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-04 09:36:35,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:36:35,961 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-04 09:36:35,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:36,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:36:36,170 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-04 09:36:36,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:36:36,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-10-04 09:36:36,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:36:36,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:36:36,192 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:36,192 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand 10 states. [2018-10-04 09:36:37,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:37,263 INFO L93 Difference]: Finished difference Result 181 states and 254 transitions. [2018-10-04 09:36:37,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:36:37,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-10-04 09:36:37,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:37,267 INFO L225 Difference]: With dead ends: 181 [2018-10-04 09:36:37,267 INFO L226 Difference]: Without dead ends: 179 [2018-10-04 09:36:37,268 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 10 [2018-10-04 09:36:37,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-04 09:36:37,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 117. [2018-10-04 09:36:37,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-04 09:36:37,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 164 transitions. [2018-10-04 09:36:37,294 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 164 transitions. Word has length 11 [2018-10-04 09:36:37,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:37,294 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 164 transitions. [2018-10-04 09:36:37,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:36:37,295 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 164 transitions. [2018-10-04 09:36:37,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:36:37,297 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:37,297 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:36:37,297 INFO L423 AbstractCegarLoop]: === Iteration 7 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:37,298 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:37,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1829652612, now seen corresponding path program 1 times [2018-10-04 09:36:37,298 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:37,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:37,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:37,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:37,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:37,496 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-04 09:36:37,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:36:37,497 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-04 09:36:37,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:37,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:36:37,604 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-04 09:36:37,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 09:36:37,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2018-10-04 09:36:37,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:36:37,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:36:37,626 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:37,626 INFO L87 Difference]: Start difference. First operand 117 states and 164 transitions. Second operand 9 states. [2018-10-04 09:36:38,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:38,386 INFO L93 Difference]: Finished difference Result 217 states and 304 transitions. [2018-10-04 09:36:38,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 09:36:38,387 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-10-04 09:36:38,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:38,388 INFO L225 Difference]: With dead ends: 217 [2018-10-04 09:36:38,388 INFO L226 Difference]: Without dead ends: 133 [2018-10-04 09:36:38,390 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 15 [2018-10-04 09:36:38,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-04 09:36:38,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 119. [2018-10-04 09:36:38,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-04 09:36:38,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 160 transitions. [2018-10-04 09:36:38,413 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 160 transitions. Word has length 13 [2018-10-04 09:36:38,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:38,413 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 160 transitions. [2018-10-04 09:36:38,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:36:38,413 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 160 transitions. [2018-10-04 09:36:38,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 09:36:38,415 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:38,415 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:36:38,415 INFO L423 AbstractCegarLoop]: === Iteration 8 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:38,415 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:38,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1433054771, now seen corresponding path program 1 times [2018-10-04 09:36:38,416 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:38,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:38,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:38,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:38,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:38,519 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-04 09:36:38,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:36:38,520 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-04 09:36:38,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:38,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:36:38,700 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-04 09:36:38,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:36:38,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 12 [2018-10-04 09:36:38,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 09:36:38,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 09:36:38,724 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:38,724 INFO L87 Difference]: Start difference. First operand 119 states and 160 transitions. Second operand 13 states. [2018-10-04 09:36:39,448 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 7 [2018-10-04 09:36:41,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:41,278 INFO L93 Difference]: Finished difference Result 194 states and 266 transitions. [2018-10-04 09:36:41,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 09:36:41,279 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-10-04 09:36:41,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:41,281 INFO L225 Difference]: With dead ends: 194 [2018-10-04 09:36:41,281 INFO L226 Difference]: Without dead ends: 192 [2018-10-04 09:36:41,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.7s impTime 12 [2018-10-04 09:36:41,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-04 09:36:41,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 181. [2018-10-04 09:36:41,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-04 09:36:41,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 257 transitions. [2018-10-04 09:36:41,332 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 257 transitions. Word has length 14 [2018-10-04 09:36:41,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:41,334 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 257 transitions. [2018-10-04 09:36:41,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 09:36:41,334 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 257 transitions. [2018-10-04 09:36:41,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 09:36:41,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:41,335 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:36:41,335 INFO L423 AbstractCegarLoop]: === Iteration 9 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:41,336 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:41,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1436992942, now seen corresponding path program 1 times [2018-10-04 09:36:41,341 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:41,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:41,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:41,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:41,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:41,470 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-04 09:36:41,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:36:41,470 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-04 09:36:41,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:41,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:41,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:36:41,758 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-04 09:36:41,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:36:41,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 12 [2018-10-04 09:36:41,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 09:36:41,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 09:36:41,791 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:41,791 INFO L87 Difference]: Start difference. First operand 181 states and 257 transitions. Second operand 14 states. [2018-10-04 09:36:42,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 09:36:42,512 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Solver cannot find a model for the term (let ((.cse0 (<= (+ working0 1) 0))) (and (and .cse0 (exists ((begin1 Int)) (and (<= (+ iter1 1) (* 2 begin1)) (<= (+ begin1 1) iter1)))) (not (and .cse0 (<= 3 iter1))))) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.PredicateTrie.getWitness(PredicateTrie.java:213) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:384) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:397) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:404) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:404) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:397) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.restructurePredicateTrie(BPredicateUnifier.java:363) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicateInternal(BPredicateUnifier.java:246) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicate(BPredicateUnifier.java:214) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicate(BPredicateUnifier.java:295) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicateForConjunction(BPredicateUnifier.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) 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:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-04 09:36:42,516 INFO L168 Benchmark]: Toolchain (without parser) took 13464.36 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 29.4 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 275.6 MB). Peak memory consumption was 305.0 MB. Max. memory is 7.1 GB. [2018-10-04 09:36:42,518 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 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-04 09:36:42,519 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.41 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-04 09:36:42,520 INFO L168 Benchmark]: Boogie Preprocessor took 30.28 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-04 09:36:42,520 INFO L168 Benchmark]: RCFGBuilder took 634.39 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-04 09:36:42,521 INFO L168 Benchmark]: TraceAbstraction took 12745.88 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 29.4 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 254.5 MB). Peak memory consumption was 283.8 MB. Max. memory is 7.1 GB. [2018-10-04 09:36:42,526 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.22 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 49.41 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 30.28 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 634.39 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 12745.88 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 29.4 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 254.5 MB). Peak memory consumption was 283.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Solver cannot find a model for the term (let ((.cse0 (<= (+ working0 1) 0))) (and (and .cse0 (exists ((begin1 Int)) (and (<= (+ iter1 1) (* 2 begin1)) (<= (+ begin1 1) iter1)))) (not (and .cse0 (<= 3 iter1))))) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Solver cannot find a model for the term (let ((.cse0 (<= (+ working0 1) 0))) (and (and .cse0 (exists ((begin1 Int)) (and (<= (+ iter1 1) (* 2 begin1)) (<= (+ begin1 1) iter1)))) (not (and .cse0 (<= 3 iter1))))): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.PredicateTrie.getWitness(PredicateTrie.java:213) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product_WithProcedures.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_09-36-42-538.csv Received shutdown request...