/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/parallel-sum-equiv.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-770125f [2021-05-21 20:52:15,961 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-21 20:52:15,964 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-21 20:52:16,000 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-21 20:52:16,001 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-21 20:52:16,004 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-21 20:52:16,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-21 20:52:16,011 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-21 20:52:16,013 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-21 20:52:16,017 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-21 20:52:16,017 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-21 20:52:16,019 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-21 20:52:16,019 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-21 20:52:16,020 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-21 20:52:16,022 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-21 20:52:16,023 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-21 20:52:16,025 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-21 20:52:16,026 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-21 20:52:16,028 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-21 20:52:16,032 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-21 20:52:16,033 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-21 20:52:16,034 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-21 20:52:16,035 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-21 20:52:16,037 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-21 20:52:16,043 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-21 20:52:16,043 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-21 20:52:16,043 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-21 20:52:16,045 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-21 20:52:16,045 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-21 20:52:16,046 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-21 20:52:16,046 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-21 20:52:16,046 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-21 20:52:16,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-21 20:52:16,048 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-21 20:52:16,049 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-21 20:52:16,049 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-21 20:52:16,050 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-21 20:52:16,050 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-21 20:52:16,050 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-21 20:52:16,051 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-21 20:52:16,051 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-21 20:52:16,055 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-05-21 20:52:16,088 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-21 20:52:16,088 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-21 20:52:16,088 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-05-21 20:52:16,088 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-05-21 20:52:16,090 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-05-21 20:52:16,091 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-05-21 20:52:16,091 INFO L138 SettingsManager]: * Use SBE=true [2021-05-21 20:52:16,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-21 20:52:16,091 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-21 20:52:16,091 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-21 20:52:16,092 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-21 20:52:16,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-21 20:52:16,092 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-21 20:52:16,093 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-21 20:52:16,093 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-21 20:52:16,093 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-21 20:52:16,093 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-21 20:52:16,093 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-21 20:52:16,093 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-21 20:52:16,093 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-21 20:52:16,094 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-21 20:52:16,094 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-21 20:52:16,094 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-21 20:52:16,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-21 20:52:16,094 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-21 20:52:16,094 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-05-21 20:52:16,094 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-05-21 20:52:16,095 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-21 20:52:16,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-05-21 20:52:16,095 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-05-21 20:52:16,095 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-21 20:52:16,095 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-05-21 20:52:16,417 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-21 20:52:16,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-21 20:52:16,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-21 20:52:16,448 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-05-21 20:52:16,449 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-05-21 20:52:16,450 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/parallel-sum-equiv.wvr.bpl [2021-05-21 20:52:16,450 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/parallel-sum-equiv.wvr.bpl' [2021-05-21 20:52:16,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-21 20:52:16,495 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-21 20:52:16,496 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-05-21 20:52:16,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-05-21 20:52:16,497 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-05-21 20:52:16,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "parallel-sum-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:52:16" (1/1) ... [2021-05-21 20:52:16,515 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "parallel-sum-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:52:16" (1/1) ... [2021-05-21 20:52:16,521 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-05-21 20:52:16,522 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-21 20:52:16,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-21 20:52:16,523 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-21 20:52:16,529 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "parallel-sum-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:52:16" (1/1) ... [2021-05-21 20:52:16,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "parallel-sum-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:52:16" (1/1) ... [2021-05-21 20:52:16,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "parallel-sum-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:52:16" (1/1) ... [2021-05-21 20:52:16,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "parallel-sum-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:52:16" (1/1) ... [2021-05-21 20:52:16,535 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "parallel-sum-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:52:16" (1/1) ... [2021-05-21 20:52:16,538 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "parallel-sum-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:52:16" (1/1) ... [2021-05-21 20:52:16,538 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "parallel-sum-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:52:16" (1/1) ... [2021-05-21 20:52:16,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-21 20:52:16,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-21 20:52:16,541 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-21 20:52:16,541 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-21 20:52:16,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "parallel-sum-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:52:16" (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 [2021-05-21 20:52:16,616 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-05-21 20:52:16,616 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-05-21 20:52:16,617 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-05-21 20:52:16,617 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-05-21 20:52:16,617 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-05-21 20:52:16,617 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-05-21 20:52:16,617 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-05-21 20:52:16,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-21 20:52:16,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-21 20:52:16,618 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-05-21 20:52:16,618 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-05-21 20:52:16,619 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-05-21 20:52:16,619 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2021-05-21 20:52:16,619 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-05-21 20:52:16,619 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-05-21 20:52:16,620 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-05-21 20:52:16,836 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-21 20:52:16,836 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-05-21 20:52:16,837 WARN L327 CfgBuilder]: Unexpected successor node of atomic block begin: thread2EXIT is neither atomic block end nor error location. [2021-05-21 20:52:16,837 WARN L327 CfgBuilder]: Unexpected successor node of atomic block begin: thread3EXIT is neither atomic block end nor error location. [2021-05-21 20:52:16,837 WARN L327 CfgBuilder]: Unexpected successor node of atomic block begin: thread4EXIT is neither atomic block end nor error location. [2021-05-21 20:52:16,838 INFO L202 PluginConnector]: Adding new model parallel-sum-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.05 08:52:16 BoogieIcfgContainer [2021-05-21 20:52:16,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-21 20:52:16,840 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-21 20:52:16,840 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-21 20:52:16,842 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-21 20:52:16,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "parallel-sum-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:52:16" (1/2) ... [2021-05-21 20:52:16,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@679d3441 and model type parallel-sum-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.05 08:52:16, skipping insertion in model container [2021-05-21 20:52:16,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "parallel-sum-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.05 08:52:16" (2/2) ... [2021-05-21 20:52:16,844 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-sum-equiv.wvr.bpl [2021-05-21 20:52:16,848 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-05-21 20:52:16,849 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-05-21 20:52:16,849 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-05-21 20:52:16,849 INFO L478 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-05-21 20:52:16,950 INFO L149 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2021-05-21 20:52:16,974 INFO L255 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-05-21 20:52:16,989 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-05-21 20:52:16,989 INFO L379 AbstractCegarLoop]: Hoare is false [2021-05-21 20:52:16,990 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-21 20:52:16,990 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-21 20:52:16,990 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-21 20:52:16,990 INFO L383 AbstractCegarLoop]: Difference is false [2021-05-21 20:52:16,990 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-21 20:52:16,990 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-21 20:52:16,997 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 33 transitions, 110 flow [2021-05-21 20:52:17,018 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 105 states, 103 states have (on average 2.9029126213592233) internal successors, (299), 104 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:17,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 103 states have (on average 2.9029126213592233) internal successors, (299), 104 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:17,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-21 20:52:17,031 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:52:17,032 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:52:17,032 INFO L430 AbstractCegarLoop]: === Iteration 1 === [thread1Err3INUSE_VIOLATION, thread1Thread1of1ForFork0Err0INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, thread1Thread1of1ForFork0Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:52:17,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:52:17,040 INFO L82 PathProgramCache]: Analyzing trace with hash 848381826, now seen corresponding path program 1 times [2021-05-21 20:52:17,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:52:17,045 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193977343] [2021-05-21 20:52:17,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:52:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:52:17,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:52:17,238 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:52:17,238 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193977343] [2021-05-21 20:52:17,238 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193977343] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:52:17,239 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:52:17,239 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-21 20:52:17,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772868070] [2021-05-21 20:52:17,244 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-21 20:52:17,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:52:17,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-21 20:52:17,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-21 20:52:17,262 INFO L87 Difference]: Start difference. First operand has 105 states, 103 states have (on average 2.9029126213592233) internal successors, (299), 104 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:17,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:52:17,332 INFO L93 Difference]: Finished difference Result 253 states and 745 transitions. [2021-05-21 20:52:17,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-21 20:52:17,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-05-21 20:52:17,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:52:17,349 INFO L225 Difference]: With dead ends: 253 [2021-05-21 20:52:17,349 INFO L226 Difference]: Without dead ends: 247 [2021-05-21 20:52:17,351 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:52:17,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-05-21 20:52:17,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 143. [2021-05-21 20:52:17,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 2.936619718309859) internal successors, (417), 142 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:17,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 417 transitions. [2021-05-21 20:52:17,418 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 417 transitions. Word has length 16 [2021-05-21 20:52:17,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:52:17,420 INFO L482 AbstractCegarLoop]: Abstraction has 143 states and 417 transitions. [2021-05-21 20:52:17,420 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:17,420 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 417 transitions. [2021-05-21 20:52:17,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-21 20:52:17,423 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:52:17,424 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:52:17,424 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-21 20:52:17,424 INFO L430 AbstractCegarLoop]: === Iteration 2 === [thread1Err3INUSE_VIOLATION, thread1Thread1of1ForFork0Err0INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, thread1Thread1of1ForFork0Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:52:17,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:52:17,428 INFO L82 PathProgramCache]: Analyzing trace with hash 890214852, now seen corresponding path program 2 times [2021-05-21 20:52:17,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:52:17,428 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413039063] [2021-05-21 20:52:17,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:52:17,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:52:17,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:52:17,476 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:52:17,476 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413039063] [2021-05-21 20:52:17,476 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413039063] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:52:17,477 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:52:17,477 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-21 20:52:17,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104888944] [2021-05-21 20:52:17,478 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-21 20:52:17,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:52:17,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-21 20:52:17,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-21 20:52:17,479 INFO L87 Difference]: Start difference. First operand 143 states and 417 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:17,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:52:17,530 INFO L93 Difference]: Finished difference Result 262 states and 765 transitions. [2021-05-21 20:52:17,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-21 20:52:17,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-05-21 20:52:17,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:52:17,535 INFO L225 Difference]: With dead ends: 262 [2021-05-21 20:52:17,535 INFO L226 Difference]: Without dead ends: 256 [2021-05-21 20:52:17,536 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:52:17,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-05-21 20:52:17,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 145. [2021-05-21 20:52:17,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 2.923611111111111) internal successors, (421), 144 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:17,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 421 transitions. [2021-05-21 20:52:17,545 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 421 transitions. Word has length 16 [2021-05-21 20:52:17,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:52:17,545 INFO L482 AbstractCegarLoop]: Abstraction has 145 states and 421 transitions. [2021-05-21 20:52:17,545 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:17,546 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 421 transitions. [2021-05-21 20:52:17,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-21 20:52:17,547 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:52:17,547 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:52:17,547 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-21 20:52:17,547 INFO L430 AbstractCegarLoop]: === Iteration 3 === [thread1Err3INUSE_VIOLATION, thread1Thread1of1ForFork0Err0INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, thread1Thread1of1ForFork0Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:52:17,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:52:17,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1702344252, now seen corresponding path program 1 times [2021-05-21 20:52:17,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:52:17,548 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594190257] [2021-05-21 20:52:17,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:52:17,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:52:17,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:52:17,596 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:52:17,596 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594190257] [2021-05-21 20:52:17,597 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594190257] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-21 20:52:17,597 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241245314] [2021-05-21 20:52:17,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-21 20:52:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:52:17,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2021-05-21 20:52:17,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-21 20:52:17,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:52:17,785 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241245314] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-21 20:52:17,785 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-21 20:52:17,786 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-05-21 20:52:17,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504035408] [2021-05-21 20:52:17,787 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:52:17,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:52:17,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:52:17,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:52:17,793 INFO L87 Difference]: Start difference. First operand 145 states and 421 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:17,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:52:17,854 INFO L93 Difference]: Finished difference Result 199 states and 578 transitions. [2021-05-21 20:52:17,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:52:17,855 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-05-21 20:52:17,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:52:17,857 INFO L225 Difference]: With dead ends: 199 [2021-05-21 20:52:17,857 INFO L226 Difference]: Without dead ends: 199 [2021-05-21 20:52:17,857 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 37.4ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:52:17,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-05-21 20:52:17,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 149. [2021-05-21 20:52:17,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 3.0067567567567566) internal successors, (445), 148 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:17,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 445 transitions. [2021-05-21 20:52:17,927 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 445 transitions. Word has length 18 [2021-05-21 20:52:17,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:52:17,927 INFO L482 AbstractCegarLoop]: Abstraction has 149 states and 445 transitions. [2021-05-21 20:52:17,927 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:17,928 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 445 transitions. [2021-05-21 20:52:17,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-21 20:52:17,932 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:52:17,932 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:52:18,154 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-05-21 20:52:18,155 INFO L430 AbstractCegarLoop]: === Iteration 4 === [thread1Err3INUSE_VIOLATION, thread1Thread1of1ForFork0Err0INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, thread1Thread1of1ForFork0Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:52:18,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:52:18,155 INFO L82 PathProgramCache]: Analyzing trace with hash -735916285, now seen corresponding path program 1 times [2021-05-21 20:52:18,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:52:18,155 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562314739] [2021-05-21 20:52:18,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:52:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:52:18,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:52:18,185 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:52:18,185 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562314739] [2021-05-21 20:52:18,185 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562314739] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:52:18,186 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:52:18,186 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:52:18,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398737262] [2021-05-21 20:52:18,186 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:52:18,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:52:18,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:52:18,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:52:18,187 INFO L87 Difference]: Start difference. First operand 149 states and 445 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:18,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:52:18,259 INFO L93 Difference]: Finished difference Result 246 states and 702 transitions. [2021-05-21 20:52:18,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:52:18,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-05-21 20:52:18,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:52:18,261 INFO L225 Difference]: With dead ends: 246 [2021-05-21 20:52:18,261 INFO L226 Difference]: Without dead ends: 214 [2021-05-21 20:52:18,261 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 26.0ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:52:18,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-05-21 20:52:18,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 164. [2021-05-21 20:52:18,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 2.901840490797546) internal successors, (473), 163 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:18,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 473 transitions. [2021-05-21 20:52:18,268 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 473 transitions. Word has length 18 [2021-05-21 20:52:18,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:52:18,268 INFO L482 AbstractCegarLoop]: Abstraction has 164 states and 473 transitions. [2021-05-21 20:52:18,268 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:18,268 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 473 transitions. [2021-05-21 20:52:18,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-21 20:52:18,269 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:52:18,269 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:52:18,269 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-21 20:52:18,269 INFO L430 AbstractCegarLoop]: === Iteration 5 === [thread1Err3INUSE_VIOLATION, thread1Thread1of1ForFork0Err0INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, thread1Thread1of1ForFork0Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:52:18,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:52:18,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1382578898, now seen corresponding path program 1 times [2021-05-21 20:52:18,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:52:18,270 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199510186] [2021-05-21 20:52:18,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:52:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:52:18,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:52:18,294 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:52:18,294 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199510186] [2021-05-21 20:52:18,295 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199510186] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:52:18,295 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:52:18,295 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-21 20:52:18,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269739571] [2021-05-21 20:52:18,295 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-21 20:52:18,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:52:18,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-21 20:52:18,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 20:52:18,296 INFO L87 Difference]: Start difference. First operand 164 states and 473 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:18,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:52:18,308 INFO L93 Difference]: Finished difference Result 153 states and 416 transitions. [2021-05-21 20:52:18,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-21 20:52:18,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-05-21 20:52:18,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:52:18,310 INFO L225 Difference]: With dead ends: 153 [2021-05-21 20:52:18,310 INFO L226 Difference]: Without dead ends: 137 [2021-05-21 20:52:18,310 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 20:52:18,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-05-21 20:52:18,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2021-05-21 20:52:18,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 2.7954545454545454) internal successors, (369), 132 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:18,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 369 transitions. [2021-05-21 20:52:18,315 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 369 transitions. Word has length 18 [2021-05-21 20:52:18,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:52:18,316 INFO L482 AbstractCegarLoop]: Abstraction has 133 states and 369 transitions. [2021-05-21 20:52:18,316 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:18,316 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 369 transitions. [2021-05-21 20:52:18,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-21 20:52:18,318 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:52:18,318 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:52:18,318 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-21 20:52:18,318 INFO L430 AbstractCegarLoop]: === Iteration 6 === [thread1Err3INUSE_VIOLATION, thread1Thread1of1ForFork0Err0INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, thread1Thread1of1ForFork0Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:52:18,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:52:18,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1747969668, now seen corresponding path program 2 times [2021-05-21 20:52:18,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:52:18,319 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295693331] [2021-05-21 20:52:18,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:52:18,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:52:18,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:52:18,362 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:52:18,362 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295693331] [2021-05-21 20:52:18,362 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295693331] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-21 20:52:18,362 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17891240] [2021-05-21 20:52:18,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-21 20:52:18,402 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-21 20:52:18,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-21 20:52:18,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2021-05-21 20:52:18,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-21 20:52:18,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:52:18,505 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17891240] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-21 20:52:18,505 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-21 20:52:18,505 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-05-21 20:52:18,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522991240] [2021-05-21 20:52:18,506 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:52:18,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:52:18,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:52:18,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:52:18,510 INFO L87 Difference]: Start difference. First operand 133 states and 369 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:18,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:52:18,560 INFO L93 Difference]: Finished difference Result 205 states and 550 transitions. [2021-05-21 20:52:18,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:52:18,560 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-05-21 20:52:18,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:52:18,562 INFO L225 Difference]: With dead ends: 205 [2021-05-21 20:52:18,562 INFO L226 Difference]: Without dead ends: 205 [2021-05-21 20:52:18,562 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 29.7ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:52:18,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-05-21 20:52:18,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 136. [2021-05-21 20:52:18,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 2.837037037037037) internal successors, (383), 135 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:18,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 383 transitions. [2021-05-21 20:52:18,566 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 383 transitions. Word has length 18 [2021-05-21 20:52:18,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:52:18,566 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 383 transitions. [2021-05-21 20:52:18,566 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:18,566 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 383 transitions. [2021-05-21 20:52:18,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-21 20:52:18,567 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:52:18,567 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:52:18,780 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-21 20:52:18,781 INFO L430 AbstractCegarLoop]: === Iteration 7 === [thread1Err3INUSE_VIOLATION, thread1Thread1of1ForFork0Err0INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, thread1Thread1of1ForFork0Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:52:18,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:52:18,781 INFO L82 PathProgramCache]: Analyzing trace with hash -141666181, now seen corresponding path program 2 times [2021-05-21 20:52:18,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:52:18,781 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283182343] [2021-05-21 20:52:18,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:52:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:52:18,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:52:18,807 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:52:18,807 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283182343] [2021-05-21 20:52:18,807 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283182343] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:52:18,807 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:52:18,807 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:52:18,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371546615] [2021-05-21 20:52:18,808 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:52:18,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:52:18,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:52:18,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:52:18,808 INFO L87 Difference]: Start difference. First operand 136 states and 383 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:18,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:52:18,878 INFO L93 Difference]: Finished difference Result 253 states and 641 transitions. [2021-05-21 20:52:18,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-21 20:52:18,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-05-21 20:52:18,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:52:18,880 INFO L225 Difference]: With dead ends: 253 [2021-05-21 20:52:18,880 INFO L226 Difference]: Without dead ends: 244 [2021-05-21 20:52:18,881 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 28.5ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-21 20:52:18,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-05-21 20:52:18,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 160. [2021-05-21 20:52:18,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 2.811320754716981) internal successors, (447), 159 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:18,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 447 transitions. [2021-05-21 20:52:18,887 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 447 transitions. Word has length 18 [2021-05-21 20:52:18,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:52:18,887 INFO L482 AbstractCegarLoop]: Abstraction has 160 states and 447 transitions. [2021-05-21 20:52:18,887 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:18,887 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 447 transitions. [2021-05-21 20:52:18,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-21 20:52:18,888 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:52:18,888 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:52:18,888 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-21 20:52:18,888 INFO L430 AbstractCegarLoop]: === Iteration 8 === [thread1Err3INUSE_VIOLATION, thread1Thread1of1ForFork0Err0INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, thread1Thread1of1ForFork0Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:52:18,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:52:18,888 INFO L82 PathProgramCache]: Analyzing trace with hash -2044687976, now seen corresponding path program 3 times [2021-05-21 20:52:18,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:52:18,889 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031252290] [2021-05-21 20:52:18,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:52:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:52:18,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:52:18,911 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:52:18,911 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031252290] [2021-05-21 20:52:18,911 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031252290] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:52:18,911 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:52:18,912 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:52:18,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575580705] [2021-05-21 20:52:18,912 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:52:18,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:52:18,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:52:18,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:52:18,913 INFO L87 Difference]: Start difference. First operand 160 states and 447 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:18,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:52:18,968 INFO L93 Difference]: Finished difference Result 211 states and 560 transitions. [2021-05-21 20:52:18,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:52:18,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-05-21 20:52:18,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:52:18,970 INFO L225 Difference]: With dead ends: 211 [2021-05-21 20:52:18,970 INFO L226 Difference]: Without dead ends: 208 [2021-05-21 20:52:18,970 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 26.2ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:52:18,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-05-21 20:52:18,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 160. [2021-05-21 20:52:18,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 2.792452830188679) internal successors, (444), 159 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:18,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 444 transitions. [2021-05-21 20:52:18,975 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 444 transitions. Word has length 18 [2021-05-21 20:52:18,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:52:18,975 INFO L482 AbstractCegarLoop]: Abstraction has 160 states and 444 transitions. [2021-05-21 20:52:18,975 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:18,975 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 444 transitions. [2021-05-21 20:52:18,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-21 20:52:18,976 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:52:18,976 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:52:18,976 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-21 20:52:18,976 INFO L430 AbstractCegarLoop]: === Iteration 9 === [thread1Err3INUSE_VIOLATION, thread1Thread1of1ForFork0Err0INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, thread1Thread1of1ForFork0Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:52:18,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:52:18,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1877852891, now seen corresponding path program 3 times [2021-05-21 20:52:18,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:52:18,977 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819885328] [2021-05-21 20:52:18,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:52:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:52:18,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:52:18,997 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:52:18,997 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819885328] [2021-05-21 20:52:18,998 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819885328] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:52:18,998 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:52:18,998 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:52:18,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329708089] [2021-05-21 20:52:18,998 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:52:18,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:52:18,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:52:18,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:52:18,999 INFO L87 Difference]: Start difference. First operand 160 states and 444 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:19,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:52:19,044 INFO L93 Difference]: Finished difference Result 190 states and 515 transitions. [2021-05-21 20:52:19,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:52:19,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-05-21 20:52:19,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:52:19,047 INFO L225 Difference]: With dead ends: 190 [2021-05-21 20:52:19,047 INFO L226 Difference]: Without dead ends: 190 [2021-05-21 20:52:19,047 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.7ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:52:19,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-05-21 20:52:19,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 142. [2021-05-21 20:52:19,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 2.8085106382978724) internal successors, (396), 141 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:19,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 396 transitions. [2021-05-21 20:52:19,051 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 396 transitions. Word has length 18 [2021-05-21 20:52:19,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:52:19,053 INFO L482 AbstractCegarLoop]: Abstraction has 142 states and 396 transitions. [2021-05-21 20:52:19,053 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:19,053 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 396 transitions. [2021-05-21 20:52:19,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-21 20:52:19,053 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:52:19,053 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:52:19,054 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-21 20:52:19,054 INFO L430 AbstractCegarLoop]: === Iteration 10 === [thread1Err3INUSE_VIOLATION, thread1Thread1of1ForFork0Err0INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, thread1Thread1of1ForFork0Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:52:19,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:52:19,054 INFO L82 PathProgramCache]: Analyzing trace with hash -663824830, now seen corresponding path program 4 times [2021-05-21 20:52:19,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:52:19,054 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17384998] [2021-05-21 20:52:19,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:52:19,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:52:19,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:52:19,100 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:52:19,100 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17384998] [2021-05-21 20:52:19,100 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17384998] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-21 20:52:19,100 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985237374] [2021-05-21 20:52:19,100 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-21 20:52:19,147 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-05-21 20:52:19,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-21 20:52:19,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2021-05-21 20:52:19,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-21 20:52:19,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:52:19,222 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985237374] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-21 20:52:19,222 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-21 20:52:19,222 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-05-21 20:52:19,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517119744] [2021-05-21 20:52:19,223 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:52:19,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:52:19,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:52:19,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:52:19,223 INFO L87 Difference]: Start difference. First operand 142 states and 396 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:19,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:52:19,275 INFO L93 Difference]: Finished difference Result 193 states and 511 transitions. [2021-05-21 20:52:19,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:52:19,275 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-05-21 20:52:19,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:52:19,277 INFO L225 Difference]: With dead ends: 193 [2021-05-21 20:52:19,277 INFO L226 Difference]: Without dead ends: 193 [2021-05-21 20:52:19,277 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 31.9ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:52:19,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-05-21 20:52:19,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 142. [2021-05-21 20:52:19,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 2.8085106382978724) internal successors, (396), 141 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:19,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 396 transitions. [2021-05-21 20:52:19,282 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 396 transitions. Word has length 18 [2021-05-21 20:52:19,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:52:19,282 INFO L482 AbstractCegarLoop]: Abstraction has 142 states and 396 transitions. [2021-05-21 20:52:19,282 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:19,282 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 396 transitions. [2021-05-21 20:52:19,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-21 20:52:19,283 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:52:19,283 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:52:19,505 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-05-21 20:52:19,505 INFO L430 AbstractCegarLoop]: === Iteration 11 === [thread1Err3INUSE_VIOLATION, thread1Thread1of1ForFork0Err0INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, thread1Thread1of1ForFork0Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:52:19,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:52:19,505 INFO L82 PathProgramCache]: Analyzing trace with hash 810916037, now seen corresponding path program 4 times [2021-05-21 20:52:19,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:52:19,506 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448482375] [2021-05-21 20:52:19,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:52:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:52:19,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:52:19,532 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:52:19,532 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448482375] [2021-05-21 20:52:19,532 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448482375] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:52:19,532 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:52:19,532 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:52:19,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408764473] [2021-05-21 20:52:19,533 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:52:19,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:52:19,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:52:19,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:52:19,534 INFO L87 Difference]: Start difference. First operand 142 states and 396 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:19,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:52:19,593 INFO L93 Difference]: Finished difference Result 197 states and 512 transitions. [2021-05-21 20:52:19,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:52:19,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-05-21 20:52:19,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:52:19,598 INFO L225 Difference]: With dead ends: 197 [2021-05-21 20:52:19,598 INFO L226 Difference]: Without dead ends: 188 [2021-05-21 20:52:19,598 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 27.9ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:52:19,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-05-21 20:52:19,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 164. [2021-05-21 20:52:19,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 2.791411042944785) internal successors, (455), 163 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:19,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 455 transitions. [2021-05-21 20:52:19,603 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 455 transitions. Word has length 18 [2021-05-21 20:52:19,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:52:19,603 INFO L482 AbstractCegarLoop]: Abstraction has 164 states and 455 transitions. [2021-05-21 20:52:19,603 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:19,603 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 455 transitions. [2021-05-21 20:52:19,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-21 20:52:19,604 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:52:19,604 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:52:19,604 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-21 20:52:19,604 INFO L430 AbstractCegarLoop]: === Iteration 12 === [thread1Err3INUSE_VIOLATION, thread1Thread1of1ForFork0Err0INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, thread1Thread1of1ForFork0Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:52:19,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:52:19,605 INFO L82 PathProgramCache]: Analyzing trace with hash -951885686, now seen corresponding path program 5 times [2021-05-21 20:52:19,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:52:19,605 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195044618] [2021-05-21 20:52:19,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:52:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:52:19,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:52:19,625 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:52:19,625 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195044618] [2021-05-21 20:52:19,625 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195044618] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:52:19,625 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:52:19,626 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:52:19,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550478830] [2021-05-21 20:52:19,626 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:52:19,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:52:19,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:52:19,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:52:19,627 INFO L87 Difference]: Start difference. First operand 164 states and 455 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:19,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:52:19,710 INFO L93 Difference]: Finished difference Result 248 states and 641 transitions. [2021-05-21 20:52:19,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-21 20:52:19,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-05-21 20:52:19,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:52:19,712 INFO L225 Difference]: With dead ends: 248 [2021-05-21 20:52:19,712 INFO L226 Difference]: Without dead ends: 245 [2021-05-21 20:52:19,713 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 32.7ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-21 20:52:19,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-05-21 20:52:19,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 164. [2021-05-21 20:52:19,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 2.773006134969325) internal successors, (452), 163 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:19,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 452 transitions. [2021-05-21 20:52:19,718 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 452 transitions. Word has length 18 [2021-05-21 20:52:19,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:52:19,718 INFO L482 AbstractCegarLoop]: Abstraction has 164 states and 452 transitions. [2021-05-21 20:52:19,718 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:19,718 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 452 transitions. [2021-05-21 20:52:19,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-21 20:52:19,719 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:52:19,719 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:52:19,719 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-21 20:52:19,719 INFO L430 AbstractCegarLoop]: === Iteration 13 === [thread1Err3INUSE_VIOLATION, thread1Thread1of1ForFork0Err0INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, thread1Thread1of1ForFork0Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:52:19,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:52:19,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1324312115, now seen corresponding path program 5 times [2021-05-21 20:52:19,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:52:19,720 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728818572] [2021-05-21 20:52:19,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:52:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:52:19,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:52:19,740 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:52:19,740 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728818572] [2021-05-21 20:52:19,740 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728818572] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:52:19,741 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:52:19,741 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:52:19,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645044804] [2021-05-21 20:52:19,741 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:52:19,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:52:19,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:52:19,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:52:19,742 INFO L87 Difference]: Start difference. First operand 164 states and 452 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:19,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:52:19,801 INFO L93 Difference]: Finished difference Result 190 states and 503 transitions. [2021-05-21 20:52:19,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:52:19,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-05-21 20:52:19,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:52:19,803 INFO L225 Difference]: With dead ends: 190 [2021-05-21 20:52:19,803 INFO L226 Difference]: Without dead ends: 190 [2021-05-21 20:52:19,803 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.0ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:52:19,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-05-21 20:52:19,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 161. [2021-05-21 20:52:19,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 2.775) internal successors, (444), 160 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:19,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 444 transitions. [2021-05-21 20:52:19,807 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 444 transitions. Word has length 18 [2021-05-21 20:52:19,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:52:19,807 INFO L482 AbstractCegarLoop]: Abstraction has 161 states and 444 transitions. [2021-05-21 20:52:19,807 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:19,808 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 444 transitions. [2021-05-21 20:52:19,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-21 20:52:19,808 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:52:19,808 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:52:19,808 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-21 20:52:19,808 INFO L430 AbstractCegarLoop]: === Iteration 14 === [thread1Err3INUSE_VIOLATION, thread1Thread1of1ForFork0Err0INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, thread1Thread1of1ForFork0Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:52:19,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:52:19,809 INFO L82 PathProgramCache]: Analyzing trace with hash 11936556, now seen corresponding path program 6 times [2021-05-21 20:52:19,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:52:19,809 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392913278] [2021-05-21 20:52:19,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:52:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:52:19,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:52:19,827 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:52:19,827 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392913278] [2021-05-21 20:52:19,827 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392913278] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:52:19,828 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:52:19,828 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:52:19,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913195240] [2021-05-21 20:52:19,828 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:52:19,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:52:19,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:52:19,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:52:19,829 INFO L87 Difference]: Start difference. First operand 161 states and 444 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:19,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:52:19,882 INFO L93 Difference]: Finished difference Result 164 states and 446 transitions. [2021-05-21 20:52:19,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:52:19,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-05-21 20:52:19,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:52:19,890 INFO L225 Difference]: With dead ends: 164 [2021-05-21 20:52:19,890 INFO L226 Difference]: Without dead ends: 160 [2021-05-21 20:52:19,890 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 28.9ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:52:19,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-05-21 20:52:19,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2021-05-21 20:52:19,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 2.779874213836478) internal successors, (442), 159 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:19,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 442 transitions. [2021-05-21 20:52:19,895 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 442 transitions. Word has length 18 [2021-05-21 20:52:19,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:52:19,895 INFO L482 AbstractCegarLoop]: Abstraction has 160 states and 442 transitions. [2021-05-21 20:52:19,895 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:19,895 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 442 transitions. [2021-05-21 20:52:19,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-21 20:52:19,896 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:52:19,896 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:52:19,896 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-21 20:52:19,896 INFO L430 AbstractCegarLoop]: === Iteration 15 === [thread1Err3INUSE_VIOLATION, thread1Thread1of1ForFork0Err0INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, thread1Thread1of1ForFork0Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:52:19,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:52:19,897 INFO L82 PathProgramCache]: Analyzing trace with hash 459545933, now seen corresponding path program 6 times [2021-05-21 20:52:19,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:52:19,897 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548681026] [2021-05-21 20:52:19,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:52:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:52:19,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:52:19,914 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:52:19,914 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548681026] [2021-05-21 20:52:19,914 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548681026] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:52:19,915 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:52:19,915 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:52:19,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135038299] [2021-05-21 20:52:19,915 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:52:19,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:52:19,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:52:19,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:52:19,916 INFO L87 Difference]: Start difference. First operand 160 states and 442 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:19,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:52:19,957 INFO L93 Difference]: Finished difference Result 153 states and 422 transitions. [2021-05-21 20:52:19,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:52:19,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-05-21 20:52:19,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:52:19,959 INFO L225 Difference]: With dead ends: 153 [2021-05-21 20:52:19,959 INFO L226 Difference]: Without dead ends: 153 [2021-05-21 20:52:19,959 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:52:19,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-05-21 20:52:19,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 135. [2021-05-21 20:52:19,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 2.791044776119403) internal successors, (374), 134 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:19,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 374 transitions. [2021-05-21 20:52:19,962 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 374 transitions. Word has length 18 [2021-05-21 20:52:19,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:52:19,963 INFO L482 AbstractCegarLoop]: Abstraction has 135 states and 374 transitions. [2021-05-21 20:52:19,963 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:52:19,963 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 374 transitions. [2021-05-21 20:52:19,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-21 20:52:19,963 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:52:19,963 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:52:19,964 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-21 20:52:19,964 INFO L430 AbstractCegarLoop]: === Iteration 16 === [thread1Err3INUSE_VIOLATION, thread1Thread1of1ForFork0Err0INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, thread1Thread1of1ForFork0Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:52:19,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:52:19,964 INFO L82 PathProgramCache]: Analyzing trace with hash 442648773, now seen corresponding path program 1 times [2021-05-21 20:52:19,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:52:19,964 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98336854] [2021-05-21 20:52:19,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:52:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:52:20,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:52:20,072 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:52:20,072 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98336854] [2021-05-21 20:52:20,072 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98336854] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-21 20:52:20,072 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366489710] [2021-05-21 20:52:20,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-21 20:52:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:52:20,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 21 conjunts are in the unsatisfiable core [2021-05-21 20:52:20,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-21 20:52:20,134 WARN L348 FreeRefinementEngine]: Global settings require throwing the following exception [2021-05-21 20:52:20,356 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-21 20:52:20,357 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.EqualityInformation.getEqinfo(EqualityInformation.java:130) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.XnfDer.derSimple(XnfDer.java:308) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.XnfDer.tryToEliminate_EqInfoBased(XnfDer.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.XnfDer.tryToEliminate(XnfDer.java:101) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:100) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:374) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:69) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:63) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-05-21 20:52:20,359 INFO L168 Benchmark]: Toolchain (without parser) took 3863.88 ms. Allocated memory is still 364.9 MB. Free memory was 344.6 MB in the beginning and 275.7 MB in the end (delta: 68.9 MB). Peak memory consumption was 70.9 MB. Max. memory is 16.0 GB. [2021-05-21 20:52:20,359 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.14 ms. Allocated memory is still 364.9 MB. Free memory is still 345.8 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-05-21 20:52:20,359 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.67 ms. Allocated memory is still 364.9 MB. Free memory was 344.5 MB in the beginning and 343.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-05-21 20:52:20,359 INFO L168 Benchmark]: Boogie Preprocessor took 17.25 ms. Allocated memory is still 364.9 MB. Free memory was 343.1 MB in the beginning and 342.1 MB in the end (delta: 977.8 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-05-21 20:52:20,359 INFO L168 Benchmark]: RCFGBuilder took 297.96 ms. Allocated memory is still 364.9 MB. Free memory was 342.0 MB in the beginning and 326.4 MB in the end (delta: 15.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. [2021-05-21 20:52:20,360 INFO L168 Benchmark]: TraceAbstraction took 3518.94 ms. Allocated memory is still 364.9 MB. Free memory was 325.9 MB in the beginning and 275.7 MB in the end (delta: 50.2 MB). Peak memory consumption was 52.0 MB. Max. memory is 16.0 GB. [2021-05-21 20:52:20,360 INFO L339 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.14 ms. Allocated memory is still 364.9 MB. Free memory is still 345.8 MB. There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 24.67 ms. Allocated memory is still 364.9 MB. Free memory was 344.5 MB in the beginning and 343.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 17.25 ms. Allocated memory is still 364.9 MB. Free memory was 343.1 MB in the beginning and 342.1 MB in the end (delta: 977.8 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 297.96 ms. Allocated memory is still 364.9 MB. Free memory was 342.0 MB in the beginning and 326.4 MB in the end (delta: 15.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 3518.94 ms. Allocated memory is still 364.9 MB. Free memory was 325.9 MB in the beginning and 275.7 MB in the end (delta: 50.2 MB). Peak memory consumption was 52.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.EqualityInformation.getEqinfo(EqualityInformation.java:130) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...