/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-PN-SemanticLbe.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-12 00:17:26,129 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-12 00:17:26,131 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-12 00:17:26,170 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-12 00:17:26,171 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-12 00:17:26,173 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-12 00:17:26,176 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-12 00:17:26,180 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-12 00:17:26,182 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-12 00:17:26,186 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-12 00:17:26,187 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-12 00:17:26,188 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-12 00:17:26,188 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-12 00:17:26,190 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-12 00:17:26,191 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-12 00:17:26,192 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-12 00:17:26,195 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-12 00:17:26,196 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-12 00:17:26,199 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-12 00:17:26,208 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-12 00:17:26,209 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-12 00:17:26,211 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-12 00:17:26,211 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-12 00:17:26,213 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-12 00:17:26,219 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-12 00:17:26,219 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-12 00:17:26,219 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-12 00:17:26,221 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-12 00:17:26,221 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-12 00:17:26,222 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-12 00:17:26,222 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-12 00:17:26,223 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-12 00:17:26,224 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-12 00:17:26,225 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-12 00:17:26,225 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-12 00:17:26,226 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-12 00:17:26,226 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-12 00:17:26,226 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-12 00:17:26,226 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-12 00:17:26,227 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-12 00:17:26,227 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-12 00:17:26,228 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-PN-SemanticLbe.epf [2021-03-12 00:17:26,264 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-12 00:17:26,264 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-12 00:17:26,268 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-12 00:17:26,268 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-12 00:17:26,268 INFO L138 SettingsManager]: * Use SBE=true [2021-03-12 00:17:26,268 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-12 00:17:26,268 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-12 00:17:26,268 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-12 00:17:26,269 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-12 00:17:26,269 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-12 00:17:26,270 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-12 00:17:26,270 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-12 00:17:26,270 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-12 00:17:26,270 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-12 00:17:26,270 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-12 00:17:26,270 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-12 00:17:26,270 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-12 00:17:26,271 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-12 00:17:26,271 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-12 00:17:26,271 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-12 00:17:26,271 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-12 00:17:26,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-12 00:17:26,271 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-12 00:17:26,272 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-12 00:17:26,272 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-12 00:17:26,272 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-12 00:17:26,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-12 00:17:26,272 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-12 00:17:26,272 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-12 00:17:26,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-12 00:17:26,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-12 00:17:26,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-12 00:17:26,583 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-03-12 00:17:26,584 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-03-12 00:17:26,584 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-12 00:17:26,599 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-12 00:17:26,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-12 00:17:26,636 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-03-12 00:17:26,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-12 00:17:26,637 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-12 00:17:26,637 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-12 00:17:26,649 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 12.03 12:17:26" (1/1) ... [2021-03-12 00:17:26,655 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 12.03 12:17:26" (1/1) ... [2021-03-12 00:17:26,662 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-12 00:17:26,663 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-12 00:17:26,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-12 00:17:26,663 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-12 00:17:26,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.03 12:17:26" (1/1) ... [2021-03-12 00:17:26,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.03 12:17:26" (1/1) ... [2021-03-12 00:17:26,672 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.03 12:17:26" (1/1) ... [2021-03-12 00:17:26,672 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.03 12:17:26" (1/1) ... [2021-03-12 00:17:26,680 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.03 12:17:26" (1/1) ... [2021-03-12 00:17:26,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.03 12:17:26" (1/1) ... [2021-03-12 00:17:26,686 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.03 12:17:26" (1/1) ... [2021-03-12 00:17:26,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-12 00:17:26,692 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-12 00:17:26,692 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-12 00:17:26,692 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-12 00:17:26,693 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.03 12:17:26" (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-12 00:17:26,748 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-03-12 00:17:26,748 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-03-12 00:17:26,748 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-03-12 00:17:26,748 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-03-12 00:17:26,748 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-03-12 00:17:26,748 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-03-12 00:17:26,748 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-03-12 00:17:26,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-12 00:17:26,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-12 00:17:26,749 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-03-12 00:17:26,749 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-03-12 00:17:26,749 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-03-12 00:17:26,749 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2021-03-12 00:17:26,749 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-03-12 00:17:26,749 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-03-12 00:17:26,750 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2021-03-12 00:17:26,750 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2021-03-12 00:17:26,750 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2021-03-12 00:17:26,750 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2021-03-12 00:17:26,750 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2021-03-12 00:17:26,750 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2021-03-12 00:17:26,751 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-12 00:17:26,920 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-12 00:17:26,920 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-03-12 00:17:26,922 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.03 12:17:26 BoogieIcfgContainer [2021-03-12 00:17:26,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-12 00:17:26,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-12 00:17:26,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-12 00:17:26,925 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-12 00:17:26,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.03 12:17:26" (1/2) ... [2021-03-12 00:17:26,926 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 12.03 12:17:26, skipping insertion in model container [2021-03-12 00:17:26,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.03 12:17:26" (2/2) ... [2021-03-12 00:17:26,927 INFO L111 eAbstractionObserver]: Analyzing ICFG barrier-loop.wvr.bpl [2021-03-12 00:17:26,931 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-12 00:17:26,934 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-12 00:17:26,934 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-12 00:17:27,084 INFO L149 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2021-03-12 00:17:27,098 INFO L253 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2021-03-12 00:17:27,115 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-12 00:17:27,116 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-12 00:17:27,116 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-12 00:17:27,116 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-12 00:17:27,116 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-12 00:17:27,116 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-12 00:17:27,116 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-12 00:17:27,116 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-12 00:17:27,126 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 73 transitions, 218 flow [2021-03-12 00:17:27,156 INFO L129 PetriNetUnfolder]: 8/61 cut-off events. [2021-03-12 00:17:27,157 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-03-12 00:17:27,162 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-12 00:17:27,162 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 73 transitions, 218 flow [2021-03-12 00:17:27,166 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 59 transitions, 166 flow [2021-03-12 00:17:27,173 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-12 00:17:27,186 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 59 transitions, 166 flow [2021-03-12 00:17:27,194 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 59 transitions, 166 flow [2021-03-12 00:17:27,195 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 59 transitions, 166 flow [2021-03-12 00:17:27,218 INFO L129 PetriNetUnfolder]: 8/59 cut-off events. [2021-03-12 00:17:27,218 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-03-12 00:17:27,220 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 59 events. 8/59 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 183 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 71. Up to 3 conditions per place. [2021-03-12 00:17:27,222 INFO L116 LiptonReduction]: Number of co-enabled transitions 1888 [2021-03-12 00:17:27,424 INFO L131 LiptonReduction]: Checked pairs total: 5124 [2021-03-12 00:17:27,424 INFO L133 LiptonReduction]: Total number of compositions: 1 [2021-03-12 00:17:27,425 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 259 [2021-03-12 00:17:27,456 INFO L129 PetriNetUnfolder]: 8/57 cut-off events. [2021-03-12 00:17:27,457 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-03-12 00:17:27,457 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-12 00:17:27,458 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-12 00:17:27,458 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-12 00:17:27,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-12 00:17:27,462 INFO L82 PathProgramCache]: Analyzing trace with hash -871171209, now seen corresponding path program 1 times [2021-03-12 00:17:27,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-12 00:17:27,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401245106] [2021-03-12 00:17:27,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-12 00:17:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-12 00:17:27,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:17:27,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-12 00:17:27,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-12 00:17:27,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401245106] [2021-03-12 00:17:27,665 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-12 00:17:27,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-12 00:17:27,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919594840] [2021-03-12 00:17:27,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-12 00:17:27,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-12 00:17:27,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-12 00:17:27,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-12 00:17:27,693 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 78 [2021-03-12 00:17:27,695 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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-12 00:17:27,695 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-12 00:17:27,695 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 78 [2021-03-12 00:17:27,697 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-12 00:17:28,180 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([203] thread4EXIT-->L119: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar0_4 4) (= v_thread4Thread1of1ForFork3_thidvar3_4 4) (= v_thread4Thread1of1ForFork3_thidvar1_4 4) (= v_thread4Thread1of1ForFork3_thidvar2_4 4)) InVars {thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_4, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_4, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_4, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_4} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_4, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_4, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_4, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_4} AuxVars[] AssignedVars[][60], [thread3Thread1of1ForFork1NotInUse, thread5Thread1of1ForFork4NotInUse, thread4Thread1of1ForFork3NotInUse, thread1Thread1of1ForFork2NotInUse, 88#true, 72#L119true, thread6Thread1of1ForFork5NotInUse, thread2Thread1of1ForFork0NotInUse]) [2021-03-12 00:17:28,181 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is not cut-off event [2021-03-12 00:17:28,182 INFO L387 tUnfolder$Statistics]: existing Event has 37 ancestors and is not cut-off event [2021-03-12 00:17:28,182 INFO L387 tUnfolder$Statistics]: existing Event has 37 ancestors and is not cut-off event [2021-03-12 00:17:28,182 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-12 00:17:28,214 INFO L129 PetriNetUnfolder]: 1975/3928 cut-off events. [2021-03-12 00:17:28,214 INFO L130 PetriNetUnfolder]: For 154/154 co-relation queries the response was YES. [2021-03-12 00:17:28,246 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6571 conditions, 3928 events. 1975/3928 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 28997 event pairs, 737 based on Foata normal form. 1/3649 useless extension candidates. Maximal degree in co-relation 6543. Up to 2309 conditions per place. [2021-03-12 00:17:28,271 INFO L132 encePairwiseOnDemand]: 72/78 looper letters, 21 selfloop transitions, 5 changer transitions 0/66 dead transitions. [2021-03-12 00:17:28,271 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 66 transitions, 232 flow [2021-03-12 00:17:28,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-12 00:17:28,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-12 00:17:28,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2021-03-12 00:17:28,283 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8589743589743589 [2021-03-12 00:17:28,284 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 201 transitions. [2021-03-12 00:17:28,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 201 transitions. [2021-03-12 00:17:28,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-12 00:17:28,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 201 transitions. [2021-03-12 00:17:28,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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-12 00:17:28,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 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-12 00:17:28,297 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 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-12 00:17:28,299 INFO L185 Difference]: Start difference. First operand has 69 places, 58 transitions, 164 flow. Second operand 3 states and 201 transitions. [2021-03-12 00:17:28,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 66 transitions, 232 flow [2021-03-12 00:17:28,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 66 transitions, 200 flow, removed 0 selfloop flow, removed 12 redundant places. [2021-03-12 00:17:28,312 INFO L241 Difference]: Finished difference. Result has 60 places, 62 transitions, 165 flow [2021-03-12 00:17:28,314 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=60, PETRI_TRANSITIONS=62} [2021-03-12 00:17:28,314 INFO L335 CegarLoopForPetriNet]: 69 programPoint places, -9 predicate places. [2021-03-12 00:17:28,315 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 62 transitions, 165 flow [2021-03-12 00:17:28,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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-12 00:17:28,315 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-12 00:17:28,315 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-12 00:17:28,315 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-12 00:17:28,316 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-12 00:17:28,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-12 00:17:28,317 INFO L82 PathProgramCache]: Analyzing trace with hash -992939024, now seen corresponding path program 1 times [2021-03-12 00:17:28,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-12 00:17:28,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244507918] [2021-03-12 00:17:28,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-12 00:17:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-12 00:17:28,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:17:28,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-12 00:17:28,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:17:28,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-03-12 00:17:28,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:17:28,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-12 00:17:28,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-12 00:17:28,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244507918] [2021-03-12 00:17:28,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-12 00:17:28,363 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-12 00:17:28,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487903115] [2021-03-12 00:17:28,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-12 00:17:28,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-12 00:17:28,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-12 00:17:28,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-12 00:17:28,368 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 78 [2021-03-12 00:17:28,368 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 62 transitions, 165 flow. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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-12 00:17:28,368 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-12 00:17:28,368 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 78 [2021-03-12 00:17:28,368 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-12 00:17:28,402 INFO L129 PetriNetUnfolder]: 101/344 cut-off events. [2021-03-12 00:17:28,403 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-12 00:17:28,405 INFO L84 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 344 events. 101/344 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1667 event pairs, 14 based on Foata normal form. 6/283 useless extension candidates. Maximal degree in co-relation 444. Up to 84 conditions per place. [2021-03-12 00:17:28,410 INFO L132 encePairwiseOnDemand]: 73/78 looper letters, 3 selfloop transitions, 4 changer transitions 0/64 dead transitions. [2021-03-12 00:17:28,410 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 64 transitions, 183 flow [2021-03-12 00:17:28,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-12 00:17:28,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-12 00:17:28,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2021-03-12 00:17:28,419 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9572649572649573 [2021-03-12 00:17:28,419 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 224 transitions. [2021-03-12 00:17:28,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 224 transitions. [2021-03-12 00:17:28,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-12 00:17:28,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 224 transitions. [2021-03-12 00:17:28,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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-12 00:17:28,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 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-12 00:17:28,424 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 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-12 00:17:28,424 INFO L185 Difference]: Start difference. First operand has 60 places, 62 transitions, 165 flow. Second operand 3 states and 224 transitions. [2021-03-12 00:17:28,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 64 transitions, 183 flow [2021-03-12 00:17:28,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 64 transitions, 178 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-12 00:17:28,426 INFO L241 Difference]: Finished difference. Result has 63 places, 64 transitions, 186 flow [2021-03-12 00:17:28,427 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=63, PETRI_TRANSITIONS=64} [2021-03-12 00:17:28,427 INFO L335 CegarLoopForPetriNet]: 69 programPoint places, -6 predicate places. [2021-03-12 00:17:28,427 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 64 transitions, 186 flow [2021-03-12 00:17:28,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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-12 00:17:28,427 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-12 00:17:28,428 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-12 00:17:28,428 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-12 00:17:28,428 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-12 00:17:28,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-12 00:17:28,428 INFO L82 PathProgramCache]: Analyzing trace with hash 88735810, now seen corresponding path program 1 times [2021-03-12 00:17:28,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-12 00:17:28,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35039788] [2021-03-12 00:17:28,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-12 00:17:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-12 00:17:28,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:17:28,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-12 00:17:28,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:17:28,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-03-12 00:17:28,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:17:28,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-12 00:17:28,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-12 00:17:28,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35039788] [2021-03-12 00:17:28,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-12 00:17:28,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-12 00:17:28,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567692564] [2021-03-12 00:17:28,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-12 00:17:28,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-12 00:17:28,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-12 00:17:28,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-12 00:17:28,476 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 78 [2021-03-12 00:17:28,476 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 64 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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-12 00:17:28,476 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-12 00:17:28,476 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 78 [2021-03-12 00:17:28,476 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-12 00:17:28,523 INFO L129 PetriNetUnfolder]: 150/497 cut-off events. [2021-03-12 00:17:28,524 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-03-12 00:17:28,526 INFO L84 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 497 events. 150/497 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2662 event pairs, 34 based on Foata normal form. 8/410 useless extension candidates. Maximal degree in co-relation 688. Up to 122 conditions per place. [2021-03-12 00:17:28,528 INFO L132 encePairwiseOnDemand]: 73/78 looper letters, 3 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2021-03-12 00:17:28,529 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 66 transitions, 204 flow [2021-03-12 00:17:28,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-12 00:17:28,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-12 00:17:28,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2021-03-12 00:17:28,530 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9572649572649573 [2021-03-12 00:17:28,530 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 224 transitions. [2021-03-12 00:17:28,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 224 transitions. [2021-03-12 00:17:28,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-12 00:17:28,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 224 transitions. [2021-03-12 00:17:28,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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-12 00:17:28,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 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-12 00:17:28,533 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 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-12 00:17:28,533 INFO L185 Difference]: Start difference. First operand has 63 places, 64 transitions, 186 flow. Second operand 3 states and 224 transitions. [2021-03-12 00:17:28,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 66 transitions, 204 flow [2021-03-12 00:17:28,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 66 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-12 00:17:28,538 INFO L241 Difference]: Finished difference. Result has 65 places, 66 transitions, 204 flow [2021-03-12 00:17:28,538 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=65, PETRI_TRANSITIONS=66} [2021-03-12 00:17:28,538 INFO L335 CegarLoopForPetriNet]: 69 programPoint places, -4 predicate places. [2021-03-12 00:17:28,538 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 204 flow [2021-03-12 00:17:28,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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-12 00:17:28,539 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-12 00:17:28,539 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-12 00:17:28,539 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-12 00:17:28,539 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-12 00:17:28,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-12 00:17:28,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1156811842, now seen corresponding path program 1 times [2021-03-12 00:17:28,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-12 00:17:28,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059091318] [2021-03-12 00:17:28,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-12 00:17:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-12 00:17:28,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:17:28,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-12 00:17:28,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:17:28,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-03-12 00:17:28,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:17:28,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-12 00:17:28,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-12 00:17:28,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059091318] [2021-03-12 00:17:28,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-12 00:17:28,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-12 00:17:28,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870779430] [2021-03-12 00:17:28,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-12 00:17:28,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-12 00:17:28,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-12 00:17:28,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-12 00:17:28,583 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 78 [2021-03-12 00:17:28,594 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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-12 00:17:28,594 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-12 00:17:28,594 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 78 [2021-03-12 00:17:28,595 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-12 00:17:28,640 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([203] thread4EXIT-->L119: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar0_4 4) (= v_thread4Thread1of1ForFork3_thidvar3_4 4) (= v_thread4Thread1of1ForFork3_thidvar1_4 4) (= v_thread4Thread1of1ForFork3_thidvar2_4 4)) InVars {thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_4, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_4, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_4, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_4} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_4, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_4, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_4, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_4} AuxVars[] AssignedVars[][46], [Black: 93#true, 101#(not f1_2), Black: 99#true, 72#L119true, 107#(not f2_11), Black: 90#(and (= y_1 y_9) (= x_0 x_8))]) [2021-03-12 00:17:28,640 INFO L384 tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event [2021-03-12 00:17:28,640 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-12 00:17:28,640 INFO L387 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2021-03-12 00:17:28,640 INFO L387 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2021-03-12 00:17:28,658 INFO L129 PetriNetUnfolder]: 204/659 cut-off events. [2021-03-12 00:17:28,658 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-03-12 00:17:28,662 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 659 events. 204/659 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3995 event pairs, 54 based on Foata normal form. 38/565 useless extension candidates. Maximal degree in co-relation 993. Up to 183 conditions per place. [2021-03-12 00:17:28,666 INFO L132 encePairwiseOnDemand]: 73/78 looper letters, 3 selfloop transitions, 4 changer transitions 0/68 dead transitions. [2021-03-12 00:17:28,666 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 68 transitions, 222 flow [2021-03-12 00:17:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-12 00:17:28,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-12 00:17:28,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2021-03-12 00:17:28,668 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9572649572649573 [2021-03-12 00:17:28,668 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 224 transitions. [2021-03-12 00:17:28,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 224 transitions. [2021-03-12 00:17:28,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-12 00:17:28,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 224 transitions. [2021-03-12 00:17:28,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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-12 00:17:28,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 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-12 00:17:28,670 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 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-12 00:17:28,671 INFO L185 Difference]: Start difference. First operand has 65 places, 66 transitions, 204 flow. Second operand 3 states and 224 transitions. [2021-03-12 00:17:28,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 68 transitions, 222 flow [2021-03-12 00:17:28,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 68 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-12 00:17:28,677 INFO L241 Difference]: Finished difference. Result has 67 places, 68 transitions, 222 flow [2021-03-12 00:17:28,677 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=67, PETRI_TRANSITIONS=68} [2021-03-12 00:17:28,678 INFO L335 CegarLoopForPetriNet]: 69 programPoint places, -2 predicate places. [2021-03-12 00:17:28,679 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 222 flow [2021-03-12 00:17:28,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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-12 00:17:28,679 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-12 00:17:28,679 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-12 00:17:28,679 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-12 00:17:28,679 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-12 00:17:28,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-12 00:17:28,680 INFO L82 PathProgramCache]: Analyzing trace with hash -809591954, now seen corresponding path program 1 times [2021-03-12 00:17:28,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-12 00:17:28,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845240252] [2021-03-12 00:17:28,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-12 00:17:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-12 00:17:28,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:17:28,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-12 00:17:28,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:17:28,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-03-12 00:17:28,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:17:28,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-12 00:17:28,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-12 00:17:28,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845240252] [2021-03-12 00:17:28,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-12 00:17:28,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-12 00:17:28,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391667447] [2021-03-12 00:17:28,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-12 00:17:28,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-12 00:17:28,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-12 00:17:28,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-12 00:17:28,725 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 78 [2021-03-12 00:17:28,726 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 68 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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-12 00:17:28,726 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-12 00:17:28,726 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 78 [2021-03-12 00:17:28,726 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-12 00:17:28,815 INFO L129 PetriNetUnfolder]: 295/962 cut-off events. [2021-03-12 00:17:28,815 INFO L130 PetriNetUnfolder]: For 89/89 co-relation queries the response was YES. [2021-03-12 00:17:28,821 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1646 conditions, 962 events. 295/962 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6868 event pairs, 96 based on Foata normal form. 32/781 useless extension candidates. Maximal degree in co-relation 1624. Up to 242 conditions per place. [2021-03-12 00:17:28,827 INFO L132 encePairwiseOnDemand]: 73/78 looper letters, 3 selfloop transitions, 4 changer transitions 0/70 dead transitions. [2021-03-12 00:17:28,827 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 70 transitions, 240 flow [2021-03-12 00:17:28,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-12 00:17:28,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-12 00:17:28,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2021-03-12 00:17:28,829 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9572649572649573 [2021-03-12 00:17:28,829 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 224 transitions. [2021-03-12 00:17:28,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 224 transitions. [2021-03-12 00:17:28,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-12 00:17:28,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 224 transitions. [2021-03-12 00:17:28,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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-12 00:17:28,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 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-12 00:17:28,831 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 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-12 00:17:28,831 INFO L185 Difference]: Start difference. First operand has 67 places, 68 transitions, 222 flow. Second operand 3 states and 224 transitions. [2021-03-12 00:17:28,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 70 transitions, 240 flow [2021-03-12 00:17:28,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 70 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-12 00:17:28,835 INFO L241 Difference]: Finished difference. Result has 69 places, 70 transitions, 240 flow [2021-03-12 00:17:28,835 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=69, PETRI_TRANSITIONS=70} [2021-03-12 00:17:28,836 INFO L335 CegarLoopForPetriNet]: 69 programPoint places, 0 predicate places. [2021-03-12 00:17:28,836 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 70 transitions, 240 flow [2021-03-12 00:17:28,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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-12 00:17:28,836 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-12 00:17:28,836 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-12 00:17:28,836 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-12 00:17:28,836 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-12 00:17:28,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-12 00:17:28,837 INFO L82 PathProgramCache]: Analyzing trace with hash 857017657, now seen corresponding path program 1 times [2021-03-12 00:17:28,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-12 00:17:28,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799741108] [2021-03-12 00:17:28,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-12 00:17:28,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-12 00:17:28,858 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-12 00:17:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-12 00:17:28,913 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-12 00:17:28,950 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-12 00:17:28,950 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-12 00:17:28,950 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-12 00:17:29,014 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.03 12:17:29 BasicIcfg [2021-03-12 00:17:29,014 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-12 00:17:29,026 INFO L168 Benchmark]: Toolchain (without parser) took 2381.58 ms. Allocated memory was 255.9 MB in the beginning and 513.8 MB in the end (delta: 257.9 MB). Free memory was 236.5 MB in the beginning and 471.9 MB in the end (delta: -235.4 MB). Peak memory consumption was 89.2 MB. Max. memory is 16.0 GB. [2021-03-12 00:17:29,027 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.10 ms. Allocated memory is still 255.9 MB. Free memory is still 237.7 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-12 00:17:29,027 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.01 ms. Allocated memory is still 255.9 MB. Free memory was 236.0 MB in the beginning and 234.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-12 00:17:29,027 INFO L168 Benchmark]: Boogie Preprocessor took 28.19 ms. Allocated memory is still 255.9 MB. Free memory was 234.5 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-03-12 00:17:29,028 INFO L168 Benchmark]: RCFGBuilder took 229.66 ms. Allocated memory is still 255.9 MB. Free memory was 233.3 MB in the beginning and 235.3 MB in the end (delta: -1.9 MB). Peak memory consumption was 19.6 MB. Max. memory is 16.0 GB. [2021-03-12 00:17:29,029 INFO L168 Benchmark]: TraceAbstraction took 2091.22 ms. Allocated memory was 255.9 MB in the beginning and 513.8 MB in the end (delta: 257.9 MB). Free memory was 234.8 MB in the beginning and 471.9 MB in the end (delta: -237.1 MB). Peak memory consumption was 86.3 MB. Max. memory is 16.0 GB. [2021-03-12 00:17:29,033 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.10 ms. Allocated memory is still 255.9 MB. Free memory is still 237.7 MB. There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 25.01 ms. Allocated memory is still 255.9 MB. Free memory was 236.0 MB in the beginning and 234.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 28.19 ms. Allocated memory is still 255.9 MB. Free memory was 234.5 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 229.66 ms. Allocated memory is still 255.9 MB. Free memory was 233.3 MB in the beginning and 235.3 MB in the end (delta: -1.9 MB). Peak memory consumption was 19.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 2091.22 ms. Allocated memory was 255.9 MB in the beginning and 513.8 MB in the end (delta: 257.9 MB). Free memory was 234.8 MB in the beginning and 471.9 MB in the end (delta: -237.1 MB). Peak memory consumption was 86.3 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 229.8ms, 70 PlacesBefore, 69 PlacesAfterwards, 59 TransitionsBefore, 58 TransitionsAfterwards, 1888 CoEnabledTransitionPairs, 1 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 5124 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3270, positive: 3158, positive conditional: 0, positive unconditional: 3158, negative: 112, negative conditional: 0, negative unconditional: 112, 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: 31, positive conditional: 0, positive unconditional: 31, negative: 99, negative conditional: 0, negative unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3270, positive: 1876, positive conditional: 0, positive unconditional: 1876, negative: 80, negative conditional: 0, negative unconditional: 80, 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 - 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] [L63] FORK 1 fork 2, 2 thread2(); VAL [f1_2=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L30] 2 temp_4 := x_0; VAL [f1_2=false, f2_3=false, temp_4=-1, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L31] 2 x_0 := temp_4 + 1; VAL [f1_2=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_2=false, f2_3=false, temp_4=-1, x_0=0, x_8=-1, y_1=-1, y_9=-1] [L45] 3 temp_6 := y_1; VAL [f1_2=false, f2_3=false, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=-1, y_9=-1] [L46] 3 y_1 := temp_6 + 1; VAL [f1_2=false, f2_3=false, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=0, y_9=-1] [L117] FORK 0 fork 4, 4, 4, 4 thread4(); VAL [f1_2=false, f2_3=false, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=0, y_9=-1] [L103] 4 f1_10 := false; [L104] 4 f2_11 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=0, y_9=-1] [L106] FORK 4 fork 5, 5, 5, 5, 5 thread5(); VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=0, y_9=-1] [L107] FORK 4 fork 6, 6, 6, 6, 6, 6 thread6(); VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=0, 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_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=0, 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_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=0, y_9=-1] [L47] 3 f2_3 := true; VAL [f1_10=false, f1_2=false, 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] 2 f1_2 := 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] [L48] 3 assume f1_2; 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] [L49] 3 temp_7 := x_0; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=-1, temp_6=-1, temp_7=0, x_0=0, x_8=-1, y_1=0, y_9=-1] [L50] 3 x_0 := temp_7 + 1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=-1, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=0, y_9=-1] [L33] 2 assume f2_3; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=-1, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=0, y_9=-1] [L51] 3 f2_3 := false; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=-1, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=0, y_9=-1] [L34] 2 temp_5 := 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=1, x_8=-1, y_1=0, y_9=-1] [L35] 2 y_1 := temp_5 + 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=1, x_8=-1, y_1=1, y_9=-1] [L36] 2 f1_2 := 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] [L52] 3 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=1, x_8=-1, y_1=1, y_9=-1] [L37] 2 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] [L65] JOIN 2 join 2, 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=1, x_8=-1, y_1=1, y_9=-1] [L66] JOIN 3 join 3, 3, 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] [L118] JOIN 1 join 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=1, x_8=-1, y_1=1, y_9=-1] [L119] JOIN 4 join 4, 4, 4, 4; 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] [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_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 20.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 1839.1ms, OverallIterations: 6, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 966.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 320.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 38 SDtfs, 4 SDslu, 0 SDs, 0 SdLazy, 33 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 34.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=240occurred in iteration=5, InterpolantAutomatonStates: 15, 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: 23.4ms SsaConstructionTime, 102.3ms SatisfiabilityAnalysisTime, 178.3ms InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 137 ConstructedInterpolants, 0 QuantifiedInterpolants, 298 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 4/4 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...