/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-dec.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 05:33:13,949 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 05:33:13,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 05:33:13,975 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 05:33:13,975 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 05:33:13,976 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 05:33:13,977 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 05:33:13,979 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 05:33:13,980 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 05:33:13,981 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 05:33:13,981 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 05:33:13,982 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 05:33:13,983 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 05:33:13,983 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 05:33:13,984 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 05:33:13,985 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 05:33:13,986 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 05:33:13,986 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 05:33:13,988 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 05:33:13,989 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 05:33:13,991 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 05:33:13,992 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 05:33:13,993 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 05:33:13,993 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 05:33:13,996 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 05:33:13,996 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 05:33:13,996 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 05:33:13,997 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 05:33:13,997 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 05:33:13,998 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 05:33:13,998 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 05:33:14,005 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 05:33:14,006 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 05:33:14,006 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 05:33:14,007 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 05:33:14,007 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 05:33:14,008 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 05:33:14,008 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 05:33:14,008 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 05:33:14,009 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 05:33:14,009 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 05:33:14,013 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-06-05 05:33:14,048 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 05:33:14,048 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 05:33:14,049 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 05:33:14,049 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 05:33:14,051 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 05:33:14,051 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 05:33:14,052 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 05:33:14,052 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 05:33:14,052 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 05:33:14,052 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 05:33:14,053 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 05:33:14,053 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 05:33:14,053 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 05:33:14,053 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 05:33:14,053 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 05:33:14,053 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 05:33:14,053 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 05:33:14,054 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 05:33:14,054 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 05:33:14,054 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 05:33:14,054 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 05:33:14,054 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 05:33:14,054 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 05:33:14,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 05:33:14,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 05:33:14,055 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 05:33:14,055 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 05:33:14,055 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 05:33:14,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 05:33:14,055 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 05:33:14,055 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 05:33:14,055 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-06-05 05:33:14,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 05:33:14,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 05:33:14,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 05:33:14,368 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-05 05:33:14,369 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-05 05:33:14,370 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-dec.wvr.bpl [2021-06-05 05:33:14,370 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/min-max-dec.wvr.bpl' [2021-06-05 05:33:14,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 05:33:14,413 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-05 05:33:14,415 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 05:33:14,415 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 05:33:14,415 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 05:33:14,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 05:33:14" (1/1) ... [2021-06-05 05:33:14,433 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 05:33:14" (1/1) ... [2021-06-05 05:33:14,439 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 05:33:14,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 05:33:14,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 05:33:14,441 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 05:33:14,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 05:33:14" (1/1) ... [2021-06-05 05:33:14,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 05:33:14" (1/1) ... [2021-06-05 05:33:14,447 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 05:33:14" (1/1) ... [2021-06-05 05:33:14,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 05:33:14" (1/1) ... [2021-06-05 05:33:14,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 05:33:14" (1/1) ... [2021-06-05 05:33:14,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 05:33:14" (1/1) ... [2021-06-05 05:33:14,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 05:33:14" (1/1) ... [2021-06-05 05:33:14,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 05:33:14,454 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 05:33:14,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 05:33:14,454 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 05:33:14,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 05:33:14" (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-06-05 05:33:14,515 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-06-05 05:33:14,515 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-06-05 05:33:14,516 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-06-05 05:33:14,516 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-06-05 05:33:14,516 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-06-05 05:33:14,516 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-06-05 05:33:14,516 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-05 05:33:14,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 05:33:14,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 05:33:14,517 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-06-05 05:33:14,517 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-06-05 05:33:14,517 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-06-05 05:33:14,517 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2021-06-05 05:33:14,517 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-06-05 05:33:14,517 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-06-05 05:33:14,518 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 05:33:14,784 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 05:33:14,785 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-06-05 05:33:14,786 INFO L202 PluginConnector]: Adding new model min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 05:33:14 BoogieIcfgContainer [2021-06-05 05:33:14,786 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 05:33:14,788 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 05:33:14,788 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 05:33:14,790 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 05:33:14,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 05:33:14" (1/2) ... [2021-06-05 05:33:14,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@412d933 and model type min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 05:33:14, skipping insertion in model container [2021-06-05 05:33:14,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 05:33:14" (2/2) ... [2021-06-05 05:33:14,792 INFO L111 eAbstractionObserver]: Analyzing ICFG min-max-dec.wvr.bpl [2021-06-05 05:33:14,817 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 05:33:14,818 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 05:33:14,818 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-05 05:33:14,819 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 05:33:14,924 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-06-05 05:33:14,960 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-05 05:33:14,981 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 05:33:14,981 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 05:33:14,981 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 05:33:14,981 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 05:33:14,981 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 05:33:14,981 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 05:33:14,981 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 05:33:14,981 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 05:33:14,991 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 35 transitions, 102 flow [2021-06-05 05:33:15,054 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 712 states, 710 states have (on average 3.6450704225352113) internal successors, (2588), 711 states have internal predecessors, (2588), 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-06-05 05:33:15,057 INFO L276 IsEmpty]: Start isEmpty. Operand has 712 states, 710 states have (on average 3.6450704225352113) internal successors, (2588), 711 states have internal predecessors, (2588), 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-06-05 05:33:15,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-06-05 05:33:15,080 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:33:15,081 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] [2021-06-05 05:33:15,081 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:33:15,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:33:15,087 INFO L82 PathProgramCache]: Analyzing trace with hash -353370600, now seen corresponding path program 1 times [2021-06-05 05:33:15,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:33:15,094 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336863205] [2021-06-05 05:33:15,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:33:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:15,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 05:33:15,237 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:33:15,238 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336863205] [2021-06-05 05:33:15,238 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336863205] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 05:33:15,238 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 05:33:15,239 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 05:33:15,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811963717] [2021-06-05 05:33:15,243 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 05:33:15,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:33:15,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 05:33:15,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 05:33:15,261 INFO L87 Difference]: Start difference. First operand has 712 states, 710 states have (on average 3.6450704225352113) internal successors, (2588), 711 states have internal predecessors, (2588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-06-05 05:33:15,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:33:15,344 INFO L93 Difference]: Finished difference Result 961 states and 3450 transitions. [2021-06-05 05:33:15,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 05:33:15,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2021-06-05 05:33:15,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:33:15,370 INFO L225 Difference]: With dead ends: 961 [2021-06-05 05:33:15,370 INFO L226 Difference]: Without dead ends: 614 [2021-06-05 05:33:15,371 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 05:33:15,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2021-06-05 05:33:15,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2021-06-05 05:33:15,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 613 states have (on average 3.592169657422512) internal successors, (2202), 613 states have internal predecessors, (2202), 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-06-05 05:33:15,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 2202 transitions. [2021-06-05 05:33:15,474 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 2202 transitions. Word has length 23 [2021-06-05 05:33:15,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:33:15,475 INFO L482 AbstractCegarLoop]: Abstraction has 614 states and 2202 transitions. [2021-06-05 05:33:15,476 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-06-05 05:33:15,476 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 2202 transitions. [2021-06-05 05:33:15,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-06-05 05:33:15,479 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:33:15,479 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] [2021-06-05 05:33:15,479 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 05:33:15,480 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:33:15,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:33:15,481 INFO L82 PathProgramCache]: Analyzing trace with hash 860248502, now seen corresponding path program 2 times [2021-06-05 05:33:15,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:33:15,481 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011397958] [2021-06-05 05:33:15,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:33:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:15,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 05:33:15,534 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:33:15,535 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011397958] [2021-06-05 05:33:15,535 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011397958] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 05:33:15,535 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 05:33:15,535 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 05:33:15,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724434103] [2021-06-05 05:33:15,537 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 05:33:15,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:33:15,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 05:33:15,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 05:33:15,538 INFO L87 Difference]: Start difference. First operand 614 states and 2202 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-06-05 05:33:15,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:33:15,688 INFO L93 Difference]: Finished difference Result 2435 states and 8733 transitions. [2021-06-05 05:33:15,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 05:33:15,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 23 [2021-06-05 05:33:15,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:33:15,700 INFO L225 Difference]: With dead ends: 2435 [2021-06-05 05:33:15,701 INFO L226 Difference]: Without dead ends: 1497 [2021-06-05 05:33:15,701 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 48.5ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-06-05 05:33:15,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2021-06-05 05:33:15,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 859. [2021-06-05 05:33:15,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 858 states have (on average 3.5442890442890445) internal successors, (3041), 858 states have internal predecessors, (3041), 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-06-05 05:33:15,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 3041 transitions. [2021-06-05 05:33:15,762 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 3041 transitions. Word has length 23 [2021-06-05 05:33:15,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:33:15,762 INFO L482 AbstractCegarLoop]: Abstraction has 859 states and 3041 transitions. [2021-06-05 05:33:15,763 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-06-05 05:33:15,763 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 3041 transitions. [2021-06-05 05:33:15,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-06-05 05:33:15,766 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:33:15,766 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] [2021-06-05 05:33:15,767 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 05:33:15,767 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:33:15,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:33:15,768 INFO L82 PathProgramCache]: Analyzing trace with hash 2060589364, now seen corresponding path program 3 times [2021-06-05 05:33:15,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:33:15,768 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61496101] [2021-06-05 05:33:15,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:33:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:15,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 05:33:15,842 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:33:15,842 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61496101] [2021-06-05 05:33:15,843 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61496101] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 05:33:15,843 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 05:33:15,843 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 05:33:15,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826763625] [2021-06-05 05:33:15,844 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 05:33:15,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:33:15,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 05:33:15,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 05:33:15,847 INFO L87 Difference]: Start difference. First operand 859 states and 3041 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-06-05 05:33:15,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:33:15,953 INFO L93 Difference]: Finished difference Result 3289 states and 11673 transitions. [2021-06-05 05:33:15,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 05:33:15,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 23 [2021-06-05 05:33:15,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:33:15,974 INFO L225 Difference]: With dead ends: 3289 [2021-06-05 05:33:15,974 INFO L226 Difference]: Without dead ends: 2391 [2021-06-05 05:33:15,979 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 35.3ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-06-05 05:33:15,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2021-06-05 05:33:16,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 910. [2021-06-05 05:33:16,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 909 states have (on average 3.553355335533553) internal successors, (3230), 909 states have internal predecessors, (3230), 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-06-05 05:33:16,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 3230 transitions. [2021-06-05 05:33:16,022 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 3230 transitions. Word has length 23 [2021-06-05 05:33:16,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:33:16,023 INFO L482 AbstractCegarLoop]: Abstraction has 910 states and 3230 transitions. [2021-06-05 05:33:16,023 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-06-05 05:33:16,023 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 3230 transitions. [2021-06-05 05:33:16,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-06-05 05:33:16,026 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:33:16,026 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] [2021-06-05 05:33:16,026 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 05:33:16,026 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:33:16,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:33:16,027 INFO L82 PathProgramCache]: Analyzing trace with hash -375854000, now seen corresponding path program 4 times [2021-06-05 05:33:16,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:33:16,027 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566260269] [2021-06-05 05:33:16,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:33:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:16,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 05:33:16,064 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:33:16,064 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566260269] [2021-06-05 05:33:16,064 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566260269] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 05:33:16,065 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 05:33:16,065 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 05:33:16,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192059309] [2021-06-05 05:33:16,066 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 05:33:16,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:33:16,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 05:33:16,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 05:33:16,067 INFO L87 Difference]: Start difference. First operand 910 states and 3230 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-06-05 05:33:16,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:33:16,093 INFO L93 Difference]: Finished difference Result 1081 states and 3814 transitions. [2021-06-05 05:33:16,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 05:33:16,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2021-06-05 05:33:16,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:33:16,099 INFO L225 Difference]: With dead ends: 1081 [2021-06-05 05:33:16,100 INFO L226 Difference]: Without dead ends: 830 [2021-06-05 05:33:16,100 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 05:33:16,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2021-06-05 05:33:16,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 830. [2021-06-05 05:33:16,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 829 states have (on average 3.4861278648974667) internal successors, (2890), 829 states have internal predecessors, (2890), 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-06-05 05:33:16,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 2890 transitions. [2021-06-05 05:33:16,130 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 2890 transitions. Word has length 23 [2021-06-05 05:33:16,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:33:16,131 INFO L482 AbstractCegarLoop]: Abstraction has 830 states and 2890 transitions. [2021-06-05 05:33:16,131 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-06-05 05:33:16,131 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 2890 transitions. [2021-06-05 05:33:16,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-06-05 05:33:16,134 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:33:16,134 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] [2021-06-05 05:33:16,134 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 05:33:16,134 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:33:16,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:33:16,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1603494326, now seen corresponding path program 1 times [2021-06-05 05:33:16,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:33:16,137 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754313154] [2021-06-05 05:33:16,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:33:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:16,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 05:33:16,257 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:33:16,257 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754313154] [2021-06-05 05:33:16,257 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754313154] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:16,257 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19050144] [2021-06-05 05:33:16,257 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-06-05 05:33:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:16,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 05:33:16,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 05:33:16,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 05:33:16,444 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19050144] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:16,444 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 05:33:16,444 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 5 [2021-06-05 05:33:16,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87247558] [2021-06-05 05:33:16,445 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 05:33:16,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:33:16,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 05:33:16,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-06-05 05:33:16,446 INFO L87 Difference]: Start difference. First operand 830 states and 2890 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 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-06-05 05:33:16,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:33:16,509 INFO L93 Difference]: Finished difference Result 1914 states and 6600 transitions. [2021-06-05 05:33:16,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 05:33:16,509 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 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 25 [2021-06-05 05:33:16,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:33:16,520 INFO L225 Difference]: With dead ends: 1914 [2021-06-05 05:33:16,520 INFO L226 Difference]: Without dead ends: 1914 [2021-06-05 05:33:16,520 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 25.4ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-05 05:33:16,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2021-06-05 05:33:16,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1087. [2021-06-05 05:33:16,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 1086 states have (on average 3.603130755064457) internal successors, (3913), 1086 states have internal predecessors, (3913), 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-06-05 05:33:16,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 3913 transitions. [2021-06-05 05:33:16,568 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 3913 transitions. Word has length 25 [2021-06-05 05:33:16,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:33:16,568 INFO L482 AbstractCegarLoop]: Abstraction has 1087 states and 3913 transitions. [2021-06-05 05:33:16,568 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 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-06-05 05:33:16,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 3913 transitions. [2021-06-05 05:33:16,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-06-05 05:33:16,573 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:33:16,573 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] [2021-06-05 05:33:16,796 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 05:33:16,796 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:33:16,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:33:16,797 INFO L82 PathProgramCache]: Analyzing trace with hash 808417752, now seen corresponding path program 1 times [2021-06-05 05:33:16,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:33:16,797 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222510303] [2021-06-05 05:33:16,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:33:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:16,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 05:33:16,840 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:33:16,840 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222510303] [2021-06-05 05:33:16,840 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222510303] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 05:33:16,840 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 05:33:16,840 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 05:33:16,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522949177] [2021-06-05 05:33:16,840 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 05:33:16,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:33:16,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 05:33:16,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 05:33:16,841 INFO L87 Difference]: Start difference. First operand 1087 states and 3913 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-06-05 05:33:16,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:33:16,891 INFO L93 Difference]: Finished difference Result 1486 states and 5095 transitions. [2021-06-05 05:33:16,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 05:33:16,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2021-06-05 05:33:16,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:33:16,900 INFO L225 Difference]: With dead ends: 1486 [2021-06-05 05:33:16,900 INFO L226 Difference]: Without dead ends: 1456 [2021-06-05 05:33:16,902 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 05:33:16,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2021-06-05 05:33:16,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1266. [2021-06-05 05:33:16,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 3.5177865612648223) internal successors, (4450), 1265 states have internal predecessors, (4450), 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-06-05 05:33:16,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 4450 transitions. [2021-06-05 05:33:16,938 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 4450 transitions. Word has length 25 [2021-06-05 05:33:16,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:33:16,938 INFO L482 AbstractCegarLoop]: Abstraction has 1266 states and 4450 transitions. [2021-06-05 05:33:16,938 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-06-05 05:33:16,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 4450 transitions. [2021-06-05 05:33:16,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-06-05 05:33:16,942 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:33:16,942 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] [2021-06-05 05:33:16,942 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 05:33:16,943 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:33:16,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:33:16,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1237283624, now seen corresponding path program 1 times [2021-06-05 05:33:16,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:33:16,943 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846757723] [2021-06-05 05:33:16,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:33:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:17,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 05:33:17,009 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:33:17,009 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846757723] [2021-06-05 05:33:17,009 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846757723] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 05:33:17,010 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 05:33:17,010 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 05:33:17,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676919841] [2021-06-05 05:33:17,011 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 05:33:17,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:33:17,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 05:33:17,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-05 05:33:17,013 INFO L87 Difference]: Start difference. First operand 1266 states and 4450 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-06-05 05:33:17,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:33:17,092 INFO L93 Difference]: Finished difference Result 1470 states and 4972 transitions. [2021-06-05 05:33:17,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 05:33:17,093 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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 25 [2021-06-05 05:33:17,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:33:17,102 INFO L225 Difference]: With dead ends: 1470 [2021-06-05 05:33:17,102 INFO L226 Difference]: Without dead ends: 1307 [2021-06-05 05:33:17,104 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.1ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-06-05 05:33:17,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2021-06-05 05:33:17,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 1247. [2021-06-05 05:33:17,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1247 states, 1246 states have (on average 3.4935794542536116) internal successors, (4353), 1246 states have internal predecessors, (4353), 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-06-05 05:33:17,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 4353 transitions. [2021-06-05 05:33:17,137 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 4353 transitions. Word has length 25 [2021-06-05 05:33:17,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:33:17,138 INFO L482 AbstractCegarLoop]: Abstraction has 1247 states and 4353 transitions. [2021-06-05 05:33:17,138 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-06-05 05:33:17,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 4353 transitions. [2021-06-05 05:33:17,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-06-05 05:33:17,142 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:33:17,142 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] [2021-06-05 05:33:17,142 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 05:33:17,143 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:33:17,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:33:17,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1327684600, now seen corresponding path program 2 times [2021-06-05 05:33:17,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:33:17,143 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302832281] [2021-06-05 05:33:17,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:33:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:17,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 05:33:17,197 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:33:17,197 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302832281] [2021-06-05 05:33:17,197 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302832281] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 05:33:17,197 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 05:33:17,198 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 05:33:17,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629142442] [2021-06-05 05:33:17,198 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 05:33:17,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:33:17,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 05:33:17,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 05:33:17,199 INFO L87 Difference]: Start difference. First operand 1247 states and 4353 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-06-05 05:33:17,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:33:17,240 INFO L93 Difference]: Finished difference Result 1418 states and 4897 transitions. [2021-06-05 05:33:17,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 05:33:17,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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 25 [2021-06-05 05:33:17,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:33:17,249 INFO L225 Difference]: With dead ends: 1418 [2021-06-05 05:33:17,249 INFO L226 Difference]: Without dead ends: 1418 [2021-06-05 05:33:17,249 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 12.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 05:33:17,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2021-06-05 05:33:17,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1232. [2021-06-05 05:33:17,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1232 states, 1231 states have (on average 3.505280259951259) internal successors, (4315), 1231 states have internal predecessors, (4315), 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-06-05 05:33:17,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 4315 transitions. [2021-06-05 05:33:17,283 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 4315 transitions. Word has length 25 [2021-06-05 05:33:17,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:33:17,283 INFO L482 AbstractCegarLoop]: Abstraction has 1232 states and 4315 transitions. [2021-06-05 05:33:17,284 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-06-05 05:33:17,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 4315 transitions. [2021-06-05 05:33:17,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-06-05 05:33:17,287 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:33:17,287 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] [2021-06-05 05:33:17,288 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 05:33:17,288 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:33:17,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:33:17,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1435620298, now seen corresponding path program 2 times [2021-06-05 05:33:17,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:33:17,291 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877175493] [2021-06-05 05:33:17,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:33:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:17,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 05:33:17,339 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:33:17,339 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877175493] [2021-06-05 05:33:17,339 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877175493] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:17,340 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894843823] [2021-06-05 05:33:17,340 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 05:33:17,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 05:33:17,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 05:33:17,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2021-06-05 05:33:17,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 05:33:17,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 05:33:17,463 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894843823] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:17,463 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 05:33:17,463 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 5 [2021-06-05 05:33:17,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175919164] [2021-06-05 05:33:17,464 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 05:33:17,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:33:17,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 05:33:17,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-06-05 05:33:17,468 INFO L87 Difference]: Start difference. First operand 1232 states and 4315 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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-06-05 05:33:17,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:33:17,548 INFO L93 Difference]: Finished difference Result 1482 states and 5191 transitions. [2021-06-05 05:33:17,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 05:33:17,548 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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 25 [2021-06-05 05:33:17,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:33:17,555 INFO L225 Difference]: With dead ends: 1482 [2021-06-05 05:33:17,556 INFO L226 Difference]: Without dead ends: 1380 [2021-06-05 05:33:17,556 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 27.8ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-05 05:33:17,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2021-06-05 05:33:17,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1105. [2021-06-05 05:33:17,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1105 states, 1104 states have (on average 3.5543478260869565) internal successors, (3924), 1104 states have internal predecessors, (3924), 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-06-05 05:33:17,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 3924 transitions. [2021-06-05 05:33:17,613 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 3924 transitions. Word has length 25 [2021-06-05 05:33:17,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:33:17,613 INFO L482 AbstractCegarLoop]: Abstraction has 1105 states and 3924 transitions. [2021-06-05 05:33:17,613 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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-06-05 05:33:17,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 3924 transitions. [2021-06-05 05:33:17,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-06-05 05:33:17,616 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:33:17,616 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-06-05 05:33:17,838 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 05:33:17,839 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:33:17,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:33:17,840 INFO L82 PathProgramCache]: Analyzing trace with hash 2103083480, now seen corresponding path program 1 times [2021-06-05 05:33:17,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:33:17,840 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555806458] [2021-06-05 05:33:17,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:33:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:17,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 05:33:17,901 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:33:17,901 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555806458] [2021-06-05 05:33:17,901 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555806458] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:17,901 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014846831] [2021-06-05 05:33:17,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-06-05 05:33:17,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:17,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2021-06-05 05:33:17,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 05:33:18,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 05:33:18,029 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014846831] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:18,029 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 05:33:18,029 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 6 [2021-06-05 05:33:18,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210447537] [2021-06-05 05:33:18,029 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 05:33:18,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:33:18,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 05:33:18,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 05:33:18,030 INFO L87 Difference]: Start difference. First operand 1105 states and 3924 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 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-06-05 05:33:18,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:33:18,099 INFO L93 Difference]: Finished difference Result 1282 states and 4578 transitions. [2021-06-05 05:33:18,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 05:33:18,099 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 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-06-05 05:33:18,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:33:18,106 INFO L225 Difference]: With dead ends: 1282 [2021-06-05 05:33:18,106 INFO L226 Difference]: Without dead ends: 1282 [2021-06-05 05:33:18,106 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 46.4ms TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-06-05 05:33:18,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2021-06-05 05:33:18,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1044. [2021-06-05 05:33:18,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 1043 states have (on average 3.5618408437200384) internal successors, (3715), 1043 states have internal predecessors, (3715), 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-06-05 05:33:18,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 3715 transitions. [2021-06-05 05:33:18,134 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 3715 transitions. Word has length 27 [2021-06-05 05:33:18,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:33:18,134 INFO L482 AbstractCegarLoop]: Abstraction has 1044 states and 3715 transitions. [2021-06-05 05:33:18,134 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 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-06-05 05:33:18,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 3715 transitions. [2021-06-05 05:33:18,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-06-05 05:33:18,137 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:33:18,137 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-06-05 05:33:18,357 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-06-05 05:33:18,358 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:33:18,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:33:18,358 INFO L82 PathProgramCache]: Analyzing trace with hash -873778054, now seen corresponding path program 1 times [2021-06-05 05:33:18,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:33:18,358 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838665273] [2021-06-05 05:33:18,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:33:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:18,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 05:33:18,537 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:33:18,538 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838665273] [2021-06-05 05:33:18,538 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838665273] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:18,538 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892657108] [2021-06-05 05:33:18,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 05:33:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:18,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 05:33:18,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 05:33:18,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2021-06-05 05:33:18,677 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 05:33:18,681 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 05:33:18,681 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 05:33:18,682 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2021-06-05 05:33:18,734 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 05:33:18,736 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 05:33:18,738 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 05:33:18,738 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 05:33:18,738 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:5 [2021-06-05 05:33:18,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 05:33:18,759 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892657108] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:18,759 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 05:33:18,759 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-06-05 05:33:18,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57810392] [2021-06-05 05:33:18,759 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 05:33:18,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:33:18,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 05:33:18,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-05 05:33:18,760 INFO L87 Difference]: Start difference. First operand 1044 states and 3715 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 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-06-05 05:33:18,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:33:18,983 INFO L93 Difference]: Finished difference Result 2477 states and 8903 transitions. [2021-06-05 05:33:18,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 05:33:18,984 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 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-06-05 05:33:18,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:33:18,989 INFO L225 Difference]: With dead ends: 2477 [2021-06-05 05:33:18,989 INFO L226 Difference]: Without dead ends: 1549 [2021-06-05 05:33:18,990 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 210.5ms TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2021-06-05 05:33:18,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2021-06-05 05:33:19,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 1288. [2021-06-05 05:33:19,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 1287 states have (on average 3.5283605283605284) internal successors, (4541), 1287 states have internal predecessors, (4541), 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-06-05 05:33:19,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 4541 transitions. [2021-06-05 05:33:19,023 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 4541 transitions. Word has length 29 [2021-06-05 05:33:19,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:33:19,023 INFO L482 AbstractCegarLoop]: Abstraction has 1288 states and 4541 transitions. [2021-06-05 05:33:19,023 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 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-06-05 05:33:19,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 4541 transitions. [2021-06-05 05:33:19,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-06-05 05:33:19,027 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:33:19,027 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-06-05 05:33:19,240 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 05:33:19,241 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:33:19,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:33:19,241 INFO L82 PathProgramCache]: Analyzing trace with hash -487573394, now seen corresponding path program 2 times [2021-06-05 05:33:19,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:33:19,241 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606974977] [2021-06-05 05:33:19,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:33:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:19,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 05:33:19,397 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:33:19,398 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606974977] [2021-06-05 05:33:19,398 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606974977] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:19,398 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207144643] [2021-06-05 05:33:19,398 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 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-06-05 05:33:19,445 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 05:33:19,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 05:33:19,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 05:33:19,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 05:33:19,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 05:33:19,534 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 05:33:19,535 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 05:33:19,536 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 05:33:19,536 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2021-06-05 05:33:19,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 05:33:19,558 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207144643] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:19,559 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 05:33:19,559 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 05:33:19,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594568641] [2021-06-05 05:33:19,561 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 05:33:19,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:33:19,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 05:33:19,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 05:33:19,562 INFO L87 Difference]: Start difference. First operand 1288 states and 4541 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 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-06-05 05:33:19,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:33:19,892 INFO L93 Difference]: Finished difference Result 3395 states and 12093 transitions. [2021-06-05 05:33:19,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 05:33:19,893 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 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-06-05 05:33:19,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:33:19,899 INFO L225 Difference]: With dead ends: 3395 [2021-06-05 05:33:19,899 INFO L226 Difference]: Without dead ends: 1756 [2021-06-05 05:33:19,899 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 281.1ms TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2021-06-05 05:33:19,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2021-06-05 05:33:19,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1019. [2021-06-05 05:33:19,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1018 states have (on average 3.486247544204322) internal successors, (3549), 1018 states have internal predecessors, (3549), 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-06-05 05:33:19,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 3549 transitions. [2021-06-05 05:33:19,935 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 3549 transitions. Word has length 29 [2021-06-05 05:33:19,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:33:19,935 INFO L482 AbstractCegarLoop]: Abstraction has 1019 states and 3549 transitions. [2021-06-05 05:33:19,935 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 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-06-05 05:33:19,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 3549 transitions. [2021-06-05 05:33:19,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-06-05 05:33:19,938 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:33:19,938 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-06-05 05:33:20,152 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-06-05 05:33:20,153 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:33:20,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:33:20,153 INFO L82 PathProgramCache]: Analyzing trace with hash -22453128, now seen corresponding path program 3 times [2021-06-05 05:33:20,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:33:20,153 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193340346] [2021-06-05 05:33:20,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:33:20,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:20,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 05:33:20,254 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:33:20,254 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193340346] [2021-06-05 05:33:20,254 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193340346] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:20,255 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943920159] [2021-06-05 05:33:20,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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-06-05 05:33:20,299 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 05:33:20,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 05:33:20,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2021-06-05 05:33:20,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 05:33:20,333 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 7 [2021-06-05 05:33:20,334 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 05:33:20,337 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 05:33:20,338 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 05:33:20,338 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:7 [2021-06-05 05:33:20,398 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 05:33:20,400 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 05:33:20,401 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 05:33:20,402 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 05:33:20,402 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2021-06-05 05:33:20,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 05:33:20,418 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943920159] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:20,418 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 05:33:20,418 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 05:33:20,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40912832] [2021-06-05 05:33:20,419 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 05:33:20,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:33:20,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 05:33:20,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-06-05 05:33:20,420 INFO L87 Difference]: Start difference. First operand 1019 states and 3549 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 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-06-05 05:33:20,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:33:20,606 INFO L93 Difference]: Finished difference Result 2225 states and 7823 transitions. [2021-06-05 05:33:20,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 05:33:20,607 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 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-06-05 05:33:20,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:33:20,610 INFO L225 Difference]: With dead ends: 2225 [2021-06-05 05:33:20,610 INFO L226 Difference]: Without dead ends: 1056 [2021-06-05 05:33:20,610 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 169.4ms TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2021-06-05 05:33:20,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2021-06-05 05:33:20,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 730. [2021-06-05 05:33:20,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 729 states have (on average 3.486968449931413) internal successors, (2542), 729 states have internal predecessors, (2542), 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-06-05 05:33:20,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 2542 transitions. [2021-06-05 05:33:20,628 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 2542 transitions. Word has length 29 [2021-06-05 05:33:20,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:33:20,628 INFO L482 AbstractCegarLoop]: Abstraction has 730 states and 2542 transitions. [2021-06-05 05:33:20,629 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 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-06-05 05:33:20,629 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 2542 transitions. [2021-06-05 05:33:20,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-06-05 05:33:20,630 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:33:20,630 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-06-05 05:33:20,852 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 05:33:20,853 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:33:20,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:33:20,853 INFO L82 PathProgramCache]: Analyzing trace with hash 836346912, now seen corresponding path program 4 times [2021-06-05 05:33:20,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:33:20,853 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651780192] [2021-06-05 05:33:20,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:33:20,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:20,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 05:33:20,981 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:33:20,981 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651780192] [2021-06-05 05:33:20,981 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651780192] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:20,981 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718982368] [2021-06-05 05:33:20,981 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 05:33:21,024 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 05:33:21,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 05:33:21,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 05:33:21,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 05:33:21,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2021-06-05 05:33:21,115 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 05:33:21,119 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 05:33:21,119 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 05:33:21,119 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2021-06-05 05:33:21,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 05:33:21,140 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 05:33:21,141 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 05:33:21,141 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 05:33:21,142 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:5 [2021-06-05 05:33:21,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 05:33:21,163 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718982368] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:21,163 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 05:33:21,163 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2021-06-05 05:33:21,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100756933] [2021-06-05 05:33:21,164 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 05:33:21,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:33:21,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 05:33:21,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 05:33:21,165 INFO L87 Difference]: Start difference. First operand 730 states and 2542 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 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-06-05 05:33:21,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:33:21,303 INFO L93 Difference]: Finished difference Result 1734 states and 6084 transitions. [2021-06-05 05:33:21,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 05:33:21,304 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 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-06-05 05:33:21,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:33:21,306 INFO L225 Difference]: With dead ends: 1734 [2021-06-05 05:33:21,306 INFO L226 Difference]: Without dead ends: 812 [2021-06-05 05:33:21,306 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 132.8ms TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-06-05 05:33:21,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2021-06-05 05:33:21,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 764. [2021-06-05 05:33:21,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 763 states have (on average 3.4416775884665793) internal successors, (2626), 763 states have internal predecessors, (2626), 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-06-05 05:33:21,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 2626 transitions. [2021-06-05 05:33:21,323 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 2626 transitions. Word has length 29 [2021-06-05 05:33:21,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:33:21,323 INFO L482 AbstractCegarLoop]: Abstraction has 764 states and 2626 transitions. [2021-06-05 05:33:21,323 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 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-06-05 05:33:21,323 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 2626 transitions. [2021-06-05 05:33:21,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-06-05 05:33:21,325 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:33:21,325 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 05:33:21,540 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-06-05 05:33:21,541 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:33:21,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:33:21,541 INFO L82 PathProgramCache]: Analyzing trace with hash 862166658, now seen corresponding path program 5 times [2021-06-05 05:33:21,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:33:21,541 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499411116] [2021-06-05 05:33:21,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:33:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:21,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 05:33:21,569 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:33:21,569 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499411116] [2021-06-05 05:33:21,569 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499411116] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:21,570 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494705320] [2021-06-05 05:33:21,570 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 05:33:21,607 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-06-05 05:33:21,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 05:33:21,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2021-06-05 05:33:21,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 05:33:21,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 05:33:21,661 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494705320] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:21,661 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 05:33:21,662 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-06-05 05:33:21,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156370815] [2021-06-05 05:33:21,662 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 05:33:21,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:33:21,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 05:33:21,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-05 05:33:21,663 INFO L87 Difference]: Start difference. First operand 764 states and 2626 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 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-06-05 05:33:21,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:33:21,750 INFO L93 Difference]: Finished difference Result 2158 states and 7467 transitions. [2021-06-05 05:33:21,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 05:33:21,751 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 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 31 [2021-06-05 05:33:21,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:33:21,756 INFO L225 Difference]: With dead ends: 2158 [2021-06-05 05:33:21,756 INFO L226 Difference]: Without dead ends: 2158 [2021-06-05 05:33:21,757 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 42.7ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-06-05 05:33:21,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2021-06-05 05:33:21,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 1150. [2021-06-05 05:33:21,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 1149 states have (on average 3.6257615317667535) internal successors, (4166), 1149 states have internal predecessors, (4166), 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-06-05 05:33:21,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 4166 transitions. [2021-06-05 05:33:21,790 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 4166 transitions. Word has length 31 [2021-06-05 05:33:21,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:33:21,790 INFO L482 AbstractCegarLoop]: Abstraction has 1150 states and 4166 transitions. [2021-06-05 05:33:21,790 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 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-06-05 05:33:21,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 4166 transitions. [2021-06-05 05:33:21,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-06-05 05:33:21,793 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:33:21,793 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 05:33:22,008 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-06-05 05:33:22,009 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:33:22,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:33:22,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1214611312, now seen corresponding path program 6 times [2021-06-05 05:33:22,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:33:22,009 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949281972] [2021-06-05 05:33:22,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:33:22,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:22,048 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 05:33:22,048 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:33:22,048 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949281972] [2021-06-05 05:33:22,048 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949281972] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:22,048 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978132308] [2021-06-05 05:33:22,048 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 05:33:22,097 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-06-05 05:33:22,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 05:33:22,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 05:33:22,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 05:33:22,191 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 05:33:22,192 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978132308] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:22,192 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 05:33:22,192 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-06-05 05:33:22,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255483330] [2021-06-05 05:33:22,193 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 05:33:22,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:33:22,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 05:33:22,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-05 05:33:22,193 INFO L87 Difference]: Start difference. First operand 1150 states and 4166 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 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-06-05 05:33:22,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:33:22,736 INFO L93 Difference]: Finished difference Result 3097 states and 11097 transitions. [2021-06-05 05:33:22,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-06-05 05:33:22,736 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 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 31 [2021-06-05 05:33:22,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:33:22,745 INFO L225 Difference]: With dead ends: 3097 [2021-06-05 05:33:22,745 INFO L226 Difference]: Without dead ends: 3092 [2021-06-05 05:33:22,746 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 329.9ms TimeCoverageRelationStatistics Valid=308, Invalid=952, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 05:33:22,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3092 states. [2021-06-05 05:33:22,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3092 to 1871. [2021-06-05 05:33:22,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1871 states, 1870 states have (on average 3.8058823529411763) internal successors, (7117), 1870 states have internal predecessors, (7117), 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-06-05 05:33:22,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 7117 transitions. [2021-06-05 05:33:22,797 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 7117 transitions. Word has length 31 [2021-06-05 05:33:22,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:33:22,797 INFO L482 AbstractCegarLoop]: Abstraction has 1871 states and 7117 transitions. [2021-06-05 05:33:22,797 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 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-06-05 05:33:22,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 7117 transitions. [2021-06-05 05:33:22,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-06-05 05:33:22,802 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:33:22,802 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 05:33:23,024 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-06-05 05:33:23,024 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:33:23,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:33:23,026 INFO L82 PathProgramCache]: Analyzing trace with hash -373015140, now seen corresponding path program 7 times [2021-06-05 05:33:23,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:33:23,026 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174484322] [2021-06-05 05:33:23,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:33:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:23,073 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 05:33:23,074 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:33:23,074 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174484322] [2021-06-05 05:33:23,074 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174484322] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:23,074 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116385231] [2021-06-05 05:33:23,074 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 05:33:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:23,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2021-06-05 05:33:23,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 05:33:23,187 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 05:33:23,187 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116385231] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:23,188 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 05:33:23,188 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-06-05 05:33:23,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099118233] [2021-06-05 05:33:23,188 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 05:33:23,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:33:23,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 05:33:23,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 05:33:23,189 INFO L87 Difference]: Start difference. First operand 1871 states and 7117 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 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-06-05 05:33:23,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:33:23,277 INFO L93 Difference]: Finished difference Result 3521 states and 13072 transitions. [2021-06-05 05:33:23,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 05:33:23,278 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 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-06-05 05:33:23,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:33:23,288 INFO L225 Difference]: With dead ends: 3521 [2021-06-05 05:33:23,288 INFO L226 Difference]: Without dead ends: 3502 [2021-06-05 05:33:23,288 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 35.1ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 05:33:23,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3502 states. [2021-06-05 05:33:23,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3502 to 2458. [2021-06-05 05:33:23,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2458 states, 2457 states have (on average 3.938949938949939) internal successors, (9678), 2457 states have internal predecessors, (9678), 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-06-05 05:33:23,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2458 states to 2458 states and 9678 transitions. [2021-06-05 05:33:23,351 INFO L78 Accepts]: Start accepts. Automaton has 2458 states and 9678 transitions. Word has length 33 [2021-06-05 05:33:23,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:33:23,351 INFO L482 AbstractCegarLoop]: Abstraction has 2458 states and 9678 transitions. [2021-06-05 05:33:23,351 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 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-06-05 05:33:23,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2458 states and 9678 transitions. [2021-06-05 05:33:23,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-06-05 05:33:23,360 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:33:23,360 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 05:33:23,579 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-06-05 05:33:23,579 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:33:23,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:33:23,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1066357152, now seen corresponding path program 8 times [2021-06-05 05:33:23,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:33:23,580 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398540556] [2021-06-05 05:33:23,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:33:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:23,605 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 05:33:23,606 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:33:23,606 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398540556] [2021-06-05 05:33:23,606 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398540556] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:23,606 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083266896] [2021-06-05 05:33:23,606 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 05:33:23,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 05:33:23,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 05:33:23,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2021-06-05 05:33:23,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 05:33:23,707 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 05:33:23,707 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083266896] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:23,707 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 05:33:23,707 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2021-06-05 05:33:23,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762346243] [2021-06-05 05:33:23,708 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 05:33:23,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:33:23,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 05:33:23,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-05 05:33:23,708 INFO L87 Difference]: Start difference. First operand 2458 states and 9678 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 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-06-05 05:33:23,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:33:23,786 INFO L93 Difference]: Finished difference Result 3425 states and 12799 transitions. [2021-06-05 05:33:23,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 05:33:23,786 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 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-06-05 05:33:23,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:33:23,796 INFO L225 Difference]: With dead ends: 3425 [2021-06-05 05:33:23,797 INFO L226 Difference]: Without dead ends: 3425 [2021-06-05 05:33:23,797 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 30.2ms TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-06-05 05:33:23,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3425 states. [2021-06-05 05:33:23,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3425 to 2506. [2021-06-05 05:33:23,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2506 states, 2505 states have (on average 3.9405189620758483) internal successors, (9871), 2505 states have internal predecessors, (9871), 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-06-05 05:33:23,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 9871 transitions. [2021-06-05 05:33:23,865 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 9871 transitions. Word has length 33 [2021-06-05 05:33:23,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:33:23,865 INFO L482 AbstractCegarLoop]: Abstraction has 2506 states and 9871 transitions. [2021-06-05 05:33:23,865 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 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-06-05 05:33:23,865 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 9871 transitions. [2021-06-05 05:33:23,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-06-05 05:33:23,871 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:33:23,871 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 05:33:24,092 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-06-05 05:33:24,092 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:33:24,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:33:24,092 INFO L82 PathProgramCache]: Analyzing trace with hash -279862338, now seen corresponding path program 9 times [2021-06-05 05:33:24,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:33:24,092 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407128516] [2021-06-05 05:33:24,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:33:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:24,260 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 05:33:24,260 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:33:24,260 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407128516] [2021-06-05 05:33:24,260 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407128516] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:24,260 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425004948] [2021-06-05 05:33:24,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 05:33:24,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-06-05 05:33:24,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 05:33:24,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 17 conjunts are in the unsatisfiable core [2021-06-05 05:33:24,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 05:33:24,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2021-06-05 05:33:24,389 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 05:33:24,392 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 05:33:24,392 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 05:33:24,392 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2021-06-05 05:33:24,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 05:33:24,453 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 05:33:24,455 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 05:33:24,455 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 05:33:24,455 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:5 [2021-06-05 05:33:24,482 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 05:33:24,483 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425004948] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:24,483 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 05:33:24,483 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 05:33:24,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711027932] [2021-06-05 05:33:24,483 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 05:33:24,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:33:24,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 05:33:24,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 05:33:24,484 INFO L87 Difference]: Start difference. First operand 2506 states and 9871 transitions. Second operand has 16 states, 16 states have (on average 3.75) internal successors, (60), 15 states have internal predecessors, (60), 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-06-05 05:33:25,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:33:25,286 INFO L93 Difference]: Finished difference Result 7202 states and 27392 transitions. [2021-06-05 05:33:25,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 05:33:25,286 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 15 states have internal predecessors, (60), 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 35 [2021-06-05 05:33:25,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:33:25,298 INFO L225 Difference]: With dead ends: 7202 [2021-06-05 05:33:25,298 INFO L226 Difference]: Without dead ends: 3817 [2021-06-05 05:33:25,298 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 434.5ms TimeCoverageRelationStatistics Valid=186, Invalid=870, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 05:33:25,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3817 states. [2021-06-05 05:33:25,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3817 to 2612. [2021-06-05 05:33:25,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2612 states, 2611 states have (on average 3.8885484488701647) internal successors, (10153), 2611 states have internal predecessors, (10153), 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-06-05 05:33:25,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2612 states to 2612 states and 10153 transitions. [2021-06-05 05:33:25,360 INFO L78 Accepts]: Start accepts. Automaton has 2612 states and 10153 transitions. Word has length 35 [2021-06-05 05:33:25,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:33:25,360 INFO L482 AbstractCegarLoop]: Abstraction has 2612 states and 10153 transitions. [2021-06-05 05:33:25,360 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 15 states have internal predecessors, (60), 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-06-05 05:33:25,360 INFO L276 IsEmpty]: Start isEmpty. Operand 2612 states and 10153 transitions. [2021-06-05 05:33:25,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-06-05 05:33:25,366 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:33:25,366 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 05:33:25,580 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 05:33:25,581 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:33:25,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:33:25,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1543863878, now seen corresponding path program 10 times [2021-06-05 05:33:25,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:33:25,581 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346396721] [2021-06-05 05:33:25,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:33:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:25,720 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 05:33:25,720 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:33:25,720 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346396721] [2021-06-05 05:33:25,720 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346396721] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:25,720 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291036554] [2021-06-05 05:33:25,720 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 05:33:25,768 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 05:33:25,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 05:33:25,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 18 conjunts are in the unsatisfiable core [2021-06-05 05:33:25,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 05:33:25,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:33:25,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2021-06-05 05:33:25,859 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 05:33:25,864 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 05:33:25,865 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 05:33:25,865 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:12 [2021-06-05 05:33:25,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2021-06-05 05:33:25,889 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 05:33:25,892 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 05:33:25,893 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 05:33:25,893 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2021-06-05 05:33:25,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 05:33:25,953 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 05:33:25,955 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 05:33:25,955 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 05:33:25,956 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:5 [2021-06-05 05:33:25,973 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 05:33:25,973 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291036554] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:25,973 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 05:33:25,973 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2021-06-05 05:33:25,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847839687] [2021-06-05 05:33:25,973 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 05:33:25,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:33:25,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 05:33:25,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-06-05 05:33:25,974 INFO L87 Difference]: Start difference. First operand 2612 states and 10153 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 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-06-05 05:33:26,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:33:26,587 INFO L93 Difference]: Finished difference Result 5807 states and 22379 transitions. [2021-06-05 05:33:26,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 05:33:26,587 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 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 35 [2021-06-05 05:33:26,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:33:26,596 INFO L225 Difference]: With dead ends: 5807 [2021-06-05 05:33:26,596 INFO L226 Difference]: Without dead ends: 2780 [2021-06-05 05:33:26,596 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 334.2ms TimeCoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2021-06-05 05:33:26,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2780 states. [2021-06-05 05:33:26,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2780 to 2646. [2021-06-05 05:33:26,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2646 states, 2645 states have (on average 3.86351606805293) internal successors, (10219), 2645 states have internal predecessors, (10219), 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-06-05 05:33:26,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2646 states to 2646 states and 10219 transitions. [2021-06-05 05:33:26,658 INFO L78 Accepts]: Start accepts. Automaton has 2646 states and 10219 transitions. Word has length 35 [2021-06-05 05:33:26,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:33:26,658 INFO L482 AbstractCegarLoop]: Abstraction has 2646 states and 10219 transitions. [2021-06-05 05:33:26,658 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 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-06-05 05:33:26,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2646 states and 10219 transitions. [2021-06-05 05:33:26,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 05:33:26,664 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:33:26,664 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 05:33:26,884 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-06-05 05:33:26,884 INFO L430 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:33:26,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:33:26,885 INFO L82 PathProgramCache]: Analyzing trace with hash -833611472, now seen corresponding path program 11 times [2021-06-05 05:33:26,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:33:26,885 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928679025] [2021-06-05 05:33:26,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:33:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:26,926 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 05:33:26,926 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:33:26,926 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928679025] [2021-06-05 05:33:26,926 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928679025] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:26,926 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614595016] [2021-06-05 05:33:26,926 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 05:33:26,983 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-06-05 05:33:26,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 05:33:26,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 05:33:26,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 05:33:27,041 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 05:33:27,041 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614595016] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:27,041 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 05:33:27,042 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2021-06-05 05:33:27,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986229091] [2021-06-05 05:33:27,043 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 05:33:27,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:33:27,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 05:33:27,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-06-05 05:33:27,044 INFO L87 Difference]: Start difference. First operand 2646 states and 10219 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 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-06-05 05:33:27,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:33:27,157 INFO L93 Difference]: Finished difference Result 6355 states and 23872 transitions. [2021-06-05 05:33:27,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 05:33:27,158 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 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 37 [2021-06-05 05:33:27,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:33:27,173 INFO L225 Difference]: With dead ends: 6355 [2021-06-05 05:33:27,173 INFO L226 Difference]: Without dead ends: 6330 [2021-06-05 05:33:27,173 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 40.3ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 05:33:27,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6330 states. [2021-06-05 05:33:27,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6330 to 3550. [2021-06-05 05:33:27,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3550 states, 3549 states have (on average 4.066215835446605) internal successors, (14431), 3549 states have internal predecessors, (14431), 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-06-05 05:33:27,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3550 states to 3550 states and 14431 transitions. [2021-06-05 05:33:27,275 INFO L78 Accepts]: Start accepts. Automaton has 3550 states and 14431 transitions. Word has length 37 [2021-06-05 05:33:27,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:33:27,275 INFO L482 AbstractCegarLoop]: Abstraction has 3550 states and 14431 transitions. [2021-06-05 05:33:27,275 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 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-06-05 05:33:27,275 INFO L276 IsEmpty]: Start isEmpty. Operand 3550 states and 14431 transitions. [2021-06-05 05:33:27,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 05:33:27,284 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:33:27,284 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 05:33:27,496 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 05:33:27,497 INFO L430 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:33:27,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:33:27,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1361280888, now seen corresponding path program 12 times [2021-06-05 05:33:27,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:33:27,497 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410946653] [2021-06-05 05:33:27,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:33:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:27,539 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 05:33:27,540 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:33:27,540 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410946653] [2021-06-05 05:33:27,540 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410946653] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:27,541 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093685386] [2021-06-05 05:33:27,541 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 05:33:27,582 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-06-05 05:33:27,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 05:33:27,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-05 05:33:27,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 05:33:27,680 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 05:33:27,680 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093685386] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:27,680 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 05:33:27,680 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2021-06-05 05:33:27,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258634745] [2021-06-05 05:33:27,680 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 05:33:27,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:33:27,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 05:33:27,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-06-05 05:33:27,681 INFO L87 Difference]: Start difference. First operand 3550 states and 14431 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 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-06-05 05:33:28,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:33:28,782 INFO L93 Difference]: Finished difference Result 18520 states and 67963 transitions. [2021-06-05 05:33:28,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2021-06-05 05:33:28,782 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 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 37 [2021-06-05 05:33:28,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:33:28,830 INFO L225 Difference]: With dead ends: 18520 [2021-06-05 05:33:28,830 INFO L226 Difference]: Without dead ends: 18520 [2021-06-05 05:33:28,831 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2138 ImplicationChecksByTransitivity, 698.1ms TimeCoverageRelationStatistics Valid=1229, Invalid=4173, Unknown=0, NotChecked=0, Total=5402 [2021-06-05 05:33:28,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18520 states. [2021-06-05 05:33:29,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18520 to 4298. [2021-06-05 05:33:29,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4298 states, 4297 states have (on average 4.053060274610194) internal successors, (17416), 4297 states have internal predecessors, (17416), 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-06-05 05:33:29,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4298 states to 4298 states and 17416 transitions. [2021-06-05 05:33:29,057 INFO L78 Accepts]: Start accepts. Automaton has 4298 states and 17416 transitions. Word has length 37 [2021-06-05 05:33:29,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:33:29,058 INFO L482 AbstractCegarLoop]: Abstraction has 4298 states and 17416 transitions. [2021-06-05 05:33:29,058 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 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-06-05 05:33:29,058 INFO L276 IsEmpty]: Start isEmpty. Operand 4298 states and 17416 transitions. [2021-06-05 05:33:29,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-06-05 05:33:29,068 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:33:29,068 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 05:33:29,286 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-06-05 05:33:29,287 INFO L430 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:33:29,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:33:29,287 INFO L82 PathProgramCache]: Analyzing trace with hash 244206134, now seen corresponding path program 13 times [2021-06-05 05:33:29,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:33:29,287 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883575448] [2021-06-05 05:33:29,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:33:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:29,333 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-06-05 05:33:29,333 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:33:29,333 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883575448] [2021-06-05 05:33:29,333 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883575448] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:29,333 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361594422] [2021-06-05 05:33:29,333 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 05:33:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:29,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 05:33:29,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 05:33:29,479 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-05 05:33:29,479 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361594422] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:29,479 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 05:33:29,479 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2021-06-05 05:33:29,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694823877] [2021-06-05 05:33:29,480 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 05:33:29,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:33:29,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 05:33:29,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-06-05 05:33:29,481 INFO L87 Difference]: Start difference. First operand 4298 states and 17416 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 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-06-05 05:33:29,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:33:29,606 INFO L93 Difference]: Finished difference Result 7391 states and 28099 transitions. [2021-06-05 05:33:29,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 05:33:29,607 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 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 39 [2021-06-05 05:33:29,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:33:29,622 INFO L225 Difference]: With dead ends: 7391 [2021-06-05 05:33:29,622 INFO L226 Difference]: Without dead ends: 7391 [2021-06-05 05:33:29,623 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 51.0ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 05:33:29,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7391 states. [2021-06-05 05:33:29,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7391 to 3716. [2021-06-05 05:33:29,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3716 states, 3715 states have (on average 3.973620457604307) internal successors, (14762), 3715 states have internal predecessors, (14762), 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-06-05 05:33:29,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3716 states to 3716 states and 14762 transitions. [2021-06-05 05:33:29,719 INFO L78 Accepts]: Start accepts. Automaton has 3716 states and 14762 transitions. Word has length 39 [2021-06-05 05:33:29,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:33:29,719 INFO L482 AbstractCegarLoop]: Abstraction has 3716 states and 14762 transitions. [2021-06-05 05:33:29,720 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 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-06-05 05:33:29,720 INFO L276 IsEmpty]: Start isEmpty. Operand 3716 states and 14762 transitions. [2021-06-05 05:33:29,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-06-05 05:33:29,728 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:33:29,728 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 05:33:29,944 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 05:33:29,945 INFO L430 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:33:29,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:33:29,945 INFO L82 PathProgramCache]: Analyzing trace with hash 464290510, now seen corresponding path program 14 times [2021-06-05 05:33:29,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:33:29,945 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497756828] [2021-06-05 05:33:29,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:33:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:29,994 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-06-05 05:33:29,994 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:33:29,994 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497756828] [2021-06-05 05:33:29,994 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497756828] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:29,994 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294405970] [2021-06-05 05:33:29,994 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 05:33:30,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 05:33:30,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 05:33:30,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 05:33:30,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 05:33:30,129 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-06-05 05:33:30,130 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294405970] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:30,130 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 05:33:30,130 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 05:33:30,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157013052] [2021-06-05 05:33:30,130 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 05:33:30,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:33:30,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 05:33:30,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-06-05 05:33:30,131 INFO L87 Difference]: Start difference. First operand 3716 states and 14762 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 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-06-05 05:33:30,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:33:30,285 INFO L93 Difference]: Finished difference Result 8929 states and 34274 transitions. [2021-06-05 05:33:30,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 05:33:30,285 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 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 39 [2021-06-05 05:33:30,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:33:30,302 INFO L225 Difference]: With dead ends: 8929 [2021-06-05 05:33:30,302 INFO L226 Difference]: Without dead ends: 8929 [2021-06-05 05:33:30,302 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 71.7ms TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2021-06-05 05:33:30,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8929 states. [2021-06-05 05:33:30,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8929 to 5458. [2021-06-05 05:33:30,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5458 states, 5457 states have (on average 4.080263881253436) internal successors, (22266), 5457 states have internal predecessors, (22266), 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-06-05 05:33:30,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5458 states to 5458 states and 22266 transitions. [2021-06-05 05:33:30,434 INFO L78 Accepts]: Start accepts. Automaton has 5458 states and 22266 transitions. Word has length 39 [2021-06-05 05:33:30,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:33:30,435 INFO L482 AbstractCegarLoop]: Abstraction has 5458 states and 22266 transitions. [2021-06-05 05:33:30,435 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 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-06-05 05:33:30,435 INFO L276 IsEmpty]: Start isEmpty. Operand 5458 states and 22266 transitions. [2021-06-05 05:33:30,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-06-05 05:33:30,447 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:33:30,447 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 05:33:30,660 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-06-05 05:33:30,661 INFO L430 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:33:30,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:33:30,661 INFO L82 PathProgramCache]: Analyzing trace with hash -316201746, now seen corresponding path program 15 times [2021-06-05 05:33:30,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:33:30,661 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786000545] [2021-06-05 05:33:30,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:33:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:30,698 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 05:33:30,698 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:33:30,698 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786000545] [2021-06-05 05:33:30,698 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786000545] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:30,698 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343612825] [2021-06-05 05:33:30,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 05:33:30,752 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-06-05 05:33:30,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 05:33:30,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 05:33:30,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 05:33:30,918 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 05:33:30,918 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343612825] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:30,918 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 05:33:30,918 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 15 [2021-06-05 05:33:30,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553388978] [2021-06-05 05:33:30,919 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 05:33:30,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:33:30,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 05:33:30,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2021-06-05 05:33:30,920 INFO L87 Difference]: Start difference. First operand 5458 states and 22266 transitions. Second operand has 16 states, 16 states have (on average 4.125) internal successors, (66), 15 states have internal predecessors, (66), 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-06-05 05:33:31,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:33:31,832 INFO L93 Difference]: Finished difference Result 25578 states and 101328 transitions. [2021-06-05 05:33:31,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-06-05 05:33:31,833 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 15 states have internal predecessors, (66), 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 41 [2021-06-05 05:33:31,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:33:31,894 INFO L225 Difference]: With dead ends: 25578 [2021-06-05 05:33:31,894 INFO L226 Difference]: Without dead ends: 25021 [2021-06-05 05:33:31,895 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1469 ImplicationChecksByTransitivity, 506.6ms TimeCoverageRelationStatistics Valid=870, Invalid=3420, Unknown=0, NotChecked=0, Total=4290 [2021-06-05 05:33:32,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25021 states. [2021-06-05 05:33:32,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25021 to 12090. [2021-06-05 05:33:32,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12090 states, 12089 states have (on average 4.159980147241294) internal successors, (50290), 12089 states have internal predecessors, (50290), 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-06-05 05:33:32,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12090 states to 12090 states and 50290 transitions. [2021-06-05 05:33:32,362 INFO L78 Accepts]: Start accepts. Automaton has 12090 states and 50290 transitions. Word has length 41 [2021-06-05 05:33:32,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:33:32,363 INFO L482 AbstractCegarLoop]: Abstraction has 12090 states and 50290 transitions. [2021-06-05 05:33:32,363 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 15 states have internal predecessors, (66), 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-06-05 05:33:32,363 INFO L276 IsEmpty]: Start isEmpty. Operand 12090 states and 50290 transitions. [2021-06-05 05:33:32,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-06-05 05:33:32,393 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:33:32,393 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 05:33:32,608 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-06-05 05:33:32,609 INFO L430 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:33:32,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:33:32,609 INFO L82 PathProgramCache]: Analyzing trace with hash 76824112, now seen corresponding path program 16 times [2021-06-05 05:33:32,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:33:32,609 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13752662] [2021-06-05 05:33:32,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:33:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:32,819 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 05:33:32,819 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:33:32,820 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13752662] [2021-06-05 05:33:32,820 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13752662] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:32,820 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749040990] [2021-06-05 05:33:32,820 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 05:33:32,866 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 05:33:32,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 05:33:32,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 05:33:32,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 05:33:32,927 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 05:33:32,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2021-06-05 05:33:32,930 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 05:33:32,936 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 05:33:32,936 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 05:33:32,937 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:19 [2021-06-05 05:33:33,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2021-06-05 05:33:33,046 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 05:33:33,050 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 05:33:33,050 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 05:33:33,050 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:14 [2021-06-05 05:33:33,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:33:33,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2021-06-05 05:33:33,078 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 05:33:33,083 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 05:33:33,084 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 05:33:33,084 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2021-06-05 05:33:33,217 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 05:33:33,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 20 [2021-06-05 05:33:33,225 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 05:33:33,229 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 05:33:33,229 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2021-06-05 05:33:33,231 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 05:33:33,236 INFO L628 ElimStorePlain]: treesize reduction 16, result has 23.8 percent of original size [2021-06-05 05:33:33,237 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 05:33:33,237 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:5 [2021-06-05 05:33:33,252 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 05:33:33,252 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749040990] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:33,252 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 05:33:33,252 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 19 [2021-06-05 05:33:33,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254219604] [2021-06-05 05:33:33,253 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 05:33:33,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:33:33,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 05:33:33,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2021-06-05 05:33:33,254 INFO L87 Difference]: Start difference. First operand 12090 states and 50290 transitions. Second operand has 20 states, 20 states have (on average 3.1) internal successors, (62), 19 states have internal predecessors, (62), 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-06-05 05:33:34,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:33:34,406 INFO L93 Difference]: Finished difference Result 29674 states and 123111 transitions. [2021-06-05 05:33:34,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 05:33:34,407 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.1) internal successors, (62), 19 states have internal predecessors, (62), 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 41 [2021-06-05 05:33:34,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:33:34,430 INFO L225 Difference]: With dead ends: 29674 [2021-06-05 05:33:34,430 INFO L226 Difference]: Without dead ends: 10661 [2021-06-05 05:33:34,431 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 631.7ms TimeCoverageRelationStatistics Valid=164, Invalid=958, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 05:33:34,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10661 states. [2021-06-05 05:33:34,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10661 to 10661. [2021-06-05 05:33:34,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10661 states, 10660 states have (on average 4.182833020637899) internal successors, (44589), 10660 states have internal predecessors, (44589), 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-06-05 05:33:34,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10661 states to 10661 states and 44589 transitions. [2021-06-05 05:33:34,772 INFO L78 Accepts]: Start accepts. Automaton has 10661 states and 44589 transitions. Word has length 41 [2021-06-05 05:33:34,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:33:34,772 INFO L482 AbstractCegarLoop]: Abstraction has 10661 states and 44589 transitions. [2021-06-05 05:33:34,772 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 3.1) internal successors, (62), 19 states have internal predecessors, (62), 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-06-05 05:33:34,772 INFO L276 IsEmpty]: Start isEmpty. Operand 10661 states and 44589 transitions. [2021-06-05 05:33:34,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-06-05 05:33:34,814 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:33:34,815 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 05:33:35,015 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-06-05 05:33:35,015 INFO L430 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:33:35,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:33:35,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1918512476, now seen corresponding path program 17 times [2021-06-05 05:33:35,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:33:35,016 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254554850] [2021-06-05 05:33:35,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:33:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:35,153 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-06-05 05:33:35,154 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:33:35,154 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254554850] [2021-06-05 05:33:35,154 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254554850] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:35,154 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767746169] [2021-06-05 05:33:35,154 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 05:33:35,215 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-06-05 05:33:35,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 05:33:35,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 05:33:35,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 05:33:35,293 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-06-05 05:33:35,294 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767746169] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:35,294 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 05:33:35,294 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2021-06-05 05:33:35,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805206441] [2021-06-05 05:33:35,295 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 05:33:35,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:33:35,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 05:33:35,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-06-05 05:33:35,295 INFO L87 Difference]: Start difference. First operand 10661 states and 44589 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 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-06-05 05:33:35,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:33:35,619 INFO L93 Difference]: Finished difference Result 29121 states and 115415 transitions. [2021-06-05 05:33:35,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 05:33:35,619 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 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 45 [2021-06-05 05:33:35,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:33:35,698 INFO L225 Difference]: With dead ends: 29121 [2021-06-05 05:33:35,698 INFO L226 Difference]: Without dead ends: 29121 [2021-06-05 05:33:35,698 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 191.5ms TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2021-06-05 05:33:35,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29121 states. [2021-06-05 05:33:36,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29121 to 13495. [2021-06-05 05:33:36,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13495 states, 13494 states have (on average 4.214910330517267) internal successors, (56876), 13494 states have internal predecessors, (56876), 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-06-05 05:33:36,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13495 states to 13495 states and 56876 transitions. [2021-06-05 05:33:36,288 INFO L78 Accepts]: Start accepts. Automaton has 13495 states and 56876 transitions. Word has length 45 [2021-06-05 05:33:36,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:33:36,289 INFO L482 AbstractCegarLoop]: Abstraction has 13495 states and 56876 transitions. [2021-06-05 05:33:36,289 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 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-06-05 05:33:36,289 INFO L276 IsEmpty]: Start isEmpty. Operand 13495 states and 56876 transitions. [2021-06-05 05:33:36,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-06-05 05:33:36,316 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:33:36,316 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 05:33:36,516 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-06-05 05:33:36,516 INFO L430 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:33:36,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:33:36,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1257155186, now seen corresponding path program 18 times [2021-06-05 05:33:36,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:33:36,517 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986767] [2021-06-05 05:33:36,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:33:36,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:36,559 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-06-05 05:33:36,559 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:33:36,559 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986767] [2021-06-05 05:33:36,559 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986767] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:36,559 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497787847] [2021-06-05 05:33:36,560 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 05:33:36,622 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-06-05 05:33:36,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 05:33:36,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 05:33:36,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 05:33:36,749 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-06-05 05:33:36,749 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497787847] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:36,749 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 05:33:36,750 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2021-06-05 05:33:36,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067681470] [2021-06-05 05:33:36,750 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 05:33:36,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:33:36,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 05:33:36,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-06-05 05:33:36,753 INFO L87 Difference]: Start difference. First operand 13495 states and 56876 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 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-06-05 05:33:36,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:33:36,920 INFO L93 Difference]: Finished difference Result 17084 states and 68774 transitions. [2021-06-05 05:33:36,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 05:33:36,920 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 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 45 [2021-06-05 05:33:36,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:33:36,963 INFO L225 Difference]: With dead ends: 17084 [2021-06-05 05:33:36,963 INFO L226 Difference]: Without dead ends: 17079 [2021-06-05 05:33:36,964 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 46.0ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-06-05 05:33:36,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17079 states. [2021-06-05 05:33:37,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17079 to 11949. [2021-06-05 05:33:37,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11949 states, 11948 states have (on average 4.176012721794443) internal successors, (49895), 11948 states have internal predecessors, (49895), 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-06-05 05:33:37,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11949 states to 11949 states and 49895 transitions. [2021-06-05 05:33:37,336 INFO L78 Accepts]: Start accepts. Automaton has 11949 states and 49895 transitions. Word has length 45 [2021-06-05 05:33:37,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:33:37,336 INFO L482 AbstractCegarLoop]: Abstraction has 11949 states and 49895 transitions. [2021-06-05 05:33:37,336 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 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-06-05 05:33:37,336 INFO L276 IsEmpty]: Start isEmpty. Operand 11949 states and 49895 transitions. [2021-06-05 05:33:37,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-06-05 05:33:37,355 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:33:37,356 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 05:33:37,556 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-06-05 05:33:37,556 INFO L430 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:33:37,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:33:37,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1355059624, now seen corresponding path program 19 times [2021-06-05 05:33:37,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:33:37,557 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330439644] [2021-06-05 05:33:37,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:33:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:37,600 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-06-05 05:33:37,601 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:33:37,601 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330439644] [2021-06-05 05:33:37,601 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330439644] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:37,601 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274517357] [2021-06-05 05:33:37,601 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 05:33:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:37,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 05:33:37,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 05:33:37,709 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-06-05 05:33:37,710 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274517357] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:37,710 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 05:33:37,710 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2021-06-05 05:33:37,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421821164] [2021-06-05 05:33:37,710 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 05:33:37,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:33:37,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 05:33:37,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 05:33:37,711 INFO L87 Difference]: Start difference. First operand 11949 states and 49895 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 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-06-05 05:33:38,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:33:38,035 INFO L93 Difference]: Finished difference Result 25411 states and 101469 transitions. [2021-06-05 05:33:38,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 05:33:38,035 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 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 45 [2021-06-05 05:33:38,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:33:38,111 INFO L225 Difference]: With dead ends: 25411 [2021-06-05 05:33:38,111 INFO L226 Difference]: Without dead ends: 25396 [2021-06-05 05:33:38,111 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 52.9ms TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2021-06-05 05:33:38,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25396 states. [2021-06-05 05:33:38,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25396 to 16947. [2021-06-05 05:33:38,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16947 states, 16946 states have (on average 4.316711908414965) internal successors, (73151), 16946 states have internal predecessors, (73151), 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-06-05 05:33:38,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16947 states to 16947 states and 73151 transitions. [2021-06-05 05:33:38,624 INFO L78 Accepts]: Start accepts. Automaton has 16947 states and 73151 transitions. Word has length 45 [2021-06-05 05:33:38,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:33:38,624 INFO L482 AbstractCegarLoop]: Abstraction has 16947 states and 73151 transitions. [2021-06-05 05:33:38,624 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 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-06-05 05:33:38,624 INFO L276 IsEmpty]: Start isEmpty. Operand 16947 states and 73151 transitions. [2021-06-05 05:33:38,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-06-05 05:33:38,765 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:33:38,766 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 05:33:38,980 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 05:33:38,981 INFO L430 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:33:38,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:33:38,981 INFO L82 PathProgramCache]: Analyzing trace with hash -2063999716, now seen corresponding path program 20 times [2021-06-05 05:33:38,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:33:38,981 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444594803] [2021-06-05 05:33:38,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:33:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:39,020 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-06-05 05:33:39,020 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:33:39,020 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444594803] [2021-06-05 05:33:39,021 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444594803] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:39,021 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687605449] [2021-06-05 05:33:39,021 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 05:33:39,061 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 05:33:39,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 05:33:39,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 05:33:39,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 05:33:39,139 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-06-05 05:33:39,139 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687605449] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:39,139 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 05:33:39,139 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2021-06-05 05:33:39,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019768626] [2021-06-05 05:33:39,140 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 05:33:39,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:33:39,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 05:33:39,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-06-05 05:33:39,141 INFO L87 Difference]: Start difference. First operand 16947 states and 73151 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 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-06-05 05:33:39,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:33:39,439 INFO L93 Difference]: Finished difference Result 28052 states and 112596 transitions. [2021-06-05 05:33:39,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 05:33:39,440 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 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 45 [2021-06-05 05:33:39,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:33:39,515 INFO L225 Difference]: With dead ends: 28052 [2021-06-05 05:33:39,515 INFO L226 Difference]: Without dead ends: 28052 [2021-06-05 05:33:39,515 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 51.1ms TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-06-05 05:33:39,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28052 states. [2021-06-05 05:33:39,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28052 to 17627. [2021-06-05 05:33:40,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17627 states, 17626 states have (on average 4.310790877113355) internal successors, (75982), 17626 states have internal predecessors, (75982), 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-06-05 05:33:40,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17627 states to 17627 states and 75982 transitions. [2021-06-05 05:33:40,067 INFO L78 Accepts]: Start accepts. Automaton has 17627 states and 75982 transitions. Word has length 45 [2021-06-05 05:33:40,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:33:40,067 INFO L482 AbstractCegarLoop]: Abstraction has 17627 states and 75982 transitions. [2021-06-05 05:33:40,067 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 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-06-05 05:33:40,067 INFO L276 IsEmpty]: Start isEmpty. Operand 17627 states and 75982 transitions. [2021-06-05 05:33:40,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-06-05 05:33:40,108 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:33:40,108 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 05:33:40,309 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-06-05 05:33:40,309 INFO L430 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:33:40,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:33:40,309 INFO L82 PathProgramCache]: Analyzing trace with hash 953180244, now seen corresponding path program 21 times [2021-06-05 05:33:40,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:33:40,310 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038361288] [2021-06-05 05:33:40,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:33:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:40,363 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-06-05 05:33:40,364 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:33:40,364 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038361288] [2021-06-05 05:33:40,364 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038361288] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:40,364 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629847491] [2021-06-05 05:33:40,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 05:33:40,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-06-05 05:33:40,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 05:33:40,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 18 conjunts are in the unsatisfiable core [2021-06-05 05:33:40,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 05:33:40,581 INFO L354 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2021-06-05 05:33:40,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 28 [2021-06-05 05:33:40,587 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 05:33:40,617 INFO L628 ElimStorePlain]: treesize reduction 15, result has 67.4 percent of original size [2021-06-05 05:33:40,630 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 05:33:40,630 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:28 [2021-06-05 05:33:40,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:33:40,789 INFO L354 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2021-06-05 05:33:40,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 28 [2021-06-05 05:33:40,795 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 05:33:40,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:33:40,800 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2021-06-05 05:33:40,801 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 05:33:40,858 INFO L628 ElimStorePlain]: treesize reduction 15, result has 79.5 percent of original size [2021-06-05 05:33:40,872 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 05:33:40,872 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:50 [2021-06-05 05:33:40,992 INFO L354 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2021-06-05 05:33:40,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 28 [2021-06-05 05:33:40,997 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 05:33:41,025 INFO L628 ElimStorePlain]: treesize reduction 15, result has 69.4 percent of original size [2021-06-05 05:33:41,034 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 05:33:41,034 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:34 [2021-06-05 05:33:41,517 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2021-06-05 05:33:41,517 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 05:33:41,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2021-06-05 05:33:41,523 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 05:33:41,535 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 05:33:41,558 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 05:33:41,558 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:31 [2021-06-05 05:33:41,674 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-06-05 05:33:41,674 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629847491] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:41,674 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 05:33:41,674 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 21 [2021-06-05 05:33:41,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431048239] [2021-06-05 05:33:41,675 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 05:33:41,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:33:41,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 05:33:41,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2021-06-05 05:33:41,675 INFO L87 Difference]: Start difference. First operand 17627 states and 75982 transitions. Second operand has 21 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 states have internal predecessors, (76), 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-06-05 05:33:45,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:33:45,623 INFO L93 Difference]: Finished difference Result 45459 states and 178326 transitions. [2021-06-05 05:33:45,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-06-05 05:33:45,623 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 states have internal predecessors, (76), 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 45 [2021-06-05 05:33:45,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:33:45,732 INFO L225 Difference]: With dead ends: 45459 [2021-06-05 05:33:45,732 INFO L226 Difference]: Without dead ends: 44947 [2021-06-05 05:33:45,734 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 86 SyntacticMatches, 14 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2667 ImplicationChecksByTransitivity, 2677.6ms TimeCoverageRelationStatistics Valid=1243, Invalid=7129, Unknown=0, NotChecked=0, Total=8372 [2021-06-05 05:33:45,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44947 states. [2021-06-05 05:33:46,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44947 to 20763. [2021-06-05 05:33:46,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20763 states, 20762 states have (on average 4.309266929968211) internal successors, (89469), 20762 states have internal predecessors, (89469), 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-06-05 05:33:46,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20763 states to 20763 states and 89469 transitions. [2021-06-05 05:33:46,467 INFO L78 Accepts]: Start accepts. Automaton has 20763 states and 89469 transitions. Word has length 45 [2021-06-05 05:33:46,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:33:46,467 INFO L482 AbstractCegarLoop]: Abstraction has 20763 states and 89469 transitions. [2021-06-05 05:33:46,467 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 states have internal predecessors, (76), 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-06-05 05:33:46,467 INFO L276 IsEmpty]: Start isEmpty. Operand 20763 states and 89469 transitions. [2021-06-05 05:33:46,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-06-05 05:33:46,507 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:33:46,507 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 05:33:46,708 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-06-05 05:33:46,709 INFO L430 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:33:46,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:33:46,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1505718650, now seen corresponding path program 22 times [2021-06-05 05:33:46,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:33:46,709 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953946053] [2021-06-05 05:33:46,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:33:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:46,977 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-06-05 05:33:46,977 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:33:46,978 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953946053] [2021-06-05 05:33:46,978 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953946053] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:46,978 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389263496] [2021-06-05 05:33:46,978 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 05:33:47,019 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 05:33:47,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 05:33:47,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 24 conjunts are in the unsatisfiable core [2021-06-05 05:33:47,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 05:33:47,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:33:47,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2021-06-05 05:33:47,225 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 05:33:47,229 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 05:33:47,230 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 05:33:47,230 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:7 [2021-06-05 05:33:47,379 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 05:33:47,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 05:33:47,385 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 05:33:47,390 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 05:33:47,391 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 10 [2021-06-05 05:33:47,392 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 05:33:47,399 INFO L628 ElimStorePlain]: treesize reduction 12, result has 20.0 percent of original size [2021-06-05 05:33:47,399 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 05:33:47,400 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:3 [2021-06-05 05:33:47,416 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 05:33:47,416 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389263496] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:47,416 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 05:33:47,416 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 23 [2021-06-05 05:33:47,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358034213] [2021-06-05 05:33:47,417 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 05:33:47,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:33:47,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 05:33:47,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2021-06-05 05:33:47,418 INFO L87 Difference]: Start difference. First operand 20763 states and 89469 transitions. Second operand has 24 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 23 states have internal predecessors, (85), 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-06-05 05:33:48,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:33:48,905 INFO L93 Difference]: Finished difference Result 37037 states and 154685 transitions. [2021-06-05 05:33:48,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 05:33:48,905 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 23 states have internal predecessors, (85), 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 47 [2021-06-05 05:33:48,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:33:48,961 INFO L225 Difference]: With dead ends: 37037 [2021-06-05 05:33:48,962 INFO L226 Difference]: Without dead ends: 20247 [2021-06-05 05:33:48,963 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 853.8ms TimeCoverageRelationStatistics Valid=323, Invalid=1839, Unknown=0, NotChecked=0, Total=2162 [2021-06-05 05:33:48,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20247 states. [2021-06-05 05:33:49,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20247 to 20145. [2021-06-05 05:33:49,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20145 states, 20144 states have (on average 4.329527402700556) internal successors, (87214), 20144 states have internal predecessors, (87214), 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-06-05 05:33:49,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20145 states to 20145 states and 87214 transitions. [2021-06-05 05:33:49,586 INFO L78 Accepts]: Start accepts. Automaton has 20145 states and 87214 transitions. Word has length 47 [2021-06-05 05:33:49,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:33:49,587 INFO L482 AbstractCegarLoop]: Abstraction has 20145 states and 87214 transitions. [2021-06-05 05:33:49,587 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 23 states have internal predecessors, (85), 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-06-05 05:33:49,587 INFO L276 IsEmpty]: Start isEmpty. Operand 20145 states and 87214 transitions. [2021-06-05 05:33:49,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-06-05 05:33:49,621 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:33:49,621 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 05:33:49,821 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable73 [2021-06-05 05:33:49,822 INFO L430 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:33:49,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:33:49,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1052185102, now seen corresponding path program 23 times [2021-06-05 05:33:49,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:33:49,822 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803092894] [2021-06-05 05:33:49,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:33:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:33:50,592 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-06-05 05:33:50,592 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:33:50,592 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803092894] [2021-06-05 05:33:50,592 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803092894] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:33:50,592 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126858695] [2021-06-05 05:33:50,592 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 05:33:50,634 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2021-06-05 05:33:50,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 05:33:50,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 35 conjunts are in the unsatisfiable core [2021-06-05 05:33:50,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 05:33:50,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 7 [2021-06-05 05:33:50,686 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 05:33:50,690 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 05:33:50,690 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 05:33:50,690 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:10 [2021-06-05 05:33:51,970 WARN L205 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-06-05 05:33:52,628 WARN L205 SmtUtils]: Spent 364.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2021-06-05 05:33:53,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:33:53,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:33:53,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:33:53,353 INFO L354 Elim1Store]: treesize reduction 72, result has 32.7 percent of original size [2021-06-05 05:33:53,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 64 [2021-06-05 05:33:53,375 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 05:33:53,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:33:53,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:33:53,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:33:53,470 INFO L354 Elim1Store]: treesize reduction 72, result has 32.7 percent of original size [2021-06-05 05:33:53,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 35 treesize of output 64 [2021-06-05 05:33:53,477 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 05:33:53,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:33:53,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:33:53,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:33:53,602 INFO L354 Elim1Store]: treesize reduction 72, result has 32.7 percent of original size [2021-06-05 05:33:53,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 64 [2021-06-05 05:33:53,614 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 05:33:53,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:33:53,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:33:53,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:33:53,737 INFO L354 Elim1Store]: treesize reduction 72, result has 32.7 percent of original size [2021-06-05 05:33:53,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 64 [2021-06-05 05:33:53,749 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 05:33:53,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:33:53,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:33:53,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:33:53,856 INFO L354 Elim1Store]: treesize reduction 72, result has 32.7 percent of original size [2021-06-05 05:33:53,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 64 [2021-06-05 05:33:53,880 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 05:33:53,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:33:53,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:33:53,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:33:54,003 INFO L354 Elim1Store]: treesize reduction 72, result has 32.7 percent of original size [2021-06-05 05:33:54,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 33 treesize of output 64 [2021-06-05 05:33:54,011 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 05:33:54,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:33:54,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:33:54,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:33:54,129 INFO L354 Elim1Store]: treesize reduction 72, result has 32.7 percent of original size [2021-06-05 05:33:54,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 33 treesize of output 64 [2021-06-05 05:33:54,137 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 05:33:54,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:33:54,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:33:54,277 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 22 [2021-06-05 05:33:54,277 INFO L354 Elim1Store]: treesize reduction 72, result has 32.7 percent of original size [2021-06-05 05:33:54,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 35 treesize of output 64 [2021-06-05 05:33:54,284 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 05:33:55,423 WARN L205 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 293 DAG size of output: 249 [2021-06-05 05:33:55,424 INFO L628 ElimStorePlain]: treesize reduction 196, result has 81.3 percent of original size [2021-06-05 05:33:56,428 INFO L550 ElimStorePlain]: Start of recursive call 1: 25 dim-0 vars, 1 dim-1 vars, End of recursive call: 26 dim-0 vars, and 8 xjuncts. [2021-06-05 05:33:56,429 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 26 variables, input treesize:517, output treesize:997 [2021-06-05 05:33:58,485 WARN L205 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 351 [2021-06-05 05:34:00,748 WARN L205 SmtUtils]: Spent 691.00 ms on a formula simplification. DAG size of input: 265 DAG size of output: 202 [2021-06-05 05:34:00,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:00,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:00,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:00,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:00,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:00,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:00,887 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 05:34:00,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:00,897 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 05:34:00,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:00,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2021-06-05 05:34:00,902 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 05:34:00,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:00,911 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 05:34:00,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:00,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:00,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:00,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:00,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:00,917 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 05:34:00,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:00,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2021-06-05 05:34:00,927 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 05:34:00,937 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 05:34:00,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:00,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:00,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:00,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:00,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:00,941 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 05:34:00,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:00,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2021-06-05 05:34:00,952 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 05:34:00,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:00,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:00,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:00,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:00,964 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 05:34:00,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:00,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:00,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:00,971 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 05:34:00,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:00,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 39 [2021-06-05 05:34:00,978 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 05:34:00,989 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 05:34:00,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:00,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:00,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:00,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:00,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:00,994 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 05:34:00,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:01,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2021-06-05 05:34:01,003 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 05:34:01,012 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 05:34:01,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:01,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:01,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:01,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:01,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:01,017 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 05:34:01,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:01,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2021-06-05 05:34:01,030 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 05:34:01,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:01,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:01,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:01,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:01,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:01,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:01,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:01,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:01,045 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 05:34:01,054 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 05:34:01,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:01,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 39 [2021-06-05 05:34:01,059 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 05:34:01,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:01,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:01,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:01,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:01,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:01,075 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 05:34:01,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:01,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:01,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2021-06-05 05:34:01,079 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 05:34:01,436 WARN L205 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 179 [2021-06-05 05:34:01,437 INFO L628 ElimStorePlain]: treesize reduction 16, result has 96.7 percent of original size [2021-06-05 05:34:01,488 INFO L550 ElimStorePlain]: Start of recursive call 1: 25 dim-0 vars, 1 dim-1 vars, End of recursive call: 24 dim-0 vars, and 8 xjuncts. [2021-06-05 05:34:01,488 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 26 variables, input treesize:557, output treesize:423 [2021-06-05 05:34:03,626 WARN L205 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-06-05 05:34:04,228 WARN L205 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-06-05 05:34:05,477 WARN L205 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 369 DAG size of output: 191 [2021-06-05 05:34:07,146 WARN L205 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 198 DAG size of output: 188 [2021-06-05 05:34:08,744 INFO L446 ElimStorePlain]: Different costs {10=[v_prenex_82, v_prenex_86, v_prenex_77, v_prenex_88], 14=[A, v_prenex_80, v_prenex_75, v_prenex_84], 350=[v_prenex_114]} [2021-06-05 05:34:08,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:08,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:08,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:08,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:08,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:08,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:08,813 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 05:34:08,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 55 [2021-06-05 05:34:08,839 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 05:34:09,268 WARN L205 SmtUtils]: Spent 428.00 ms on a formula simplification that was a NOOP. DAG size: 386 [2021-06-05 05:34:09,268 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 05:34:09,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:09,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:09,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:09,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:09,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:09,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:09,322 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 05:34:09,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 55 [2021-06-05 05:34:09,364 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2021-06-05 05:34:10,230 WARN L205 SmtUtils]: Spent 865.00 ms on a formula simplification. DAG size of input: 383 DAG size of output: 378 [2021-06-05 05:34:10,231 INFO L628 ElimStorePlain]: treesize reduction 9, result has 99.0 percent of original size [2021-06-05 05:34:10,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:10,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:10,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:10,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:10,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:10,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:10,282 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 05:34:10,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 57 [2021-06-05 05:34:10,301 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2021-06-05 05:34:11,144 WARN L205 SmtUtils]: Spent 842.00 ms on a formula simplification. DAG size of input: 378 DAG size of output: 373 [2021-06-05 05:34:11,145 INFO L628 ElimStorePlain]: treesize reduction 22, result has 97.7 percent of original size [2021-06-05 05:34:11,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:11,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:11,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:11,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:11,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:11,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:11,197 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 05:34:11,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 55 [2021-06-05 05:34:11,236 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2021-06-05 05:34:12,034 WARN L205 SmtUtils]: Spent 797.00 ms on a formula simplification. DAG size of input: 370 DAG size of output: 367 [2021-06-05 05:34:12,035 INFO L628 ElimStorePlain]: treesize reduction 5, result has 99.4 percent of original size [2021-06-05 05:34:12,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:12,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:12,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:12,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:12,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:12,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:12,070 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 05:34:12,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:12,101 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 05:34:12,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 57 [2021-06-05 05:34:12,149 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2021-06-05 05:34:13,422 WARN L205 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 371 DAG size of output: 358 [2021-06-05 05:34:13,423 INFO L628 ElimStorePlain]: treesize reduction 51, result has 94.5 percent of original size [2021-06-05 05:34:13,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:13,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:13,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:13,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:13,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:13,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:13,446 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 05:34:13,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:13,476 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 05:34:13,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 37 treesize of output 55 [2021-06-05 05:34:13,512 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2021-06-05 05:34:14,298 WARN L205 SmtUtils]: Spent 785.00 ms on a formula simplification. DAG size of input: 353 DAG size of output: 347 [2021-06-05 05:34:14,298 INFO L628 ElimStorePlain]: treesize reduction 19, result has 97.8 percent of original size [2021-06-05 05:34:14,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:14,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:14,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:14,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:14,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:14,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:14,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:14,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:14,321 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 05:34:14,349 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 05:34:14,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 55 [2021-06-05 05:34:14,403 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2021-06-05 05:34:15,187 WARN L205 SmtUtils]: Spent 783.00 ms on a formula simplification. DAG size of input: 349 DAG size of output: 336 [2021-06-05 05:34:15,188 INFO L628 ElimStorePlain]: treesize reduction 41, result has 95.3 percent of original size [2021-06-05 05:34:15,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:15,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:15,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:15,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:15,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:15,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:15,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:15,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:15,210 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 05:34:15,236 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 05:34:15,237 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 55 [2021-06-05 05:34:15,259 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2021-06-05 05:34:15,990 WARN L205 SmtUtils]: Spent 730.00 ms on a formula simplification. DAG size of input: 336 DAG size of output: 326 [2021-06-05 05:34:15,990 INFO L628 ElimStorePlain]: treesize reduction 27, result has 96.7 percent of original size [2021-06-05 05:34:16,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,009 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 05:34:16,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,019 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 05:34:16,063 INFO L354 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2021-06-05 05:34:16,064 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 47 [2021-06-05 05:34:16,070 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 05:34:16,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,129 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 05:34:16,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 55 [2021-06-05 05:34:16,140 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 05:34:16,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,164 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 05:34:16,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 05:34:16,212 INFO L354 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2021-06-05 05:34:16,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 43 [2021-06-05 05:34:16,217 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 05:34:16,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,247 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 05:34:16,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,257 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 05:34:16,298 INFO L354 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2021-06-05 05:34:16,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 49 [2021-06-05 05:34:16,304 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 05:34:16,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,382 INFO L354 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2021-06-05 05:34:16,382 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 47 [2021-06-05 05:34:16,389 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 05:34:16,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,462 INFO L354 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2021-06-05 05:34:16,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 53 [2021-06-05 05:34:16,470 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 05:34:16,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,548 INFO L354 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2021-06-05 05:34:16,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 51 [2021-06-05 05:34:16,562 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 05:34:16,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,585 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 05:34:16,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 05:34:16,640 INFO L354 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2021-06-05 05:34:16,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 39 treesize of output 51 [2021-06-05 05:34:16,647 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 05:34:16,888 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-06-05 05:34:16,888 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 05:34:16,928 INFO L550 ElimStorePlain]: Start of recursive call 1: 57 dim-0 vars, 9 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-06-05 05:34:16,929 INFO L247 ElimStorePlain]: Needed 17 recursive calls to eliminate 66 variables, input treesize:973, output treesize:12 [2021-06-05 05:34:16,943 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 05:34:16,943 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126858695] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 05:34:16,943 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 05:34:16,943 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 27 [2021-06-05 05:34:16,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35321910] [2021-06-05 05:34:16,943 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 05:34:16,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:34:16,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 05:34:16,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=633, Unknown=1, NotChecked=0, Total=756 [2021-06-05 05:34:16,944 INFO L87 Difference]: Start difference. First operand 20145 states and 87214 transitions. Second operand has 28 states, 28 states have (on average 2.642857142857143) internal successors, (74), 27 states have internal predecessors, (74), 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-06-05 05:34:43,273 WARN L205 SmtUtils]: Spent 7.03 s on a formula simplification. DAG size of input: 212 DAG size of output: 204 [2021-06-05 05:34:43,614 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2021-06-05 05:35:05,363 WARN L205 SmtUtils]: Spent 774.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 99 [2021-06-05 05:35:08,559 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2021-06-05 05:35:46,224 WARN L205 SmtUtils]: Spent 36.54 s on a formula simplification. DAG size of input: 394 DAG size of output: 386 [2021-06-05 05:35:53,538 WARN L205 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 189 DAG size of output: 181 [2021-06-05 05:35:54,926 WARN L205 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 100 DAG size of output: 100 [2021-06-05 05:35:56,118 WARN L205 SmtUtils]: Spent 753.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 183 [2021-06-05 05:35:58,464 WARN L205 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 354 DAG size of output: 346 [2021-06-05 05:36:06,105 WARN L205 SmtUtils]: Spent 5.56 s on a formula simplification. DAG size of input: 214 DAG size of output: 206 [2021-06-05 05:36:16,327 WARN L205 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 184 [2021-06-05 05:36:20,606 WARN L205 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 355 DAG size of output: 347 [2021-06-05 05:36:29,560 WARN L205 SmtUtils]: Spent 5.99 s on a formula simplification. DAG size of input: 215 DAG size of output: 207 [2021-06-05 05:36:32,969 WARN L227 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2021-06-05 05:36:33,185 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 05:36:33,186 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:155) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:128) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:662) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:281) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:93) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:162) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:201) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:877) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:774) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:474) 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:374) 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) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:152) ... 34 more [2021-06-05 05:36:33,188 INFO L168 Benchmark]: Toolchain (without parser) took 198775.48 ms. Allocated memory was 360.7 MB in the beginning and 10.7 GB in the end (delta: 10.3 GB). Free memory was 339.8 MB in the beginning and 9.6 GB in the end (delta: -9.3 GB). Peak memory consumption was 1.1 GB. Max. memory is 16.0 GB. [2021-06-05 05:36:33,188 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.14 ms. Allocated memory is still 360.7 MB. Free memory was 341.0 MB in the beginning and 340.9 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 05:36:33,189 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.42 ms. Allocated memory is still 360.7 MB. Free memory was 339.7 MB in the beginning and 338.2 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 05:36:33,189 INFO L168 Benchmark]: Boogie Preprocessor took 12.55 ms. Allocated memory is still 360.7 MB. Free memory was 338.2 MB in the beginning and 337.3 MB in the end (delta: 966.9 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 05:36:33,189 INFO L168 Benchmark]: RCFGBuilder took 332.69 ms. Allocated memory is still 360.7 MB. Free memory was 337.2 MB in the beginning and 323.4 MB in the end (delta: 13.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. [2021-06-05 05:36:33,189 INFO L168 Benchmark]: TraceAbstraction took 198400.15 ms. Allocated memory was 360.7 MB in the beginning and 10.7 GB in the end (delta: 10.3 GB). Free memory was 322.9 MB in the beginning and 9.6 GB in the end (delta: -9.3 GB). Peak memory consumption was 1.0 GB. Max. memory is 16.0 GB. [2021-06-05 05:36:33,189 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.14 ms. Allocated memory is still 360.7 MB. Free memory was 341.0 MB in the beginning and 340.9 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 24.42 ms. Allocated memory is still 360.7 MB. Free memory was 339.7 MB in the beginning and 338.2 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Preprocessor took 12.55 ms. Allocated memory is still 360.7 MB. Free memory was 338.2 MB in the beginning and 337.3 MB in the end (delta: 966.9 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 332.69 ms. Allocated memory is still 360.7 MB. Free memory was 337.2 MB in the beginning and 323.4 MB in the end (delta: 13.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 198400.15 ms. Allocated memory was 360.7 MB in the beginning and 10.7 GB in the end (delta: 10.3 GB). Free memory was 322.9 MB in the beginning and 9.6 GB in the end (delta: -9.3 GB). Peak memory consumption was 1.0 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:155) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...