/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-Sleep-SemanticLbe-Delay.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-13 01:08:34,500 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-13 01:08:34,502 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-13 01:08:34,529 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-13 01:08:34,529 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-13 01:08:34,531 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-13 01:08:34,532 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-13 01:08:34,534 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-13 01:08:34,535 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-13 01:08:34,536 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-13 01:08:34,561 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-13 01:08:34,562 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-13 01:08:34,562 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-13 01:08:34,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-13 01:08:34,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-13 01:08:34,565 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-13 01:08:34,566 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-13 01:08:34,567 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-13 01:08:34,568 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-13 01:08:34,570 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-13 01:08:34,571 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-13 01:08:34,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-13 01:08:34,574 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-13 01:08:34,575 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-13 01:08:34,578 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-13 01:08:34,578 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-13 01:08:34,579 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-13 01:08:34,580 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-13 01:08:34,580 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-13 01:08:34,582 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-13 01:08:34,583 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-13 01:08:34,588 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-13 01:08:34,589 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-13 01:08:34,592 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-13 01:08:34,593 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-13 01:08:34,593 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-13 01:08:34,594 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-13 01:08:34,594 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-13 01:08:34,594 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-13 01:08:34,596 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-13 01:08:34,597 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-13 01:08:34,600 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-Sleep-SemanticLbe-Delay.epf [2021-03-13 01:08:34,640 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-13 01:08:34,640 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-13 01:08:34,641 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-03-13 01:08:34,641 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-03-13 01:08:34,642 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-13 01:08:34,642 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-13 01:08:34,642 INFO L138 SettingsManager]: * Use SBE=true [2021-03-13 01:08:34,642 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-13 01:08:34,643 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-13 01:08:34,643 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-13 01:08:34,643 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-13 01:08:34,643 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-13 01:08:34,643 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-13 01:08:34,643 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-13 01:08:34,643 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-13 01:08:34,643 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-13 01:08:34,644 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-13 01:08:34,644 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-13 01:08:34,644 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-13 01:08:34,644 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-13 01:08:34,644 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-13 01:08:34,644 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-13 01:08:34,644 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-13 01:08:34,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-13 01:08:34,645 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-13 01:08:34,645 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-13 01:08:34,645 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-13 01:08:34,645 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-13 01:08:34,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-13 01:08:34,645 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2021-03-13 01:08:34,646 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-03-13 01:08:34,646 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_DELAY_SET [2021-03-13 01:08:34,646 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-03-13 01:08:34,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-13 01:08:34,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-13 01:08:34,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-13 01:08:34,955 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-03-13 01:08:34,956 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-03-13 01:08:34,957 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl [2021-03-13 01:08:34,957 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl' [2021-03-13 01:08:35,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-13 01:08:35,094 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-03-13 01:08:35,095 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-13 01:08:35,095 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-13 01:08:35,095 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-13 01:08:35,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.03 01:08:35" (1/1) ... [2021-03-13 01:08:35,113 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.03 01:08:35" (1/1) ... [2021-03-13 01:08:35,119 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-13 01:08:35,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-13 01:08:35,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-13 01:08:35,121 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-13 01:08:35,126 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.03 01:08:35" (1/1) ... [2021-03-13 01:08:35,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.03 01:08:35" (1/1) ... [2021-03-13 01:08:35,127 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.03 01:08:35" (1/1) ... [2021-03-13 01:08:35,127 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.03 01:08:35" (1/1) ... [2021-03-13 01:08:35,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.03 01:08:35" (1/1) ... [2021-03-13 01:08:35,136 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.03 01:08:35" (1/1) ... [2021-03-13 01:08:35,137 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.03 01:08:35" (1/1) ... [2021-03-13 01:08:35,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-13 01:08:35,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-13 01:08:35,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-13 01:08:35,138 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-13 01:08:35,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.03 01:08:35" (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-03-13 01:08:35,212 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-03-13 01:08:35,212 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-03-13 01:08:35,212 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-03-13 01:08:35,213 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-03-13 01:08:35,213 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-03-13 01:08:35,213 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-03-13 01:08:35,213 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-03-13 01:08:35,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-13 01:08:35,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-13 01:08:35,213 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-03-13 01:08:35,213 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-03-13 01:08:35,213 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-03-13 01:08:35,213 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2021-03-13 01:08:35,213 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-03-13 01:08:35,214 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-03-13 01:08:35,214 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2021-03-13 01:08:35,214 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2021-03-13 01:08:35,214 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2021-03-13 01:08:35,214 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2021-03-13 01:08:35,214 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2021-03-13 01:08:35,214 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2021-03-13 01:08:35,215 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-13 01:08:35,412 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-13 01:08:35,412 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-03-13 01:08:35,414 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.03 01:08:35 BoogieIcfgContainer [2021-03-13 01:08:35,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-13 01:08:35,415 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-13 01:08:35,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-13 01:08:35,417 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-13 01:08:35,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.03 01:08:35" (1/2) ... [2021-03-13 01:08:35,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f3ccbfd and model type barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 01:08:35, skipping insertion in model container [2021-03-13 01:08:35,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.03 01:08:35" (2/2) ... [2021-03-13 01:08:35,420 INFO L111 eAbstractionObserver]: Analyzing ICFG barrier-loop.wvr.bpl [2021-03-13 01:08:35,424 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-03-13 01:08:35,425 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-13 01:08:35,428 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-13 01:08:35,428 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-13 01:08:35,529 INFO L149 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2021-03-13 01:08:35,550 INFO L253 AbstractCegarLoop]: Starting to check reachability of 11 error locations. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-03-13 01:08:35,596 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-13 01:08:35,597 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-13 01:08:35,597 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-13 01:08:35,597 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-13 01:08:35,597 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-13 01:08:35,597 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-13 01:08:35,597 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-13 01:08:35,597 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-13 01:08:35,607 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-13 01:08:35,607 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 73 transitions, 218 flow [2021-03-13 01:08:35,609 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 73 transitions, 218 flow [2021-03-13 01:08:35,610 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 73 transitions, 218 flow [2021-03-13 01:08:35,640 INFO L129 PetriNetUnfolder]: 8/61 cut-off events. [2021-03-13 01:08:35,641 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-03-13 01:08:35,645 INFO L84 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 61 events. 8/61 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 190 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 71. Up to 3 conditions per place. [2021-03-13 01:08:35,648 INFO L116 LiptonReduction]: Number of co-enabled transitions 1888 [2021-03-13 01:08:35,880 INFO L131 LiptonReduction]: Checked pairs total: 8304 [2021-03-13 01:08:35,880 INFO L133 LiptonReduction]: Total number of compositions: 3 [2021-03-13 01:08:36,318 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thread1Err3INUSE_VIOLATION, thread4Err0INUSE_VIOLATION, thread4Thread1of1ForFork3Err8INUSE_VIOLATION, thread4Thread1of1ForFork3Err9INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, thread1Thread1of1ForFork2Err1INUSE_VIOLATION, thread4Err4INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, thread1Thread1of1ForFork2Err2INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-13 01:08:36,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-13 01:08:36,322 INFO L82 PathProgramCache]: Analyzing trace with hash 2058702418, now seen corresponding path program 1 times [2021-03-13 01:08:36,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-13 01:08:36,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455990607] [2021-03-13 01:08:36,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-13 01:08:36,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-13 01:08:36,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-03-13 01:08:36,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455990607] [2021-03-13 01:08:36,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-13 01:08:36,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-13 01:08:36,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296238447] [2021-03-13 01:08:36,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-13 01:08:36,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-13 01:08:36,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-13 01:08:36,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-13 01:08:36,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-03-13 01:08:36,478 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-03-13 01:08:36,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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-03-13 01:08:36,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-03-13 01:08:36,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:36,779 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-13 01:08:36,780 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thread1Err3INUSE_VIOLATION, thread4Err0INUSE_VIOLATION, thread4Thread1of1ForFork3Err8INUSE_VIOLATION, thread4Thread1of1ForFork3Err9INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, thread1Thread1of1ForFork2Err1INUSE_VIOLATION, thread4Err4INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, thread1Thread1of1ForFork2Err2INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-13 01:08:36,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-13 01:08:36,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1241925166, now seen corresponding path program 2 times [2021-03-13 01:08:36,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-13 01:08:36,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758831654] [2021-03-13 01:08:36,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-13 01:08:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-13 01:08:36,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-03-13 01:08:36,813 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758831654] [2021-03-13 01:08:36,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-13 01:08:36,814 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-13 01:08:36,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336172390] [2021-03-13 01:08:36,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-13 01:08:36,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-13 01:08:36,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-13 01:08:36,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-13 01:08:36,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-03-13 01:08:36,816 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-03-13 01:08:36,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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-03-13 01:08:36,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:36,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-03-13 01:08:36,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:36,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:36,933 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-13 01:08:36,933 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thread1Err3INUSE_VIOLATION, thread4Err0INUSE_VIOLATION, thread4Thread1of1ForFork3Err8INUSE_VIOLATION, thread4Thread1of1ForFork3Err9INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, thread1Thread1of1ForFork2Err1INUSE_VIOLATION, thread4Err4INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, thread1Thread1of1ForFork2Err2INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-13 01:08:36,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-13 01:08:36,934 INFO L82 PathProgramCache]: Analyzing trace with hash -609362478, now seen corresponding path program 3 times [2021-03-13 01:08:36,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-13 01:08:36,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109776164] [2021-03-13 01:08:36,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-13 01:08:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-13 01:08:36,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-03-13 01:08:36,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109776164] [2021-03-13 01:08:36,983 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-13 01:08:36,983 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-13 01:08:36,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450463697] [2021-03-13 01:08:36,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-13 01:08:36,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-13 01:08:36,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-13 01:08:36,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-13 01:08:36,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-03-13 01:08:36,987 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-03-13 01:08:36,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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-03-13 01:08:36,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:36,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:36,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-03-13 01:08:37,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:37,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:37,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:37,179 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-13 01:08:37,179 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thread1Err3INUSE_VIOLATION, thread4Err0INUSE_VIOLATION, thread4Thread1of1ForFork3Err8INUSE_VIOLATION, thread4Thread1of1ForFork3Err9INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, thread1Thread1of1ForFork2Err1INUSE_VIOLATION, thread4Err4INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, thread1Thread1of1ForFork2Err2INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-13 01:08:37,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-13 01:08:37,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1381067642, now seen corresponding path program 4 times [2021-03-13 01:08:37,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-13 01:08:37,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776152207] [2021-03-13 01:08:37,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-13 01:08:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-13 01:08:37,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-03-13 01:08:37,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776152207] [2021-03-13 01:08:37,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-13 01:08:37,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-13 01:08:37,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606640788] [2021-03-13 01:08:37,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-13 01:08:37,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-13 01:08:37,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-13 01:08:37,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-13 01:08:37,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-03-13 01:08:37,244 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-03-13 01:08:37,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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-03-13 01:08:37,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:37,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:37,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:37,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-03-13 01:08:37,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:37,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:37,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:37,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:37,414 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-13 01:08:37,414 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thread1Err3INUSE_VIOLATION, thread4Err0INUSE_VIOLATION, thread4Thread1of1ForFork3Err8INUSE_VIOLATION, thread4Thread1of1ForFork3Err9INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, thread1Thread1of1ForFork2Err1INUSE_VIOLATION, thread4Err4INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, thread1Thread1of1ForFork2Err2INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-13 01:08:37,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-13 01:08:37,415 INFO L82 PathProgramCache]: Analyzing trace with hash 468249094, now seen corresponding path program 5 times [2021-03-13 01:08:37,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-13 01:08:37,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484806794] [2021-03-13 01:08:37,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-13 01:08:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-13 01:08:37,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-03-13 01:08:37,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484806794] [2021-03-13 01:08:37,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-13 01:08:37,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-13 01:08:37,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987119207] [2021-03-13 01:08:37,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-13 01:08:37,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-13 01:08:37,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-13 01:08:37,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-13 01:08:37,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-03-13 01:08:37,475 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-03-13 01:08:37,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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-03-13 01:08:37,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:37,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:37,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:37,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:37,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-03-13 01:08:37,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:37,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:37,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:37,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:37,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:37,589 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-13 01:08:37,589 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thread1Err3INUSE_VIOLATION, thread4Err0INUSE_VIOLATION, thread4Thread1of1ForFork3Err8INUSE_VIOLATION, thread4Thread1of1ForFork3Err9INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, thread1Thread1of1ForFork2Err1INUSE_VIOLATION, thread4Err4INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, thread1Thread1of1ForFork2Err2INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-13 01:08:37,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-13 01:08:37,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1575547386, now seen corresponding path program 6 times [2021-03-13 01:08:37,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-13 01:08:37,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317240407] [2021-03-13 01:08:37,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-13 01:08:37,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-13 01:08:37,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-03-13 01:08:37,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317240407] [2021-03-13 01:08:37,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-13 01:08:37,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-13 01:08:37,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390189359] [2021-03-13 01:08:37,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-13 01:08:37,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-13 01:08:37,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-13 01:08:37,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-13 01:08:37,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-03-13 01:08:37,638 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-03-13 01:08:37,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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-03-13 01:08:37,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:37,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:37,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:37,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:37,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:37,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-03-13 01:08:37,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:37,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:37,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:37,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:37,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:37,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:37,745 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-13 01:08:37,745 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thread1Err3INUSE_VIOLATION, thread4Err0INUSE_VIOLATION, thread4Thread1of1ForFork3Err8INUSE_VIOLATION, thread4Thread1of1ForFork3Err9INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, thread1Thread1of1ForFork2Err1INUSE_VIOLATION, thread4Err4INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, thread1Thread1of1ForFork2Err2INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-13 01:08:37,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-13 01:08:37,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1502029498, now seen corresponding path program 7 times [2021-03-13 01:08:37,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-13 01:08:37,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539645360] [2021-03-13 01:08:37,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-13 01:08:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-13 01:08:38,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-13 01:08:38,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539645360] [2021-03-13 01:08:38,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838699211] [2021-03-13 01:08:38,288 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 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-03-13 01:08:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-13 01:08:38,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 37 conjunts are in the unsatisfiable core [2021-03-13 01:08:38,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-13 01:08:38,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-13 01:08:38,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-13 01:08:38,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2021-03-13 01:08:38,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983051926] [2021-03-13 01:08:38,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-13 01:08:38,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-13 01:08:38,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-13 01:08:38,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2021-03-13 01:08:38,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-03-13 01:08:38,638 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-03-13 01:08:38,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 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-03-13 01:08:38,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:38,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:38,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:38,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:38,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:38,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:38,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-03-13 01:08:39,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:39,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:39,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:39,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:39,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:39,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-13 01:08:39,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-13 01:08:39,493 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-13 01:08:39,493 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thread1Err3INUSE_VIOLATION, thread4Err0INUSE_VIOLATION, thread4Thread1of1ForFork3Err8INUSE_VIOLATION, thread4Thread1of1ForFork3Err9INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, thread1Thread1of1ForFork2Err1INUSE_VIOLATION, thread4Err4INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, thread1Thread1of1ForFork2Err2INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-13 01:08:39,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-13 01:08:39,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1259592612, now seen corresponding path program 8 times [2021-03-13 01:08:39,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-13 01:08:39,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611786690] [2021-03-13 01:08:39,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-13 01:08:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-13 01:08:39,510 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-13 01:08:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-13 01:08:39,523 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-13 01:08:39,541 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-13 01:08:39,541 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-13 01:08:39,542 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-13 01:08:39,603 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 01:08:39 BasicIcfg [2021-03-13 01:08:39,604 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-13 01:08:39,604 INFO L168 Benchmark]: Toolchain (without parser) took 4522.20 ms. Allocated memory was 255.9 MB in the beginning and 438.3 MB in the end (delta: 182.5 MB). Free memory was 236.3 MB in the beginning and 270.4 MB in the end (delta: -34.1 MB). Peak memory consumption was 149.0 MB. Max. memory is 16.0 GB. [2021-03-13 01:08:39,605 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.12 ms. Allocated memory is still 255.9 MB. Free memory was 237.5 MB in the beginning and 237.4 MB in the end (delta: 84.0 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-13 01:08:39,605 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.79 ms. Allocated memory is still 255.9 MB. Free memory was 235.7 MB in the beginning and 234.3 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-13 01:08:39,605 INFO L168 Benchmark]: Boogie Preprocessor took 17.01 ms. Allocated memory is still 255.9 MB. Free memory was 234.3 MB in the beginning and 233.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-13 01:08:39,605 INFO L168 Benchmark]: RCFGBuilder took 275.65 ms. Allocated memory is still 255.9 MB. Free memory was 233.1 MB in the beginning and 232.4 MB in the end (delta: 743.7 kB). Peak memory consumption was 17.8 MB. Max. memory is 16.0 GB. [2021-03-13 01:08:39,605 INFO L168 Benchmark]: TraceAbstraction took 4188.70 ms. Allocated memory was 255.9 MB in the beginning and 438.3 MB in the end (delta: 182.5 MB). Free memory was 231.9 MB in the beginning and 270.4 MB in the end (delta: -38.5 MB). Peak memory consumption was 143.8 MB. Max. memory is 16.0 GB. [2021-03-13 01:08:39,606 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.12 ms. Allocated memory is still 255.9 MB. Free memory was 237.5 MB in the beginning and 237.4 MB in the end (delta: 84.0 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 24.79 ms. Allocated memory is still 255.9 MB. Free memory was 235.7 MB in the beginning and 234.3 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Preprocessor took 17.01 ms. Allocated memory is still 255.9 MB. Free memory was 234.3 MB in the beginning and 233.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 275.65 ms. Allocated memory is still 255.9 MB. Free memory was 233.1 MB in the beginning and 232.4 MB in the end (delta: 743.7 kB). Peak memory consumption was 17.8 MB. Max. memory is 16.0 GB. * TraceAbstraction took 4188.70 ms. Allocated memory was 255.9 MB in the beginning and 438.3 MB in the end (delta: 182.5 MB). Free memory was 231.9 MB in the beginning and 270.4 MB in the end (delta: -38.5 MB). Peak memory consumption was 143.8 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 271.2ms, 84 PlacesBefore, 82 PlacesAfterwards, 73 TransitionsBefore, 71 TransitionsAfterwards, 1888 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 8304 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5523, positive: 5355, positive conditional: 0, positive unconditional: 5355, negative: 168, negative conditional: 0, negative unconditional: 168, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1314, positive: 1282, positive conditional: 0, positive unconditional: 1282, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1314, positive: 1270, positive conditional: 0, positive unconditional: 1270, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 44, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 130, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 107, negative conditional: 0, negative unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5523, positive: 4073, positive conditional: 0, positive unconditional: 4073, negative: 136, negative conditional: 0, negative unconditional: 136, unknown: 1314, unknown conditional: 0, unknown unconditional: 1314] , Statistics on independence cache: Total cache size (in pairs): 1314, Positive cache size: 1282, Positive conditional cache size: 0, Positive unconditional cache size: 1282, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 82629, positive: 73968, positive conditional: 73968, positive unconditional: 0, negative: 8661, negative conditional: 8661, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 75294, positive: 73968, positive conditional: 73968, positive unconditional: 0, negative: 1326, negative conditional: 1326, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 75294, positive: 73918, positive conditional: 0, positive unconditional: 73918, negative: 1376, negative conditional: 0, negative unconditional: 1376, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 711, positive: 695, positive conditional: 0, positive unconditional: 695, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 711, positive: 687, positive conditional: 0, positive unconditional: 687, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 32, positive: 10, positive conditional: 2, positive unconditional: 8, negative: 22, negative conditional: 6, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 121, positive: 51, positive conditional: 7, positive unconditional: 44, negative: 70, negative conditional: 13, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 75294, positive: 73223, positive conditional: 0, positive unconditional: 73223, negative: 1360, negative conditional: 0, negative unconditional: 1360, unknown: 711, unknown conditional: 0, unknown unconditional: 711] , Statistics on independence cache: Total cache size (in pairs): 719, Positive cache size: 697, Positive conditional cache size: 2, Positive unconditional cache size: 695, Negative cache size: 22, Negative conditional cache size: 6, Negative unconditional cache size: 16, SemanticConditionEliminator.Independence Queries: [ total: 5226, positive: 50, positive conditional: 50, positive unconditional: 0, negative: 5176, negative conditional: 254, negative unconditional: 4922, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5226, positive: 50, positive conditional: 50, positive unconditional: 0, negative: 5176, negative conditional: 254, negative unconditional: 4922, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 32, positive: 10, positive conditional: 2, positive unconditional: 8, negative: 22, negative conditional: 6, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 121, positive: 51, positive conditional: 7, positive unconditional: 44, negative: 70, negative conditional: 13, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5226, positive: 48, positive conditional: 48, positive unconditional: 0, negative: 5170, negative conditional: 248, negative unconditional: 4922, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 719, Positive cache size: 697, Positive conditional cache size: 2, Positive unconditional cache size: 695, Negative cache size: 22, Negative conditional cache size: 6, Negative unconditional cache size: 16, Eliminated conditions: 4922, SemanticConditionEliminator.Independence Queries: [ total: 5226, positive: 50, positive conditional: 50, positive unconditional: 0, negative: 5176, negative conditional: 254, negative unconditional: 4922, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5226, positive: 50, positive conditional: 50, positive unconditional: 0, negative: 5176, negative conditional: 254, negative unconditional: 4922, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 32, positive: 10, positive conditional: 2, positive unconditional: 8, negative: 22, negative conditional: 6, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 121, positive: 51, positive conditional: 7, positive unconditional: 44, negative: 70, negative conditional: 13, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5226, positive: 48, positive conditional: 48, positive unconditional: 0, negative: 5170, negative conditional: 248, negative unconditional: 4922, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 719, Positive cache size: 697, Positive conditional cache size: 2, Positive unconditional cache size: 695, Negative cache size: 22, Negative conditional cache size: 6, Negative unconditional cache size: 16, Eliminated conditions: 4922, SemanticConditionEliminator.Independence Queries: [ total: 5226, positive: 50, positive conditional: 50, positive unconditional: 0, negative: 5176, negative conditional: 254, negative unconditional: 4922, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5226, positive: 50, positive conditional: 50, positive unconditional: 0, negative: 5176, negative conditional: 254, negative unconditional: 4922, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 32, positive: 10, positive conditional: 2, positive unconditional: 8, negative: 22, negative conditional: 6, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 121, positive: 51, positive conditional: 7, positive unconditional: 44, negative: 70, negative conditional: 13, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5226, positive: 48, positive conditional: 48, positive unconditional: 0, negative: 5170, negative conditional: 248, negative unconditional: 4922, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 719, Positive cache size: 697, Positive conditional cache size: 2, Positive unconditional cache size: 695, Negative cache size: 22, Negative conditional cache size: 6, Negative unconditional cache size: 16, Eliminated conditions: 4922, SemanticConditionEliminator.Independence Queries: [ total: 5226, positive: 50, positive conditional: 50, positive unconditional: 0, negative: 5176, negative conditional: 254, negative unconditional: 4922, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5226, positive: 50, positive conditional: 50, positive unconditional: 0, negative: 5176, negative conditional: 254, negative unconditional: 4922, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 32, positive: 10, positive conditional: 2, positive unconditional: 8, negative: 22, negative conditional: 6, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 121, positive: 51, positive conditional: 7, positive unconditional: 44, negative: 70, negative conditional: 13, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5226, positive: 48, positive conditional: 48, positive unconditional: 0, negative: 5170, negative conditional: 248, negative unconditional: 4922, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 719, Positive cache size: 697, Positive conditional cache size: 2, Positive unconditional cache size: 695, Negative cache size: 22, Negative conditional cache size: 6, Negative unconditional cache size: 16, Eliminated conditions: 4922, SemanticConditionEliminator.Independence Queries: [ total: 5226, positive: 50, positive conditional: 50, positive unconditional: 0, negative: 5176, negative conditional: 254, negative unconditional: 4922, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5226, positive: 50, positive conditional: 50, positive unconditional: 0, negative: 5176, negative conditional: 254, negative unconditional: 4922, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 32, positive: 10, positive conditional: 2, positive unconditional: 8, negative: 22, negative conditional: 6, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 121, positive: 51, positive conditional: 7, positive unconditional: 44, negative: 70, negative conditional: 13, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5226, positive: 48, positive conditional: 48, positive unconditional: 0, negative: 5170, negative conditional: 248, negative unconditional: 4922, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 719, Positive cache size: 697, Positive conditional cache size: 2, Positive unconditional cache size: 695, Negative cache size: 22, Negative conditional cache size: 6, Negative unconditional cache size: 16, Eliminated conditions: 4922, SemanticConditionEliminator.Independence Queries: [ total: 5226, positive: 50, positive conditional: 50, positive unconditional: 0, negative: 5176, negative conditional: 254, negative unconditional: 4922, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5226, positive: 50, positive conditional: 50, positive unconditional: 0, negative: 5176, negative conditional: 254, negative unconditional: 4922, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 32, positive: 10, positive conditional: 2, positive unconditional: 8, negative: 22, negative conditional: 6, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 121, positive: 51, positive conditional: 7, positive unconditional: 44, negative: 70, negative conditional: 13, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5226, positive: 48, positive conditional: 48, positive unconditional: 0, negative: 5170, negative conditional: 248, negative unconditional: 4922, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 719, Positive cache size: 697, Positive conditional cache size: 2, Positive unconditional cache size: 695, Negative cache size: 22, Negative conditional cache size: 6, Negative unconditional cache size: 16, Eliminated conditions: 4922, SemanticConditionEliminator.Independence Queries: [ total: 5226, positive: 50, positive conditional: 50, positive unconditional: 0, negative: 5176, negative conditional: 254, negative unconditional: 4922, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5226, positive: 50, positive conditional: 50, positive unconditional: 0, negative: 5176, negative conditional: 254, negative unconditional: 4922, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 32, positive: 10, positive conditional: 2, positive unconditional: 8, negative: 22, negative conditional: 6, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 121, positive: 51, positive conditional: 7, positive unconditional: 44, negative: 70, negative conditional: 13, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5226, positive: 48, positive conditional: 48, positive unconditional: 0, negative: 5170, negative conditional: 248, negative unconditional: 4922, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 719, Positive cache size: 697, Positive conditional cache size: 2, Positive unconditional cache size: 695, Negative cache size: 22, Negative conditional cache size: 6, Negative unconditional cache size: 16, Eliminated conditions: 4922 ], Maximal queried relation: 7, Independence queries for same thread: 7335 - CounterExampleResult [Line: 121]: assertion can be violated assertion can be violated We found a FailurePath: [L115] 0 assume x_0 == x_8 && y_1 == y_9; VAL [x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L116] FORK 0 fork 1 thread1(); VAL [x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L60] 1 f1_2 := false; [L61] 1 f2_3 := false; VAL [f1_2=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L117] FORK 0 fork 4, 4, 4, 4 thread4(); VAL [f1_2=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L103] 2 f1_10 := false; [L104] 2 f2_11 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L63] FORK 1 fork 2, 2 thread2(); VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L30] 3 temp_4 := x_0; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L31] 3 x_0 := temp_4 + 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, x_0=0, x_8=-1, y_1=-1, y_9=-1] [L32] 3 f1_2 := true; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=-1, x_0=0, x_8=-1, y_1=-1, y_9=-1] [L64] FORK 1 fork 3, 3, 3 thread3(); VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=-1, x_0=0, x_8=-1, y_1=-1, y_9=-1] [L45] 4 temp_6 := y_1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=-1, y_9=-1] [L46] 4 y_1 := temp_6 + 1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=0, y_9=-1] [L47] 4 f2_3 := true; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=0, y_9=-1] [L33] 3 assume f2_3; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=0, y_9=-1] [L34] 3 temp_5 := y_1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=-1, temp_5=0, temp_6=-1, x_0=0, x_8=-1, y_1=0, y_9=-1] [L35] 3 y_1 := temp_5 + 1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=-1, temp_5=0, temp_6=-1, x_0=0, x_8=-1, y_1=1, y_9=-1] [L48] 4 assume f1_2; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=-1, temp_5=0, temp_6=-1, x_0=0, x_8=-1, y_1=1, y_9=-1] [L36] 3 f1_2 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=true, temp_4=-1, temp_5=0, temp_6=-1, x_0=0, x_8=-1, y_1=1, y_9=-1] [L49] 4 temp_7 := x_0; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=true, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=0, x_8=-1, y_1=1, y_9=-1] [L50] 4 x_0 := temp_7 + 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=true, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L51] 4 f2_3 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L37] 3 assume !f2_3; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L30] 3 temp_4 := x_0; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L31] 3 x_0 := temp_4 + 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=1, temp_5=0, temp_6=-1, temp_7=0, x_0=2, x_8=-1, y_1=1, y_9=-1] [L52] 4 assume !f1_2; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=1, temp_5=0, temp_6=-1, temp_7=0, x_0=2, x_8=-1, y_1=1, y_9=-1] [L32] 3 f1_2 := true; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=1, temp_5=0, temp_6=-1, temp_7=0, x_0=2, x_8=-1, y_1=1, y_9=-1] [L45] 4 temp_6 := y_1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=1, temp_5=0, temp_6=1, temp_7=0, x_0=2, x_8=-1, y_1=1, y_9=-1] [L46] 4 y_1 := temp_6 + 1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=1, temp_5=0, temp_6=1, temp_7=0, x_0=2, x_8=-1, y_1=2, y_9=-1] [L47] 4 f2_3 := true; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=1, temp_5=0, temp_6=1, temp_7=0, x_0=2, x_8=-1, y_1=2, y_9=-1] [L33] 3 assume f2_3; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=1, temp_5=0, temp_6=1, temp_7=0, x_0=2, x_8=-1, y_1=2, y_9=-1] [L34] 3 temp_5 := y_1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=1, temp_5=2, temp_6=1, temp_7=0, x_0=2, x_8=-1, y_1=2, y_9=-1] [L35] 3 y_1 := temp_5 + 1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=1, temp_5=2, temp_6=1, temp_7=0, x_0=2, x_8=-1, y_1=3, y_9=-1] [L48] 4 assume f1_2; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=1, temp_5=2, temp_6=1, temp_7=0, x_0=2, x_8=-1, y_1=3, y_9=-1] [L36] 3 f1_2 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=true, temp_4=1, temp_5=2, temp_6=1, temp_7=0, x_0=2, x_8=-1, y_1=3, y_9=-1] [L49] 4 temp_7 := x_0; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=true, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=2, x_8=-1, y_1=3, y_9=-1] [L50] 4 x_0 := temp_7 + 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=true, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=-1, y_1=3, y_9=-1] [L51] 4 f2_3 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=-1, y_1=3, y_9=-1] [L37] 3 assume !f2_3; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=-1, y_1=3, y_9=-1] [L52] 4 assume !f1_2; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=-1, y_1=3, y_9=-1] [L106] FORK 2 fork 5, 5, 5, 5, 5 thread5(); VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=-1, y_1=3, y_9=-1] [L73] 5 temp_12 := x_8; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=-1, y_1=3, y_9=-1] [L74] 5 x_8 := temp_12 + 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=0, y_1=3, y_9=-1] [L75] 5 f1_10 := true; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=0, y_1=3, y_9=-1] [L107] FORK 2 fork 6, 6, 6, 6, 6, 6 thread6(); VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=0, y_1=3, y_9=-1] [L88] 6 temp_14 := y_9; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_14=-1, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=0, y_1=3, y_9=-1] [L89] 6 y_9 := temp_14 + 1; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_14=-1, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=0, y_1=3, y_9=0] [L90] 6 f2_11 := true; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_14=-1, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=0, y_1=3, y_9=0] [L76] 5 assume f2_11; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_14=-1, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=0, y_1=3, y_9=0] [L77] 5 temp_13 := y_9; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=0, y_1=3, y_9=0] [L78] 5 y_9 := temp_13 + 1; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=0, y_1=3, y_9=1] [L91] 6 assume f1_10; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=0, y_1=3, y_9=1] [L79] 5 f1_10 := false; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=0, y_1=3, y_9=1] [L92] 6 temp_15 := x_8; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=0, y_1=3, y_9=1] [L93] 6 x_8 := temp_15 + 1; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=1, y_1=3, y_9=1] [L94] 6 f2_11 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=1, y_1=3, y_9=1] [L80] 5 assume !f2_11; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=1, y_1=3, y_9=1] [L95] 6 assume !f1_10; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=1, y_1=3, y_9=1] [L65] JOIN 3 join 2, 2; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=1, y_1=3, y_9=1] [L66] JOIN 4 join 3, 3, 3; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=1, y_1=3, y_9=1] [L118] JOIN 1 join 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=1, y_1=3, y_9=1] [L108] JOIN 5 join 5, 5, 5, 5, 5; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=1, y_1=3, y_9=1] [L109] JOIN 6 join 6, 6, 6, 6, 6, 6; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=1, y_1=3, y_9=1] [L119] JOIN 2 join 4, 4, 4, 4; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=1, y_1=3, y_9=1] [L120] 0 assume !(x_0 == x_8 && y_1 == y_9); [L121] 0 assert false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=1, y_1=3, y_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 3969.7ms, OverallIterations: 8, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 296.4ms, PartialOrderReductionTime: 2052.8ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 39.6ms SsaConstructionTime, 152.1ms SatisfiabilityAnalysisTime, 968.9ms InterpolantComputationTime, 502 NumberOfCodeBlocks, 502 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 424 ConstructedInterpolants, 0 QuantifiedInterpolants, 1888 SizeOfPredicates, 16 NumberOfNonLiveVariables, 149 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 24/32 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...