/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/popl20/min-max-inc-dec.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-770125f [2021-05-21 21:06:44,850 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-21 21:06:44,852 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-21 21:06:44,869 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-21 21:06:44,869 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-21 21:06:44,870 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-21 21:06:44,871 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-21 21:06:44,872 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-21 21:06:44,873 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-21 21:06:44,873 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-21 21:06:44,874 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-21 21:06:44,874 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-21 21:06:44,875 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-21 21:06:44,875 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-21 21:06:44,876 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-21 21:06:44,876 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-21 21:06:44,877 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-21 21:06:44,877 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-21 21:06:44,878 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-21 21:06:44,879 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-21 21:06:44,880 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-21 21:06:44,880 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-21 21:06:44,881 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-21 21:06:44,882 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-21 21:06:44,883 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-21 21:06:44,883 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-21 21:06:44,883 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-21 21:06:44,884 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-21 21:06:44,884 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-21 21:06:44,884 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-21 21:06:44,885 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-21 21:06:44,885 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-21 21:06:44,885 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-21 21:06:44,886 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-21 21:06:44,886 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-21 21:06:44,886 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-21 21:06:44,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-21 21:06:44,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-21 21:06:44,887 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-21 21:06:44,887 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-21 21:06:44,888 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-21 21:06:44,888 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 21:06:44,902 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-21 21:06:44,903 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-21 21:06:44,903 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-05-21 21:06:44,903 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-05-21 21:06:44,904 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-05-21 21:06:44,904 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-05-21 21:06:44,904 INFO L138 SettingsManager]: * Use SBE=true [2021-05-21 21:06:44,904 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-21 21:06:44,904 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-21 21:06:44,904 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-21 21:06:44,904 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-21 21:06:44,904 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-21 21:06:44,904 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-21 21:06:44,904 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-21 21:06:44,905 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-21 21:06:44,905 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-21 21:06:44,905 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-21 21:06:44,905 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-21 21:06:44,905 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-21 21:06:44,905 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-21 21:06:44,905 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-21 21:06:44,905 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-21 21:06:44,905 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-21 21:06:44,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-21 21:06:44,905 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-21 21:06:44,905 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-05-21 21:06:44,906 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-05-21 21:06:44,906 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-21 21:06:44,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-05-21 21:06:44,906 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-05-21 21:06:44,906 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-21 21:06:44,906 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 21:06:45,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-21 21:06:45,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-21 21:06:45,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-21 21:06:45,136 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-05-21 21:06:45,138 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-05-21 21:06:45,138 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/min-max-inc-dec.wvr.bpl [2021-05-21 21:06:45,139 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/min-max-inc-dec.wvr.bpl' [2021-05-21 21:06:45,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-21 21:06:45,168 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-21 21:06:45,168 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-05-21 21:06:45,169 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-05-21 21:06:45,169 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-05-21 21:06:45,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 09:06:45" (1/1) ... [2021-05-21 21:06:45,181 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 09:06:45" (1/1) ... [2021-05-21 21:06:45,186 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-05-21 21:06:45,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-21 21:06:45,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-21 21:06:45,187 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-21 21:06:45,192 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 09:06:45" (1/1) ... [2021-05-21 21:06:45,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 09:06:45" (1/1) ... [2021-05-21 21:06:45,193 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 09:06:45" (1/1) ... [2021-05-21 21:06:45,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 09:06:45" (1/1) ... [2021-05-21 21:06:45,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 09:06:45" (1/1) ... [2021-05-21 21:06:45,197 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 09:06:45" (1/1) ... [2021-05-21 21:06:45,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 09:06:45" (1/1) ... [2021-05-21 21:06:45,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-21 21:06:45,199 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-21 21:06:45,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-21 21:06:45,199 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-21 21:06:45,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 09:06:45" (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 21:06:45,268 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-05-21 21:06:45,269 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-05-21 21:06:45,269 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-05-21 21:06:45,269 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-05-21 21:06:45,269 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-05-21 21:06:45,269 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-05-21 21:06:45,269 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-05-21 21:06:45,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-21 21:06:45,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-21 21:06:45,270 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-05-21 21:06:45,271 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-05-21 21:06:45,271 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-05-21 21:06:45,271 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2021-05-21 21:06:45,271 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-05-21 21:06:45,271 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-05-21 21:06:45,272 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2021-05-21 21:06:45,272 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2021-05-21 21:06:45,272 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2021-05-21 21:06:45,273 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 21:06:45,493 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-21 21:06:45,493 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-05-21 21:06:45,495 INFO L202 PluginConnector]: Adding new model min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.05 09:06:45 BoogieIcfgContainer [2021-05-21 21:06:45,495 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-21 21:06:45,496 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-21 21:06:45,496 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-21 21:06:45,498 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-21 21:06:45,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 09:06:45" (1/2) ... [2021-05-21 21:06:45,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7827e671 and model type min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.05 09:06:45, skipping insertion in model container [2021-05-21 21:06:45,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.05 09:06:45" (2/2) ... [2021-05-21 21:06:45,499 INFO L111 eAbstractionObserver]: Analyzing ICFG min-max-inc-dec.wvr.bpl [2021-05-21 21:06:45,503 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-05-21 21:06:45,503 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-05-21 21:06:45,503 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-05-21 21:06:45,504 INFO L478 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-05-21 21:06:45,559 INFO L149 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2021-05-21 21:06:45,573 INFO L255 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-05-21 21:06:45,585 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-05-21 21:06:45,585 INFO L379 AbstractCegarLoop]: Hoare is false [2021-05-21 21:06:45,585 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-21 21:06:45,585 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-21 21:06:45,585 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-21 21:06:45,586 INFO L383 AbstractCegarLoop]: Difference is false [2021-05-21 21:06:45,586 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-21 21:06:45,586 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-21 21:06:45,592 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 54 places, 42 transitions, 124 flow [2021-05-21 21:06:45,738 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2848 states, 2846 states have (on average 4.6394940267041465) internal successors, (13204), 2847 states have internal predecessors, (13204), 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 21:06:45,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 2848 states, 2846 states have (on average 4.6394940267041465) internal successors, (13204), 2847 states have internal predecessors, (13204), 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 21:06:45,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-21 21:06:45,772 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:06:45,772 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, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:06:45,773 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 21:06:45,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:06:45,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1318377574, now seen corresponding path program 1 times [2021-05-21 21:06:45,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:06:45,782 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91513395] [2021-05-21 21:06:45,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:06:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:06:45,961 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 21:06:45,962 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:06:45,962 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91513395] [2021-05-21 21:06:45,962 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91513395] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:06:45,963 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:06:45,964 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 21:06:45,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984702811] [2021-05-21 21:06:45,967 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 21:06:45,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:06:45,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 21:06:45,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 21:06:45,992 INFO L87 Difference]: Start difference. First operand has 2848 states, 2846 states have (on average 4.6394940267041465) internal successors, (13204), 2847 states have internal predecessors, (13204), 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 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 21:06:46,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:06:46,264 INFO L93 Difference]: Finished difference Result 13093 states and 60005 transitions. [2021-05-21 21:06:46,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-21 21:06:46,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 27 [2021-05-21 21:06:46,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:06:46,345 INFO L225 Difference]: With dead ends: 13093 [2021-05-21 21:06:46,345 INFO L226 Difference]: Without dead ends: 8907 [2021-05-21 21:06:46,347 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 60.5ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-21 21:06:46,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8907 states. [2021-05-21 21:06:46,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8907 to 3875. [2021-05-21 21:06:46,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3875 states, 3874 states have (on average 4.593959731543624) internal successors, (17797), 3874 states have internal predecessors, (17797), 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 21:06:46,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3875 states to 3875 states and 17797 transitions. [2021-05-21 21:06:46,656 INFO L78 Accepts]: Start accepts. Automaton has 3875 states and 17797 transitions. Word has length 27 [2021-05-21 21:06:46,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:06:46,664 INFO L482 AbstractCegarLoop]: Abstraction has 3875 states and 17797 transitions. [2021-05-21 21:06:46,665 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 21:06:46,665 INFO L276 IsEmpty]: Start isEmpty. Operand 3875 states and 17797 transitions. [2021-05-21 21:06:46,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-21 21:06:46,677 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:06:46,678 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, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:06:46,678 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-21 21:06:46,678 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 21:06:46,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:06:46,681 INFO L82 PathProgramCache]: Analyzing trace with hash 469094076, now seen corresponding path program 2 times [2021-05-21 21:06:46,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:06:46,681 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170694445] [2021-05-21 21:06:46,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:06:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:06:46,731 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 21:06:46,732 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:06:46,732 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170694445] [2021-05-21 21:06:46,733 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170694445] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:06:46,733 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:06:46,733 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-21 21:06:46,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305278466] [2021-05-21 21:06:46,734 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-21 21:06:46,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:06:46,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-21 21:06:46,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-21 21:06:46,736 INFO L87 Difference]: Start difference. First operand 3875 states and 17797 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 21:06:46,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:06:46,877 INFO L93 Difference]: Finished difference Result 4814 states and 21965 transitions. [2021-05-21 21:06:46,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 21:06:46,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2021-05-21 21:06:46,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:06:46,908 INFO L225 Difference]: With dead ends: 4814 [2021-05-21 21:06:46,908 INFO L226 Difference]: Without dead ends: 3427 [2021-05-21 21:06:46,909 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 47.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-21 21:06:46,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3427 states. [2021-05-21 21:06:46,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3427 to 3427. [2021-05-21 21:06:47,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3427 states, 3426 states have (on average 4.5128429655575015) internal successors, (15461), 3426 states have internal predecessors, (15461), 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 21:06:47,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3427 states to 3427 states and 15461 transitions. [2021-05-21 21:06:47,029 INFO L78 Accepts]: Start accepts. Automaton has 3427 states and 15461 transitions. Word has length 27 [2021-05-21 21:06:47,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:06:47,029 INFO L482 AbstractCegarLoop]: Abstraction has 3427 states and 15461 transitions. [2021-05-21 21:06:47,029 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 21:06:47,030 INFO L276 IsEmpty]: Start isEmpty. Operand 3427 states and 15461 transitions. [2021-05-21 21:06:47,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-21 21:06:47,038 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:06:47,038 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, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:06:47,039 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-21 21:06:47,039 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 21:06:47,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:06:47,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1867001510, now seen corresponding path program 3 times [2021-05-21 21:06:47,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:06:47,040 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775998156] [2021-05-21 21:06:47,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:06:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:06:47,102 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 21:06:47,102 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:06:47,102 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775998156] [2021-05-21 21:06:47,102 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775998156] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:06:47,102 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:06:47,103 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 21:06:47,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882294996] [2021-05-21 21:06:47,103 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 21:06:47,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:06:47,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 21:06:47,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 21:06:47,105 INFO L87 Difference]: Start difference. First operand 3427 states and 15461 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 21:06:47,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:06:47,270 INFO L93 Difference]: Finished difference Result 13141 states and 59505 transitions. [2021-05-21 21:06:47,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-21 21:06:47,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 27 [2021-05-21 21:06:47,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:06:47,341 INFO L225 Difference]: With dead ends: 13141 [2021-05-21 21:06:47,342 INFO L226 Difference]: Without dead ends: 9627 [2021-05-21 21:06:47,342 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 25.6ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-21 21:06:47,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9627 states. [2021-05-21 21:06:47,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9627 to 3610. [2021-05-21 21:06:47,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3610 states, 3609 states have (on average 4.5259074535882515) internal successors, (16334), 3609 states have internal predecessors, (16334), 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 21:06:47,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3610 states to 3610 states and 16334 transitions. [2021-05-21 21:06:47,504 INFO L78 Accepts]: Start accepts. Automaton has 3610 states and 16334 transitions. Word has length 27 [2021-05-21 21:06:47,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:06:47,505 INFO L482 AbstractCegarLoop]: Abstraction has 3610 states and 16334 transitions. [2021-05-21 21:06:47,505 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 21:06:47,505 INFO L276 IsEmpty]: Start isEmpty. Operand 3610 states and 16334 transitions. [2021-05-21 21:06:47,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-21 21:06:47,513 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:06:47,513 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, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:06:47,514 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-21 21:06:47,514 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 21:06:47,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:06:47,514 INFO L82 PathProgramCache]: Analyzing trace with hash 261207968, now seen corresponding path program 4 times [2021-05-21 21:06:47,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:06:47,514 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258811898] [2021-05-21 21:06:47,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:06:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:06:47,536 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 21:06:47,537 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:06:47,537 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258811898] [2021-05-21 21:06:47,537 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258811898] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:06:47,537 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:06:47,537 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-21 21:06:47,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259906951] [2021-05-21 21:06:47,537 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-21 21:06:47,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:06:47,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-21 21:06:47,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-21 21:06:47,538 INFO L87 Difference]: Start difference. First operand 3610 states and 16334 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 21:06:47,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:06:47,574 INFO L93 Difference]: Finished difference Result 4293 states and 19350 transitions. [2021-05-21 21:06:47,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 21:06:47,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2021-05-21 21:06:47,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:06:47,586 INFO L225 Difference]: With dead ends: 4293 [2021-05-21 21:06:47,586 INFO L226 Difference]: Without dead ends: 3354 [2021-05-21 21:06:47,586 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-21 21:06:47,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3354 states. [2021-05-21 21:06:47,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3354 to 3354. [2021-05-21 21:06:47,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3354 states, 3353 states have (on average 4.470623322397853) internal successors, (14990), 3353 states have internal predecessors, (14990), 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 21:06:47,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3354 states to 3354 states and 14990 transitions. [2021-05-21 21:06:47,726 INFO L78 Accepts]: Start accepts. Automaton has 3354 states and 14990 transitions. Word has length 27 [2021-05-21 21:06:47,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:06:47,726 INFO L482 AbstractCegarLoop]: Abstraction has 3354 states and 14990 transitions. [2021-05-21 21:06:47,726 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 21:06:47,726 INFO L276 IsEmpty]: Start isEmpty. Operand 3354 states and 14990 transitions. [2021-05-21 21:06:47,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-21 21:06:47,733 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:06:47,733 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:06:47,734 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-21 21:06:47,734 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 21:06:47,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:06:47,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1411704984, now seen corresponding path program 1 times [2021-05-21 21:06:47,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:06:47,735 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400737394] [2021-05-21 21:06:47,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:06:47,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:06:47,834 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 21:06:47,834 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:06:47,834 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400737394] [2021-05-21 21:06:47,834 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400737394] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-21 21:06:47,835 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35192211] [2021-05-21 21:06:47,835 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 21:06:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:06:47,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2021-05-21 21:06:47,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-21 21:06:48,012 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 21:06:48,012 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35192211] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-21 21:06:48,012 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-21 21:06:48,012 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 5 [2021-05-21 21:06:48,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099309102] [2021-05-21 21:06:48,013 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 21:06:48,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:06:48,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 21:06:48,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-05-21 21:06:48,013 INFO L87 Difference]: Start difference. First operand 3354 states and 14990 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 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 21:06:48,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:06:48,091 INFO L93 Difference]: Finished difference Result 6670 states and 29656 transitions. [2021-05-21 21:06:48,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 21:06:48,092 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 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 29 [2021-05-21 21:06:48,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:06:48,115 INFO L225 Difference]: With dead ends: 6670 [2021-05-21 21:06:48,115 INFO L226 Difference]: Without dead ends: 6670 [2021-05-21 21:06:48,115 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 21.9ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-21 21:06:48,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6670 states. [2021-05-21 21:06:48,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6670 to 4206. [2021-05-21 21:06:48,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4206 states, 4205 states have (on average 4.520332936979786) internal successors, (19008), 4205 states have internal predecessors, (19008), 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 21:06:48,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4206 states to 4206 states and 19008 transitions. [2021-05-21 21:06:48,300 INFO L78 Accepts]: Start accepts. Automaton has 4206 states and 19008 transitions. Word has length 29 [2021-05-21 21:06:48,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:06:48,301 INFO L482 AbstractCegarLoop]: Abstraction has 4206 states and 19008 transitions. [2021-05-21 21:06:48,301 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 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 21:06:48,301 INFO L276 IsEmpty]: Start isEmpty. Operand 4206 states and 19008 transitions. [2021-05-21 21:06:48,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-21 21:06:48,310 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:06:48,310 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:06:48,511 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-21 21:06:48,511 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 21:06:48,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:06:48,512 INFO L82 PathProgramCache]: Analyzing trace with hash 279001500, now seen corresponding path program 1 times [2021-05-21 21:06:48,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:06:48,512 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763085692] [2021-05-21 21:06:48,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:06:48,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:06:48,572 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 21:06:48,572 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:06:48,573 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763085692] [2021-05-21 21:06:48,573 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763085692] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-21 21:06:48,573 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821323960] [2021-05-21 21:06:48,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 21:06:48,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:06:48,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2021-05-21 21:06:48,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-21 21:06:48,690 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 21:06:48,690 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821323960] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:06:48,690 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-05-21 21:06:48,690 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2021-05-21 21:06:48,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104689690] [2021-05-21 21:06:48,691 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-21 21:06:48,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:06:48,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-21 21:06:48,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-05-21 21:06:48,695 INFO L87 Difference]: Start difference. First operand 4206 states and 19008 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 21:06:48,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:06:48,763 INFO L93 Difference]: Finished difference Result 5618 states and 25299 transitions. [2021-05-21 21:06:48,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 21:06:48,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2021-05-21 21:06:48,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:06:48,784 INFO L225 Difference]: With dead ends: 5618 [2021-05-21 21:06:48,784 INFO L226 Difference]: Without dead ends: 5418 [2021-05-21 21:06:48,784 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 43.2ms TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-05-21 21:06:48,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5418 states. [2021-05-21 21:06:48,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5418 to 4426. [2021-05-21 21:06:48,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4426 states, 4425 states have (on average 4.55864406779661) internal successors, (20172), 4425 states have internal predecessors, (20172), 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 21:06:48,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4426 states to 4426 states and 20172 transitions. [2021-05-21 21:06:48,931 INFO L78 Accepts]: Start accepts. Automaton has 4426 states and 20172 transitions. Word has length 29 [2021-05-21 21:06:48,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:06:48,931 INFO L482 AbstractCegarLoop]: Abstraction has 4426 states and 20172 transitions. [2021-05-21 21:06:48,931 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 21:06:48,931 INFO L276 IsEmpty]: Start isEmpty. Operand 4426 states and 20172 transitions. [2021-05-21 21:06:48,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-21 21:06:48,940 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:06:48,941 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:06:49,155 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-21 21:06:49,156 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 21:06:49,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:06:49,156 INFO L82 PathProgramCache]: Analyzing trace with hash -614649962, now seen corresponding path program 1 times [2021-05-21 21:06:49,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:06:49,157 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194524179] [2021-05-21 21:06:49,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:06:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:06:49,191 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 21:06:49,191 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:06:49,191 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194524179] [2021-05-21 21:06:49,192 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194524179] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:06:49,192 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:06:49,192 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-21 21:06:49,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634950766] [2021-05-21 21:06:49,192 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-21 21:06:49,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:06:49,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-21 21:06:49,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-21 21:06:49,193 INFO L87 Difference]: Start difference. First operand 4426 states and 20172 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 21:06:49,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:06:49,293 INFO L93 Difference]: Finished difference Result 7946 states and 35321 transitions. [2021-05-21 21:06:49,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 21:06:49,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2021-05-21 21:06:49,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:06:49,320 INFO L225 Difference]: With dead ends: 7946 [2021-05-21 21:06:49,320 INFO L226 Difference]: Without dead ends: 7848 [2021-05-21 21:06:49,320 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-21 21:06:49,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7848 states. [2021-05-21 21:06:49,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7848 to 6434. [2021-05-21 21:06:49,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6434 states, 6433 states have (on average 4.542048810819214) internal successors, (29219), 6433 states have internal predecessors, (29219), 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 21:06:49,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6434 states to 6434 states and 29219 transitions. [2021-05-21 21:06:49,563 INFO L78 Accepts]: Start accepts. Automaton has 6434 states and 29219 transitions. Word has length 29 [2021-05-21 21:06:49,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:06:49,563 INFO L482 AbstractCegarLoop]: Abstraction has 6434 states and 29219 transitions. [2021-05-21 21:06:49,563 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 21:06:49,563 INFO L276 IsEmpty]: Start isEmpty. Operand 6434 states and 29219 transitions. [2021-05-21 21:06:49,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-21 21:06:49,577 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:06:49,577 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:06:49,578 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-21 21:06:49,578 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 21:06:49,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:06:49,579 INFO L82 PathProgramCache]: Analyzing trace with hash -970617380, now seen corresponding path program 1 times [2021-05-21 21:06:49,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:06:49,579 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668764257] [2021-05-21 21:06:49,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:06:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:06:49,616 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 21:06:49,616 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:06:49,616 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668764257] [2021-05-21 21:06:49,616 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668764257] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:06:49,616 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:06:49,616 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-21 21:06:49,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981859521] [2021-05-21 21:06:49,617 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-21 21:06:49,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:06:49,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-21 21:06:49,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-21 21:06:49,617 INFO L87 Difference]: Start difference. First operand 6434 states and 29219 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 21:06:49,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:06:49,712 INFO L93 Difference]: Finished difference Result 11319 states and 50308 transitions. [2021-05-21 21:06:49,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 21:06:49,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2021-05-21 21:06:49,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:06:49,748 INFO L225 Difference]: With dead ends: 11319 [2021-05-21 21:06:49,748 INFO L226 Difference]: Without dead ends: 11198 [2021-05-21 21:06:49,749 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-21 21:06:49,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11198 states. [2021-05-21 21:06:50,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11198 to 8925. [2021-05-21 21:06:50,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8925 states, 8924 states have (on average 4.6001792917974) internal successors, (41052), 8924 states have internal predecessors, (41052), 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 21:06:50,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8925 states to 8925 states and 41052 transitions. [2021-05-21 21:06:50,051 INFO L78 Accepts]: Start accepts. Automaton has 8925 states and 41052 transitions. Word has length 29 [2021-05-21 21:06:50,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:06:50,051 INFO L482 AbstractCegarLoop]: Abstraction has 8925 states and 41052 transitions. [2021-05-21 21:06:50,051 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 21:06:50,052 INFO L276 IsEmpty]: Start isEmpty. Operand 8925 states and 41052 transitions. [2021-05-21 21:06:50,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-21 21:06:50,071 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:06:50,071 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:06:50,071 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-21 21:06:50,071 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 21:06:50,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:06:50,071 INFO L82 PathProgramCache]: Analyzing trace with hash -643441376, now seen corresponding path program 2 times [2021-05-21 21:06:50,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:06:50,072 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632485296] [2021-05-21 21:06:50,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:06:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:06:50,116 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 21:06:50,117 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:06:50,117 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632485296] [2021-05-21 21:06:50,117 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632485296] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-21 21:06:50,117 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147067321] [2021-05-21 21:06:50,117 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 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 21:06:50,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-21 21:06:50,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-21 21:06:50,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2021-05-21 21:06:50,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-21 21:06:50,300 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 21:06:50,301 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147067321] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-21 21:06:50,301 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-21 21:06:50,301 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 8 [2021-05-21 21:06:50,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756114484] [2021-05-21 21:06:50,302 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-21 21:06:50,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:06:50,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-21 21:06:50,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-05-21 21:06:50,304 INFO L87 Difference]: Start difference. First operand 8925 states and 41052 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 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 21:06:51,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:06:51,013 INFO L93 Difference]: Finished difference Result 31957 states and 138250 transitions. [2021-05-21 21:06:51,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-21 21:06:51,014 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 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 29 [2021-05-21 21:06:51,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:06:51,102 INFO L225 Difference]: With dead ends: 31957 [2021-05-21 21:06:51,103 INFO L226 Difference]: Without dead ends: 25190 [2021-05-21 21:06:51,103 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 223.0ms TimeCoverageRelationStatistics Valid=191, Invalid=679, Unknown=0, NotChecked=0, Total=870 [2021-05-21 21:06:51,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25190 states. [2021-05-21 21:06:51,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25190 to 11186. [2021-05-21 21:06:51,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11186 states, 11185 states have (on average 4.569959767545821) internal successors, (51115), 11185 states have internal predecessors, (51115), 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 21:06:51,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11186 states to 11186 states and 51115 transitions. [2021-05-21 21:06:51,590 INFO L78 Accepts]: Start accepts. Automaton has 11186 states and 51115 transitions. Word has length 29 [2021-05-21 21:06:51,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:06:51,591 INFO L482 AbstractCegarLoop]: Abstraction has 11186 states and 51115 transitions. [2021-05-21 21:06:51,591 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 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 21:06:51,591 INFO L276 IsEmpty]: Start isEmpty. Operand 11186 states and 51115 transitions. [2021-05-21 21:06:51,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-21 21:06:51,614 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:06:51,614 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:06:51,830 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-21 21:06:51,830 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 21:06:51,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:06:51,831 INFO L82 PathProgramCache]: Analyzing trace with hash 896103960, now seen corresponding path program 2 times [2021-05-21 21:06:51,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:06:51,831 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225098890] [2021-05-21 21:06:51,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:06:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:06:51,859 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 21:06:51,859 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:06:51,859 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225098890] [2021-05-21 21:06:51,859 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225098890] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:06:51,859 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:06:51,859 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-21 21:06:51,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390225930] [2021-05-21 21:06:51,859 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-21 21:06:51,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:06:51,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-21 21:06:51,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-21 21:06:51,860 INFO L87 Difference]: Start difference. First operand 11186 states and 51115 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 21:06:51,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:06:51,972 INFO L93 Difference]: Finished difference Result 13521 states and 60589 transitions. [2021-05-21 21:06:51,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 21:06:51,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2021-05-21 21:06:51,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:06:52,014 INFO L225 Difference]: With dead ends: 13521 [2021-05-21 21:06:52,014 INFO L226 Difference]: Without dead ends: 13281 [2021-05-21 21:06:52,014 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-21 21:06:52,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13281 states. [2021-05-21 21:06:52,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13281 to 11164. [2021-05-21 21:06:52,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11164 states, 11163 states have (on average 4.55361461972588) internal successors, (50832), 11163 states have internal predecessors, (50832), 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 21:06:52,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11164 states to 11164 states and 50832 transitions. [2021-05-21 21:06:52,369 INFO L78 Accepts]: Start accepts. Automaton has 11164 states and 50832 transitions. Word has length 29 [2021-05-21 21:06:52,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:06:52,369 INFO L482 AbstractCegarLoop]: Abstraction has 11164 states and 50832 transitions. [2021-05-21 21:06:52,369 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 21:06:52,369 INFO L276 IsEmpty]: Start isEmpty. Operand 11164 states and 50832 transitions. [2021-05-21 21:06:52,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-21 21:06:52,391 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:06:52,391 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:06:52,391 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-21 21:06:52,391 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 21:06:52,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:06:52,392 INFO L82 PathProgramCache]: Analyzing trace with hash 644421402, now seen corresponding path program 2 times [2021-05-21 21:06:52,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:06:52,392 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132850240] [2021-05-21 21:06:52,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:06:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:06:52,417 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 21:06:52,417 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:06:52,417 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132850240] [2021-05-21 21:06:52,417 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132850240] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:06:52,417 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:06:52,417 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-21 21:06:52,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120603362] [2021-05-21 21:06:52,417 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-21 21:06:52,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:06:52,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-21 21:06:52,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-05-21 21:06:52,418 INFO L87 Difference]: Start difference. First operand 11164 states and 50832 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 21:06:52,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:06:52,490 INFO L93 Difference]: Finished difference Result 12568 states and 55860 transitions. [2021-05-21 21:06:52,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-21 21:06:52,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2021-05-21 21:06:52,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:06:52,522 INFO L225 Difference]: With dead ends: 12568 [2021-05-21 21:06:52,522 INFO L226 Difference]: Without dead ends: 12568 [2021-05-21 21:06:52,522 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-05-21 21:06:52,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12568 states. [2021-05-21 21:06:52,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12568 to 10980. [2021-05-21 21:06:52,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10980 states, 10979 states have (on average 4.559340559249477) internal successors, (50057), 10979 states have internal predecessors, (50057), 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 21:06:52,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10980 states to 10980 states and 50057 transitions. [2021-05-21 21:06:52,848 INFO L78 Accepts]: Start accepts. Automaton has 10980 states and 50057 transitions. Word has length 29 [2021-05-21 21:06:52,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:06:52,849 INFO L482 AbstractCegarLoop]: Abstraction has 10980 states and 50057 transitions. [2021-05-21 21:06:52,849 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 21:06:52,849 INFO L276 IsEmpty]: Start isEmpty. Operand 10980 states and 50057 transitions. [2021-05-21 21:06:52,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-21 21:06:52,870 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:06:52,870 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:06:52,871 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-21 21:06:52,871 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 21:06:52,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:06:52,871 INFO L82 PathProgramCache]: Analyzing trace with hash -759097254, now seen corresponding path program 3 times [2021-05-21 21:06:52,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:06:52,871 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402046139] [2021-05-21 21:06:52,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:06:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:06:52,888 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 21:06:52,888 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:06:52,888 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402046139] [2021-05-21 21:06:52,888 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402046139] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:06:52,888 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:06:52,888 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-21 21:06:52,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860672331] [2021-05-21 21:06:52,888 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-21 21:06:52,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:06:52,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-21 21:06:52,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-05-21 21:06:52,889 INFO L87 Difference]: Start difference. First operand 10980 states and 50057 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 21:06:52,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:06:52,967 INFO L93 Difference]: Finished difference Result 13957 states and 62115 transitions. [2021-05-21 21:06:52,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-21 21:06:52,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2021-05-21 21:06:52,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:06:53,003 INFO L225 Difference]: With dead ends: 13957 [2021-05-21 21:06:53,003 INFO L226 Difference]: Without dead ends: 13957 [2021-05-21 21:06:53,004 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-05-21 21:06:53,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13957 states. [2021-05-21 21:06:53,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13957 to 11348. [2021-05-21 21:06:53,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11348 states, 11347 states have (on average 4.560324314796863) internal successors, (51746), 11347 states have internal predecessors, (51746), 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 21:06:53,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11348 states to 11348 states and 51746 transitions. [2021-05-21 21:06:53,396 INFO L78 Accepts]: Start accepts. Automaton has 11348 states and 51746 transitions. Word has length 29 [2021-05-21 21:06:53,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:06:53,396 INFO L482 AbstractCegarLoop]: Abstraction has 11348 states and 51746 transitions. [2021-05-21 21:06:53,396 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 21:06:53,397 INFO L276 IsEmpty]: Start isEmpty. Operand 11348 states and 51746 transitions. [2021-05-21 21:06:53,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-21 21:06:53,421 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:06:53,421 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:06:53,421 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-21 21:06:53,421 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 21:06:53,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:06:53,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1350465982, now seen corresponding path program 4 times [2021-05-21 21:06:53,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:06:53,421 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116670820] [2021-05-21 21:06:53,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:06:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:06:53,450 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 21:06:53,451 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:06:53,451 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116670820] [2021-05-21 21:06:53,451 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116670820] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:06:53,451 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:06:53,451 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-21 21:06:53,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937150297] [2021-05-21 21:06:53,451 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 21:06:53,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:06:53,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 21:06:53,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-21 21:06:53,452 INFO L87 Difference]: Start difference. First operand 11348 states and 51746 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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 21:06:53,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:06:53,570 INFO L93 Difference]: Finished difference Result 15992 states and 69373 transitions. [2021-05-21 21:06:53,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 21:06:53,570 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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 29 [2021-05-21 21:06:53,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:06:53,616 INFO L225 Difference]: With dead ends: 15992 [2021-05-21 21:06:53,617 INFO L226 Difference]: Without dead ends: 15751 [2021-05-21 21:06:53,617 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 8.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-21 21:06:53,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15751 states. [2021-05-21 21:06:53,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15751 to 11284. [2021-05-21 21:06:53,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11284 states, 11283 states have (on average 4.5284055658955955) internal successors, (51094), 11283 states have internal predecessors, (51094), 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 21:06:53,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11284 states to 11284 states and 51094 transitions. [2021-05-21 21:06:53,939 INFO L78 Accepts]: Start accepts. Automaton has 11284 states and 51094 transitions. Word has length 29 [2021-05-21 21:06:53,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:06:53,939 INFO L482 AbstractCegarLoop]: Abstraction has 11284 states and 51094 transitions. [2021-05-21 21:06:53,939 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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 21:06:53,939 INFO L276 IsEmpty]: Start isEmpty. Operand 11284 states and 51094 transitions. [2021-05-21 21:06:54,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-21 21:06:54,108 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:06:54,108 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:06:54,108 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-21 21:06:54,108 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 21:06:54,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:06:54,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1688009984, now seen corresponding path program 2 times [2021-05-21 21:06:54,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:06:54,109 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044922007] [2021-05-21 21:06:54,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:06:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:06:54,173 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 21:06:54,173 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:06:54,173 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044922007] [2021-05-21 21:06:54,173 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044922007] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-21 21:06:54,173 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337460147] [2021-05-21 21:06:54,173 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 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 21:06:54,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-21 21:06:54,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-21 21:06:54,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2021-05-21 21:06:54,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-21 21:06:54,275 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 21:06:54,275 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337460147] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-21 21:06:54,275 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-21 21:06:54,275 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 8 [2021-05-21 21:06:54,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630108994] [2021-05-21 21:06:54,275 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-21 21:06:54,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:06:54,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-21 21:06:54,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-05-21 21:06:54,276 INFO L87 Difference]: Start difference. First operand 11284 states and 51094 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 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 21:06:55,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:06:55,102 INFO L93 Difference]: Finished difference Result 34532 states and 153051 transitions. [2021-05-21 21:06:55,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-05-21 21:06:55,102 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 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 29 [2021-05-21 21:06:55,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:06:55,142 INFO L225 Difference]: With dead ends: 34532 [2021-05-21 21:06:55,142 INFO L226 Difference]: Without dead ends: 15158 [2021-05-21 21:06:55,143 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 346.3ms TimeCoverageRelationStatistics Valid=442, Invalid=1364, Unknown=0, NotChecked=0, Total=1806 [2021-05-21 21:06:55,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15158 states. [2021-05-21 21:06:55,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15158 to 6407. [2021-05-21 21:06:55,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6407 states, 6406 states have (on average 4.431002185451139) internal successors, (28385), 6406 states have internal predecessors, (28385), 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 21:06:55,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6407 states to 6407 states and 28385 transitions. [2021-05-21 21:06:55,461 INFO L78 Accepts]: Start accepts. Automaton has 6407 states and 28385 transitions. Word has length 29 [2021-05-21 21:06:55,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:06:55,461 INFO L482 AbstractCegarLoop]: Abstraction has 6407 states and 28385 transitions. [2021-05-21 21:06:55,461 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 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 21:06:55,461 INFO L276 IsEmpty]: Start isEmpty. Operand 6407 states and 28385 transitions. [2021-05-21 21:06:55,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-21 21:06:55,474 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:06:55,474 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:06:55,688 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-21 21:06:55,689 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 21:06:55,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:06:55,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1375793184, now seen corresponding path program 3 times [2021-05-21 21:06:55,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:06:55,690 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603151876] [2021-05-21 21:06:55,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:06:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:06:55,705 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 21:06:55,705 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:06:55,705 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603151876] [2021-05-21 21:06:55,705 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603151876] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:06:55,705 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:06:55,705 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-21 21:06:55,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807467064] [2021-05-21 21:06:55,706 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-21 21:06:55,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:06:55,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-21 21:06:55,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-21 21:06:55,707 INFO L87 Difference]: Start difference. First operand 6407 states and 28385 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 21:06:55,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:06:55,762 INFO L93 Difference]: Finished difference Result 6967 states and 30444 transitions. [2021-05-21 21:06:55,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 21:06:55,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2021-05-21 21:06:55,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:06:55,779 INFO L225 Difference]: With dead ends: 6967 [2021-05-21 21:06:55,779 INFO L226 Difference]: Without dead ends: 6541 [2021-05-21 21:06:55,779 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-21 21:06:55,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6541 states. [2021-05-21 21:06:55,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6541 to 5575. [2021-05-21 21:06:55,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5575 states, 5574 states have (on average 4.463939720129171) internal successors, (24882), 5574 states have internal predecessors, (24882), 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 21:06:55,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5575 states to 5575 states and 24882 transitions. [2021-05-21 21:06:55,883 INFO L78 Accepts]: Start accepts. Automaton has 5575 states and 24882 transitions. Word has length 29 [2021-05-21 21:06:55,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:06:55,884 INFO L482 AbstractCegarLoop]: Abstraction has 5575 states and 24882 transitions. [2021-05-21 21:06:55,884 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 21:06:55,884 INFO L276 IsEmpty]: Start isEmpty. Operand 5575 states and 24882 transitions. [2021-05-21 21:06:55,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-21 21:06:55,894 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:06:55,894 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:06:55,894 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-21 21:06:55,894 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 21:06:55,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:06:55,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1588380738, now seen corresponding path program 5 times [2021-05-21 21:06:55,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:06:55,894 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140188613] [2021-05-21 21:06:55,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:06:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:06:55,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 21:06:55,915 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:06:55,915 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140188613] [2021-05-21 21:06:55,915 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140188613] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:06:55,915 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:06:55,915 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-21 21:06:55,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141831709] [2021-05-21 21:06:55,915 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 21:06:55,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:06:55,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 21:06:55,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-05-21 21:06:55,915 INFO L87 Difference]: Start difference. First operand 5575 states and 24882 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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 21:06:55,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:06:55,979 INFO L93 Difference]: Finished difference Result 5778 states and 25550 transitions. [2021-05-21 21:06:55,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 21:06:55,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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 29 [2021-05-21 21:06:55,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:06:55,992 INFO L225 Difference]: With dead ends: 5778 [2021-05-21 21:06:55,992 INFO L226 Difference]: Without dead ends: 5413 [2021-05-21 21:06:55,992 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-05-21 21:06:56,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5413 states. [2021-05-21 21:06:56,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5413 to 5186. [2021-05-21 21:06:56,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5186 states, 5185 states have (on average 4.515911282545805) internal successors, (23415), 5185 states have internal predecessors, (23415), 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 21:06:56,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5186 states to 5186 states and 23415 transitions. [2021-05-21 21:06:56,084 INFO L78 Accepts]: Start accepts. Automaton has 5186 states and 23415 transitions. Word has length 29 [2021-05-21 21:06:56,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:06:56,084 INFO L482 AbstractCegarLoop]: Abstraction has 5186 states and 23415 transitions. [2021-05-21 21:06:56,084 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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 21:06:56,084 INFO L276 IsEmpty]: Start isEmpty. Operand 5186 states and 23415 transitions. [2021-05-21 21:06:56,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-05-21 21:06:56,094 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:06:56,094 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:06:56,094 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-21 21:06:56,094 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 21:06:56,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:06:56,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1089947996, now seen corresponding path program 1 times [2021-05-21 21:06:56,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:06:56,094 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933121810] [2021-05-21 21:06:56,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:06:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:06:56,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:06:56,201 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:06:56,201 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933121810] [2021-05-21 21:06:56,201 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933121810] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-21 21:06:56,201 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126297033] [2021-05-21 21:06:56,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-21 21:06:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:06:56,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2021-05-21 21:06:56,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-21 21:06:56,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-05-21 21:06:56,353 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126297033] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-21 21:06:56,354 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-21 21:06:56,354 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 3] total 10 [2021-05-21 21:06:56,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317341288] [2021-05-21 21:06:56,354 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-21 21:06:56,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:06:56,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-21 21:06:56,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-05-21 21:06:56,354 INFO L87 Difference]: Start difference. First operand 5186 states and 23415 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 states have internal predecessors, (65), 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 21:06:57,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:06:57,141 INFO L93 Difference]: Finished difference Result 18525 states and 84293 transitions. [2021-05-21 21:06:57,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-05-21 21:06:57,141 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 states have internal predecessors, (65), 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 33 [2021-05-21 21:06:57,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:06:57,171 INFO L225 Difference]: With dead ends: 18525 [2021-05-21 21:06:57,171 INFO L226 Difference]: Without dead ends: 11569 [2021-05-21 21:06:57,171 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 390.3ms TimeCoverageRelationStatistics Valid=314, Invalid=1326, Unknown=0, NotChecked=0, Total=1640 [2021-05-21 21:06:57,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11569 states. [2021-05-21 21:06:57,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11569 to 6899. [2021-05-21 21:06:57,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6899 states, 6898 states have (on average 4.447521020585677) internal successors, (30679), 6898 states have internal predecessors, (30679), 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 21:06:57,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6899 states to 6899 states and 30679 transitions. [2021-05-21 21:06:57,342 INFO L78 Accepts]: Start accepts. Automaton has 6899 states and 30679 transitions. Word has length 33 [2021-05-21 21:06:57,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:06:57,342 INFO L482 AbstractCegarLoop]: Abstraction has 6899 states and 30679 transitions. [2021-05-21 21:06:57,342 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 states have internal predecessors, (65), 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 21:06:57,342 INFO L276 IsEmpty]: Start isEmpty. Operand 6899 states and 30679 transitions. [2021-05-21 21:06:57,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-05-21 21:06:57,355 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:06:57,355 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:06:57,555 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-05-21 21:06:57,555 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 21:06:57,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:06:57,556 INFO L82 PathProgramCache]: Analyzing trace with hash 2087262130, now seen corresponding path program 1 times [2021-05-21 21:06:57,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:06:57,556 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982565013] [2021-05-21 21:06:57,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:06:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:06:57,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-05-21 21:06:57,605 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:06:57,605 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982565013] [2021-05-21 21:06:57,605 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982565013] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-21 21:06:57,605 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922387688] [2021-05-21 21:06:57,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-21 21:06:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:06:57,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 9 conjunts are in the unsatisfiable core [2021-05-21 21:06:57,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-21 21:06:57,715 WARN L348 FreeRefinementEngine]: Global settings require throwing the following exception [2021-05-21 21:06:57,928 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-05-21 21:06:57,931 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 21:06:57,934 INFO L168 Benchmark]: Toolchain (without parser) took 12766.28 ms. Allocated memory was 364.9 MB in the beginning and 8.9 GB in the end (delta: 8.5 GB). Free memory was 344.1 MB in the beginning and 7.9 GB in the end (delta: -7.5 GB). Peak memory consumption was 970.9 MB. Max. memory is 16.0 GB. [2021-05-21 21:06:57,934 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.13 ms. Allocated memory is still 364.9 MB. Free memory was 345.3 MB in the beginning and 345.2 MB in the end (delta: 76.6 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-05-21 21:06:57,934 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.86 ms. Allocated memory is still 364.9 MB. Free memory was 344.0 MB in the beginning and 342.5 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-05-21 21:06:57,934 INFO L168 Benchmark]: Boogie Preprocessor took 11.55 ms. Allocated memory is still 364.9 MB. Free memory was 342.5 MB in the beginning and 341.5 MB in the end (delta: 994.7 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-05-21 21:06:57,934 INFO L168 Benchmark]: RCFGBuilder took 295.67 ms. Allocated memory is still 364.9 MB. Free memory was 341.4 MB in the beginning and 326.4 MB in the end (delta: 15.0 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-05-21 21:06:57,934 INFO L168 Benchmark]: TraceAbstraction took 12437.66 ms. Allocated memory was 364.9 MB in the beginning and 8.9 GB in the end (delta: 8.5 GB). Free memory was 326.0 MB in the beginning and 7.9 GB in the end (delta: -7.6 GB). Peak memory consumption was 954.1 MB. Max. memory is 16.0 GB. [2021-05-21 21:06:57,934 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.13 ms. Allocated memory is still 364.9 MB. Free memory was 345.3 MB in the beginning and 345.2 MB in the end (delta: 76.6 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 17.86 ms. Allocated memory is still 364.9 MB. Free memory was 344.0 MB in the beginning and 342.5 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Preprocessor took 11.55 ms. Allocated memory is still 364.9 MB. Free memory was 342.5 MB in the beginning and 341.5 MB in the end (delta: 994.7 kB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 295.67 ms. Allocated memory is still 364.9 MB. Free memory was 341.4 MB in the beginning and 326.4 MB in the end (delta: 15.0 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * TraceAbstraction took 12437.66 ms. Allocated memory was 364.9 MB in the beginning and 8.9 GB in the end (delta: 8.5 GB). Free memory was 326.0 MB in the beginning and 7.9 GB in the end (delta: -7.6 GB). Peak memory consumption was 954.1 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...