/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-NoLbe-New_States.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-a865e3bea3ade1065a4c95009cfa501fe03c5538-a865e3b [2021-02-20 00:14:10,021 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-02-20 00:14:10,022 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-02-20 00:14:10,040 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-02-20 00:14:10,040 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-02-20 00:14:10,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-02-20 00:14:10,042 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-02-20 00:14:10,043 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-02-20 00:14:10,044 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-02-20 00:14:10,045 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-02-20 00:14:10,046 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-02-20 00:14:10,046 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-02-20 00:14:10,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-02-20 00:14:10,047 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-02-20 00:14:10,048 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-02-20 00:14:10,048 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-02-20 00:14:10,049 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-02-20 00:14:10,049 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-02-20 00:14:10,050 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-02-20 00:14:10,052 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-02-20 00:14:10,052 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-02-20 00:14:10,053 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-02-20 00:14:10,054 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-02-20 00:14:10,054 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-02-20 00:14:10,060 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-02-20 00:14:10,060 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-02-20 00:14:10,060 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-02-20 00:14:10,061 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-02-20 00:14:10,061 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-02-20 00:14:10,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-02-20 00:14:10,062 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-02-20 00:14:10,062 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-02-20 00:14:10,063 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-02-20 00:14:10,063 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-02-20 00:14:10,064 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-02-20 00:14:10,064 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-02-20 00:14:10,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-02-20 00:14:10,065 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-02-20 00:14:10,065 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-02-20 00:14:10,065 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-02-20 00:14:10,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-02-20 00:14:10,069 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-NoLbe-New_States.epf [2021-02-20 00:14:10,093 INFO L113 SettingsManager]: Loading preferences was successful [2021-02-20 00:14:10,093 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-02-20 00:14:10,093 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-02-20 00:14:10,093 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-02-20 00:14:10,094 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-02-20 00:14:10,094 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-02-20 00:14:10,094 INFO L138 SettingsManager]: * Use SBE=true [2021-02-20 00:14:10,095 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-02-20 00:14:10,095 INFO L138 SettingsManager]: * sizeof long=4 [2021-02-20 00:14:10,095 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-02-20 00:14:10,095 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-02-20 00:14:10,095 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-02-20 00:14:10,095 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-02-20 00:14:10,095 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-02-20 00:14:10,095 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-02-20 00:14:10,095 INFO L138 SettingsManager]: * sizeof long double=12 [2021-02-20 00:14:10,095 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-02-20 00:14:10,096 INFO L138 SettingsManager]: * Use constant arrays=true [2021-02-20 00:14:10,096 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-02-20 00:14:10,096 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-02-20 00:14:10,096 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-02-20 00:14:10,096 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-02-20 00:14:10,096 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-02-20 00:14:10,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-20 00:14:10,096 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-02-20 00:14:10,096 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-02-20 00:14:10,096 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-02-20 00:14:10,097 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-02-20 00:14:10,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-02-20 00:14:10,097 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-02-20 00:14:10,097 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2021-02-20 00:14:10,097 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-02-20 00:14:10,097 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2021-02-20 00:14:10,097 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-02-20 00:14:10,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-02-20 00:14:10,371 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-02-20 00:14:10,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-02-20 00:14:10,374 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-02-20 00:14:10,375 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-02-20 00:14:10,376 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-02-20 00:14:10,376 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl' [2021-02-20 00:14:10,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-02-20 00:14:10,410 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-02-20 00:14:10,411 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-02-20 00:14:10,411 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-02-20 00:14:10,411 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-02-20 00:14:10,420 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 20.02 12:14:10" (1/1) ... [2021-02-20 00:14:10,426 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 20.02 12:14:10" (1/1) ... [2021-02-20 00:14:10,432 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-02-20 00:14:10,433 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-02-20 00:14:10,433 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-02-20 00:14:10,433 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-02-20 00:14:10,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.02 12:14:10" (1/1) ... [2021-02-20 00:14:10,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.02 12:14:10" (1/1) ... [2021-02-20 00:14:10,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.02 12:14:10" (1/1) ... [2021-02-20 00:14:10,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.02 12:14:10" (1/1) ... [2021-02-20 00:14:10,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.02 12:14:10" (1/1) ... [2021-02-20 00:14:10,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.02 12:14:10" (1/1) ... [2021-02-20 00:14:10,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.02 12:14:10" (1/1) ... [2021-02-20 00:14:10,448 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-02-20 00:14:10,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-02-20 00:14:10,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-02-20 00:14:10,448 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-02-20 00:14:10,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.02 12:14:10" (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-02-20 00:14:10,505 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-02-20 00:14:10,505 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-02-20 00:14:10,505 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-02-20 00:14:10,506 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-02-20 00:14:10,506 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-02-20 00:14:10,506 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-02-20 00:14:10,506 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-02-20 00:14:10,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-02-20 00:14:10,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-02-20 00:14:10,506 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-02-20 00:14:10,506 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-02-20 00:14:10,506 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-02-20 00:14:10,507 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2021-02-20 00:14:10,507 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-02-20 00:14:10,507 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-02-20 00:14:10,507 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2021-02-20 00:14:10,508 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2021-02-20 00:14:10,508 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2021-02-20 00:14:10,508 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2021-02-20 00:14:10,508 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2021-02-20 00:14:10,509 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2021-02-20 00:14:10,510 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-02-20 00:14:10,678 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-02-20 00:14:10,678 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-02-20 00:14:10,679 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 12:14:10 BoogieIcfgContainer [2021-02-20 00:14:10,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-02-20 00:14:10,680 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-02-20 00:14:10,680 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-02-20 00:14:10,682 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-02-20 00:14:10,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.02 12:14:10" (1/2) ... [2021-02-20 00:14:10,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d98edce and model type barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 12:14:10, skipping insertion in model container [2021-02-20 00:14:10,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 12:14:10" (2/2) ... [2021-02-20 00:14:10,684 INFO L111 eAbstractionObserver]: Analyzing ICFG barrier-loop.wvr.bpl [2021-02-20 00:14:10,687 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-02-20 00:14:10,688 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-02-20 00:14:10,690 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-02-20 00:14:10,690 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-02-20 00:14:10,778 INFO L149 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2021-02-20 00:14:10,790 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-02-20 00:14:10,823 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-02-20 00:14:10,823 INFO L377 AbstractCegarLoop]: Hoare is true [2021-02-20 00:14:10,823 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-02-20 00:14:10,823 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-02-20 00:14:10,823 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-02-20 00:14:10,823 INFO L381 AbstractCegarLoop]: Difference is false [2021-02-20 00:14:10,823 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-02-20 00:14:10,823 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-02-20 00:14:11,075 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thread4Thread1of1ForFork3Err7INUSE_VIOLATION, thread1Err9INUSE_VIOLATION, thread4Err1INUSE_VIOLATION, thread4Thread1of1ForFork3Err8INUSE_VIOLATION, thread4Err4INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, thread1Err0INUSE_VIOLATION, thread1Thread1of1ForFork2Err2INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, thread1Thread1of1ForFork2Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-02-20 00:14:11,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-20 00:14:11,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1032408171, now seen corresponding path program 1 times [2021-02-20 00:14:11,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-02-20 00:14:11,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723679321] [2021-02-20 00:14:11,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-20 00:14:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-20 00:14:11,305 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2021-02-20 00:14:11,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723679321] [2021-02-20 00:14:11,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-20 00:14:11,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-02-20 00:14:11,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738973881] [2021-02-20 00:14:11,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-02-20 00:14:11,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-02-20 00:14:11,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-02-20 00:14:11,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-02-20 00:14:11,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-02-20 00:14:11,322 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-02-20 00:14:11,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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-02-20 00:14:11,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-02-20 00:14:11,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:11,786 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-02-20 00:14:11,786 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thread4Thread1of1ForFork3Err7INUSE_VIOLATION, thread1Err9INUSE_VIOLATION, thread4Err1INUSE_VIOLATION, thread4Thread1of1ForFork3Err8INUSE_VIOLATION, thread4Err4INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, thread1Err0INUSE_VIOLATION, thread1Thread1of1ForFork2Err2INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, thread1Thread1of1ForFork2Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-02-20 00:14:11,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-20 00:14:11,787 INFO L82 PathProgramCache]: Analyzing trace with hash -713522954, now seen corresponding path program 2 times [2021-02-20 00:14:11,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-02-20 00:14:11,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231558103] [2021-02-20 00:14:11,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-20 00:14:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-20 00:14:11,836 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2021-02-20 00:14:11,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231558103] [2021-02-20 00:14:11,836 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-20 00:14:11,836 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-02-20 00:14:11,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878886452] [2021-02-20 00:14:11,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-02-20 00:14:11,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-02-20 00:14:11,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-02-20 00:14:11,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-02-20 00:14:11,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-02-20 00:14:11,842 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-02-20 00:14:11,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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-02-20 00:14:11,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:11,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-02-20 00:14:12,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:12,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:12,197 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-02-20 00:14:12,197 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thread4Thread1of1ForFork3Err7INUSE_VIOLATION, thread1Err9INUSE_VIOLATION, thread4Err1INUSE_VIOLATION, thread4Thread1of1ForFork3Err8INUSE_VIOLATION, thread4Err4INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, thread1Err0INUSE_VIOLATION, thread1Thread1of1ForFork2Err2INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, thread1Thread1of1ForFork2Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-02-20 00:14:12,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-20 00:14:12,197 INFO L82 PathProgramCache]: Analyzing trace with hash -601345487, now seen corresponding path program 3 times [2021-02-20 00:14:12,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-02-20 00:14:12,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098796848] [2021-02-20 00:14:12,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-20 00:14:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-20 00:14:12,224 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2021-02-20 00:14:12,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098796848] [2021-02-20 00:14:12,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-20 00:14:12,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-02-20 00:14:12,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421811619] [2021-02-20 00:14:12,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-02-20 00:14:12,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-02-20 00:14:12,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-02-20 00:14:12,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-02-20 00:14:12,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-02-20 00:14:12,226 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-02-20 00:14:12,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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-02-20 00:14:12,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:12,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:12,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-02-20 00:14:12,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:12,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:12,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:12,483 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-02-20 00:14:12,484 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thread4Thread1of1ForFork3Err7INUSE_VIOLATION, thread1Err9INUSE_VIOLATION, thread4Err1INUSE_VIOLATION, thread4Thread1of1ForFork3Err8INUSE_VIOLATION, thread4Err4INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, thread1Err0INUSE_VIOLATION, thread1Thread1of1ForFork2Err2INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, thread1Thread1of1ForFork2Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-02-20 00:14:12,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-20 00:14:12,484 INFO L82 PathProgramCache]: Analyzing trace with hash -603482100, now seen corresponding path program 4 times [2021-02-20 00:14:12,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-02-20 00:14:12,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8690511] [2021-02-20 00:14:12,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-20 00:14:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-20 00:14:12,511 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2021-02-20 00:14:12,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8690511] [2021-02-20 00:14:12,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-20 00:14:12,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-02-20 00:14:12,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769375098] [2021-02-20 00:14:12,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-02-20 00:14:12,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-02-20 00:14:12,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-02-20 00:14:12,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-02-20 00:14:12,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-02-20 00:14:12,512 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-02-20 00:14:12,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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-02-20 00:14:12,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:12,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:12,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:12,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-02-20 00:14:12,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:12,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:12,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:12,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:12,751 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-02-20 00:14:12,751 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thread4Thread1of1ForFork3Err7INUSE_VIOLATION, thread1Err9INUSE_VIOLATION, thread4Err1INUSE_VIOLATION, thread4Thread1of1ForFork3Err8INUSE_VIOLATION, thread4Err4INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, thread1Err0INUSE_VIOLATION, thread1Thread1of1ForFork2Err2INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, thread1Thread1of1ForFork2Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-02-20 00:14:12,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-20 00:14:12,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1250595347, now seen corresponding path program 5 times [2021-02-20 00:14:12,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-02-20 00:14:12,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827303422] [2021-02-20 00:14:12,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-20 00:14:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-20 00:14:12,793 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-02-20 00:14:12,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827303422] [2021-02-20 00:14:12,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-20 00:14:12,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-02-20 00:14:12,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067647982] [2021-02-20 00:14:12,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-02-20 00:14:12,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-02-20 00:14:12,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-02-20 00:14:12,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-02-20 00:14:12,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-02-20 00:14:12,795 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-02-20 00:14:12,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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-02-20 00:14:12,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:12,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:12,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:12,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:12,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-02-20 00:14:12,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:12,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:12,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:12,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:12,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:12,967 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-02-20 00:14:12,967 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thread4Thread1of1ForFork3Err7INUSE_VIOLATION, thread1Err9INUSE_VIOLATION, thread4Err1INUSE_VIOLATION, thread4Thread1of1ForFork3Err8INUSE_VIOLATION, thread4Err4INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, thread1Err0INUSE_VIOLATION, thread1Thread1of1ForFork2Err2INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, thread1Thread1of1ForFork2Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-02-20 00:14:12,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-20 00:14:12,968 INFO L82 PathProgramCache]: Analyzing trace with hash 207619240, now seen corresponding path program 6 times [2021-02-20 00:14:12,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-02-20 00:14:12,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750226201] [2021-02-20 00:14:12,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-20 00:14:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-20 00:14:13,045 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-02-20 00:14:13,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750226201] [2021-02-20 00:14:13,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-20 00:14:13,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-02-20 00:14:13,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887444449] [2021-02-20 00:14:13,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-02-20 00:14:13,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-02-20 00:14:13,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-02-20 00:14:13,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-02-20 00:14:13,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-02-20 00:14:13,047 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-02-20 00:14:13,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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-02-20 00:14:13,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:13,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:13,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:13,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:13,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:13,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-02-20 00:14:13,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:13,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:13,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:13,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:13,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:13,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:13,169 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-02-20 00:14:13,170 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thread4Thread1of1ForFork3Err7INUSE_VIOLATION, thread1Err9INUSE_VIOLATION, thread4Err1INUSE_VIOLATION, thread4Thread1of1ForFork3Err8INUSE_VIOLATION, thread4Err4INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, thread1Err0INUSE_VIOLATION, thread1Thread1of1ForFork2Err2INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, thread1Thread1of1ForFork2Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-02-20 00:14:13,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-20 00:14:13,170 INFO L82 PathProgramCache]: Analyzing trace with hash -681729021, now seen corresponding path program 7 times [2021-02-20 00:14:13,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-02-20 00:14:13,170 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504650052] [2021-02-20 00:14:13,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-20 00:14:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-20 00:14:13,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-20 00:14:13,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504650052] [2021-02-20 00:14:13,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865410130] [2021-02-20 00:14:13,476 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-02-20 00:14:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-20 00:14:13,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 37 conjunts are in the unsatisfiable core [2021-02-20 00:14:13,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-02-20 00:14:13,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-20 00:14:13,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-02-20 00:14:13,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2021-02-20 00:14:13,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462547823] [2021-02-20 00:14:13,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-02-20 00:14:13,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-02-20 00:14:13,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-02-20 00:14:13,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2021-02-20 00:14:13,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-02-20 00:14:13,808 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-02-20 00:14:13,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 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-02-20 00:14:13,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:13,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:13,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:13,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:13,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:13,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:13,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-02-20 00:14:14,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:14,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:14,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:14,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:14,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:14,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-02-20 00:14:14,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-02-20 00:14:14,438 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-02-20 00:14:14,439 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thread4Thread1of1ForFork3Err7INUSE_VIOLATION, thread1Err9INUSE_VIOLATION, thread4Err1INUSE_VIOLATION, thread4Thread1of1ForFork3Err8INUSE_VIOLATION, thread4Err4INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, thread1Err0INUSE_VIOLATION, thread1Thread1of1ForFork2Err2INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, thread1Thread1of1ForFork2Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-02-20 00:14:14,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-20 00:14:14,439 INFO L82 PathProgramCache]: Analyzing trace with hash -392668511, now seen corresponding path program 8 times [2021-02-20 00:14:14,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-02-20 00:14:14,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323136885] [2021-02-20 00:14:14,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-20 00:14:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-02-20 00:14:14,447 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-02-20 00:14:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-02-20 00:14:14,453 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-02-20 00:14:14,474 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-02-20 00:14:14,474 INFO L607 BasicCegarLoop]: Counterexample might be feasible [2021-02-20 00:14:14,475 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-02-20 00:14:14,519 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 12:14:14 BasicIcfg [2021-02-20 00:14:14,519 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-02-20 00:14:14,520 INFO L168 Benchmark]: Toolchain (without parser) took 4111.94 ms. Allocated memory was 255.9 MB in the beginning and 794.8 MB in the end (delta: 539.0 MB). Free memory was 236.4 MB in the beginning and 494.2 MB in the end (delta: -257.8 MB). Peak memory consumption was 280.7 MB. Max. memory is 16.0 GB. [2021-02-20 00:14:14,520 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-02-20 00:14:14,520 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.59 ms. Allocated memory is still 255.9 MB. Free memory was 235.9 MB in the beginning and 234.4 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-02-20 00:14:14,520 INFO L168 Benchmark]: Boogie Preprocessor took 15.07 ms. Allocated memory is still 255.9 MB. Free memory was 234.4 MB in the beginning and 233.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-02-20 00:14:14,520 INFO L168 Benchmark]: RCFGBuilder took 231.15 ms. Allocated memory is still 255.9 MB. Free memory was 233.1 MB in the beginning and 233.2 MB in the end (delta: -100.3 kB). Peak memory consumption was 18.5 MB. Max. memory is 16.0 GB. [2021-02-20 00:14:14,520 INFO L168 Benchmark]: TraceAbstraction took 3838.99 ms. Allocated memory was 255.9 MB in the beginning and 794.8 MB in the end (delta: 539.0 MB). Free memory was 233.2 MB in the beginning and 494.2 MB in the end (delta: -261.0 MB). Peak memory consumption was 276.8 MB. Max. memory is 16.0 GB. [2021-02-20 00:14:14,521 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.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 20.59 ms. Allocated memory is still 255.9 MB. Free memory was 235.9 MB in the beginning and 234.4 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Preprocessor took 15.07 ms. Allocated memory is still 255.9 MB. Free memory was 234.4 MB in the beginning and 233.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 231.15 ms. Allocated memory is still 255.9 MB. Free memory was 233.1 MB in the beginning and 233.2 MB in the end (delta: -100.3 kB). Peak memory consumption was 18.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 3838.99 ms. Allocated memory was 255.9 MB in the beginning and 794.8 MB in the end (delta: 539.0 MB). Free memory was 233.2 MB in the beginning and 494.2 MB in the end (delta: -261.0 MB). Peak memory consumption was 276.8 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 120]: assertion can be violated assertion can be violated We found a FailurePath: [L114] 0 assume x_0 == x_8 && y_1 == y_9; VAL [x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L115] FORK 0 fork 1 thread1(); VAL [x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L59] 1 f1_2 := false; [L60] 1 f2_3 := false; VAL [f1_2=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L116] 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] [L102] 2 f1_10 := false; [L103] 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] [L62] 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] [L29] 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] [L30] 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] [L31] 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] [L63] 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] [L44] 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] [L45] 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] [L46] 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] [L32] 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] [L33] 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] [L34] 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] [L47] 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] [L35] 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] [L48] 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] [L49] 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] [L50] 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] [L36] 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] [L29] 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] [L30] 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] [L51] 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] [L31] 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] [L44] 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] [L45] 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] [L46] 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] [L32] 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] [L33] 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] [L34] 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] [L47] 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] [L35] 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] [L48] 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] [L49] 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] [L50] 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] [L36] 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] [L51] 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] [L105] 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] [L72] 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] [L73] 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] [L74] 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] [L106] 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] [L87] 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] [L88] 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] [L89] 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] [L75] 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] [L76] 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] [L77] 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] [L90] 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] [L78] 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] [L91] 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] [L92] 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] [L93] 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] [L79] 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] [L94] 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] [L64] 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] [L65] 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] [L117] 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] [L107] 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] [L108] 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] [L118] 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] [L119] 0 assume !(x_0 == x_8 && y_1 == y_9); 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 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: 3.6s, OverallIterations: 8, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 951 NumberOfCodeBlocks, 951 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 872 ConstructedInterpolants, 0 QuantifiedInterpolants, 196544 SizeOfPredicates, 16 NumberOfNonLiveVariables, 150 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 1255/1263 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...