/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-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-23 23:03:03,056 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-23 23:03:03,142 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-23 23:03:03,147 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-23 23:03:03,148 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-23 23:03:03,178 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-23 23:03:03,179 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-23 23:03:03,179 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-23 23:03:03,180 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-23 23:03:03,183 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-23 23:03:03,183 INFO L153 SettingsManager]: * Use SBE=true [2023-08-23 23:03:03,184 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-23 23:03:03,184 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-23 23:03:03,185 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-23 23:03:03,185 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-23 23:03:03,185 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-23 23:03:03,186 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-23 23:03:03,186 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-23 23:03:03,186 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-23 23:03:03,187 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-23 23:03:03,187 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-23 23:03:03,187 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-23 23:03:03,187 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-23 23:03:03,188 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-23 23:03:03,188 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-23 23:03:03,188 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-23 23:03:03,189 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-23 23:03:03,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 23:03:03,189 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-23 23:03:03,190 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-23 23:03:03,190 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-23 23:03:03,191 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-23 23:03:03,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-23 23:03:03,191 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-23 23:03:03,191 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-23 23:03:03,191 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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 [2023-08-23 23:03:03,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-23 23:03:03,552 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-23 23:03:03,555 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-23 23:03:03,556 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-23 23:03:03,556 INFO L274 PluginConnector]: CDTParser initialized [2023-08-23 23:03:03,557 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-08-23 23:03:04,753 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-23 23:03:05,016 INFO L384 CDTParser]: Found 1 translation units. [2023-08-23 23:03:05,016 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-08-23 23:03:05,032 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37084367e/0304de19b76246988265a106914a427f/FLAG36d108f13 [2023-08-23 23:03:05,044 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37084367e/0304de19b76246988265a106914a427f [2023-08-23 23:03:05,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-23 23:03:05,049 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-23 23:03:05,051 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-23 23:03:05,052 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-23 23:03:05,054 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-23 23:03:05,055 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 11:03:05" (1/1) ... [2023-08-23 23:03:05,056 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31d37712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:03:05, skipping insertion in model container [2023-08-23 23:03:05,056 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 11:03:05" (1/1) ... [2023-08-23 23:03:05,117 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-23 23:03:05,279 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2023-08-23 23:03:05,435 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 23:03:05,444 INFO L201 MainTranslator]: Completed pre-run [2023-08-23 23:03:05,453 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2023-08-23 23:03:05,461 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-23 23:03:05,463 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-23 23:03:05,492 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 23:03:05,519 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 23:03:05,520 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 23:03:05,528 INFO L206 MainTranslator]: Completed translation [2023-08-23 23:03:05,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:03:05 WrapperNode [2023-08-23 23:03:05,529 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-23 23:03:05,530 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-23 23:03:05,530 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-23 23:03:05,530 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-23 23:03:05,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:03:05" (1/1) ... [2023-08-23 23:03:05,549 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:03:05" (1/1) ... [2023-08-23 23:03:05,569 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 115 [2023-08-23 23:03:05,570 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-23 23:03:05,570 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-23 23:03:05,571 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-23 23:03:05,571 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-23 23:03:05,578 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:03:05" (1/1) ... [2023-08-23 23:03:05,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:03:05" (1/1) ... [2023-08-23 23:03:05,586 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:03:05" (1/1) ... [2023-08-23 23:03:05,586 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:03:05" (1/1) ... [2023-08-23 23:03:05,602 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:03:05" (1/1) ... [2023-08-23 23:03:05,604 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:03:05" (1/1) ... [2023-08-23 23:03:05,606 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:03:05" (1/1) ... [2023-08-23 23:03:05,607 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:03:05" (1/1) ... [2023-08-23 23:03:05,609 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-23 23:03:05,610 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-23 23:03:05,610 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-23 23:03:05,610 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-23 23:03:05,611 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:03:05" (1/1) ... [2023-08-23 23:03:05,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 23:03:05,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-23 23:03:05,650 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-23 23:03:05,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-23 23:03:05,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-23 23:03:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-23 23:03:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-23 23:03:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-23 23:03:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-23 23:03:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-23 23:03:05,697 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-23 23:03:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-23 23:03:05,698 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-23 23:03:05,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-23 23:03:05,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-23 23:03:05,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-23 23:03:05,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-23 23:03:05,701 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-23 23:03:05,849 INFO L236 CfgBuilder]: Building ICFG [2023-08-23 23:03:05,850 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-23 23:03:06,169 INFO L277 CfgBuilder]: Performing block encoding [2023-08-23 23:03:06,279 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-23 23:03:06,279 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-23 23:03:06,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 11:03:06 BoogieIcfgContainer [2023-08-23 23:03:06,281 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-23 23:03:06,284 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-23 23:03:06,284 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-23 23:03:06,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-23 23:03:06,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.08 11:03:05" (1/3) ... [2023-08-23 23:03:06,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11caf35a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 11:03:06, skipping insertion in model container [2023-08-23 23:03:06,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:03:05" (2/3) ... [2023-08-23 23:03:06,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11caf35a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 11:03:06, skipping insertion in model container [2023-08-23 23:03:06,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 11:03:06" (3/3) ... [2023-08-23 23:03:06,289 INFO L112 eAbstractionObserver]: Analyzing ICFG mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-08-23 23:03:06,304 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-23 23:03:06,305 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-23 23:03:06,305 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-23 23:03:06,352 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-23 23:03:06,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 92 transitions, 194 flow [2023-08-23 23:03:06,440 INFO L124 PetriNetUnfolderBase]: 2/90 cut-off events. [2023-08-23 23:03:06,440 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:03:06,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2023-08-23 23:03:06,449 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 92 transitions, 194 flow [2023-08-23 23:03:06,452 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 90 transitions, 186 flow [2023-08-23 23:03:06,455 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-23 23:03:06,463 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 90 transitions, 186 flow [2023-08-23 23:03:06,465 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 90 transitions, 186 flow [2023-08-23 23:03:06,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 186 flow [2023-08-23 23:03:06,485 INFO L124 PetriNetUnfolderBase]: 2/90 cut-off events. [2023-08-23 23:03:06,485 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:03:06,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2023-08-23 23:03:06,487 INFO L119 LiptonReduction]: Number of co-enabled transitions 1174 [2023-08-23 23:03:09,421 INFO L134 LiptonReduction]: Checked pairs total: 2779 [2023-08-23 23:03:09,421 INFO L136 LiptonReduction]: Total number of compositions: 84 [2023-08-23 23:03:09,433 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-23 23:03:09,438 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@12815a81, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-23 23:03:09,438 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-23 23:03:09,440 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-23 23:03:09,440 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-08-23 23:03:09,440 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:03:09,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:03:09,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-23 23:03:09,441 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 23:03:09,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:03:09,445 INFO L85 PathProgramCache]: Analyzing trace with hash 415334, now seen corresponding path program 1 times [2023-08-23 23:03:09,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:03:09,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419308227] [2023-08-23 23:03:09,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:03:09,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:03:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:03:09,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:03:09,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:03:09,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419308227] [2023-08-23 23:03:09,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419308227] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:03:09,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:03:09,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-23 23:03:09,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61011571] [2023-08-23 23:03:09,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:03:09,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 23:03:09,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:03:09,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 23:03:09,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 23:03:09,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 176 [2023-08-23 23:03:09,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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) [2023-08-23 23:03:09,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:03:09,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 176 [2023-08-23 23:03:09,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:03:09,902 INFO L124 PetriNetUnfolderBase]: 173/334 cut-off events. [2023-08-23 23:03:09,902 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-23 23:03:09,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 334 events. 173/334 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1418 event pairs, 20 based on Foata normal form. 0/310 useless extension candidates. Maximal degree in co-relation 640. Up to 250 conditions per place. [2023-08-23 23:03:09,906 INFO L140 encePairwiseOnDemand]: 173/176 looper letters, 23 selfloop transitions, 2 changer transitions 2/28 dead transitions. [2023-08-23 23:03:09,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 28 transitions, 119 flow [2023-08-23 23:03:09,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 23:03:09,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 23:03:09,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2023-08-23 23:03:09,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075757575757576 [2023-08-23 23:03:09,930 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 268 transitions. [2023-08-23 23:03:09,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 268 transitions. [2023-08-23 23:03:09,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:03:09,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 268 transitions. [2023-08-23 23:03:09,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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) [2023-08-23 23:03:09,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 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) [2023-08-23 23:03:09,944 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 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) [2023-08-23 23:03:09,946 INFO L175 Difference]: Start difference. First operand has 25 places, 18 transitions, 42 flow. Second operand 3 states and 268 transitions. [2023-08-23 23:03:09,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 28 transitions, 119 flow [2023-08-23 23:03:09,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 28 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-23 23:03:09,949 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 40 flow [2023-08-23 23:03:09,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2023-08-23 23:03:09,954 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2023-08-23 23:03:09,954 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 40 flow [2023-08-23 23:03:09,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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) [2023-08-23 23:03:09,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:03:09,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:03:09,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-23 23:03:09,955 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 23:03:09,955 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:03:09,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1361260582, now seen corresponding path program 1 times [2023-08-23 23:03:09,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:03:09,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653554682] [2023-08-23 23:03:09,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:03:09,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:03:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:03:10,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:03:10,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:03:10,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653554682] [2023-08-23 23:03:10,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653554682] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:03:10,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:03:10,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-23 23:03:10,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466966825] [2023-08-23 23:03:10,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:03:10,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 23:03:10,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:03:10,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 23:03:10,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 23:03:10,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 176 [2023-08-23 23:03:10,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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) [2023-08-23 23:03:10,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:03:10,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 176 [2023-08-23 23:03:10,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:03:10,200 INFO L124 PetriNetUnfolderBase]: 121/219 cut-off events. [2023-08-23 23:03:10,201 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-08-23 23:03:10,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 219 events. 121/219 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 728 event pairs, 41 based on Foata normal form. 8/226 useless extension candidates. Maximal degree in co-relation 465. Up to 157 conditions per place. [2023-08-23 23:03:10,207 INFO L140 encePairwiseOnDemand]: 173/176 looper letters, 18 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2023-08-23 23:03:10,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 21 transitions, 92 flow [2023-08-23 23:03:10,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 23:03:10,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 23:03:10,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 255 transitions. [2023-08-23 23:03:10,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48295454545454547 [2023-08-23 23:03:10,210 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 255 transitions. [2023-08-23 23:03:10,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 255 transitions. [2023-08-23 23:03:10,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:03:10,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 255 transitions. [2023-08-23 23:03:10,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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) [2023-08-23 23:03:10,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 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) [2023-08-23 23:03:10,213 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 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) [2023-08-23 23:03:10,214 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 40 flow. Second operand 3 states and 255 transitions. [2023-08-23 23:03:10,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 21 transitions, 92 flow [2023-08-23 23:03:10,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 21 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-23 23:03:10,215 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 44 flow [2023-08-23 23:03:10,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2023-08-23 23:03:10,216 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2023-08-23 23:03:10,216 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 44 flow [2023-08-23 23:03:10,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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) [2023-08-23 23:03:10,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:03:10,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:03:10,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-23 23:03:10,225 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 23:03:10,227 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:03:10,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1832712504, now seen corresponding path program 1 times [2023-08-23 23:03:10,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:03:10,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921660025] [2023-08-23 23:03:10,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:03:10,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:03:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:03:10,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:03:10,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:03:10,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921660025] [2023-08-23 23:03:10,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921660025] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:03:10,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:03:10,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:03:10,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999926277] [2023-08-23 23:03:10,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:03:10,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:03:10,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:03:10,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:03:10,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:03:10,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 176 [2023-08-23 23:03:10,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 77.25) internal successors, (309), 4 states have internal predecessors, (309), 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) [2023-08-23 23:03:10,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:03:10,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 176 [2023-08-23 23:03:10,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:03:10,586 INFO L124 PetriNetUnfolderBase]: 72/156 cut-off events. [2023-08-23 23:03:10,586 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-23 23:03:10,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 352 conditions, 156 events. 72/156 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 540 event pairs, 15 based on Foata normal form. 24/179 useless extension candidates. Maximal degree in co-relation 341. Up to 68 conditions per place. [2023-08-23 23:03:10,588 INFO L140 encePairwiseOnDemand]: 171/176 looper letters, 22 selfloop transitions, 3 changer transitions 17/43 dead transitions. [2023-08-23 23:03:10,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 43 transitions, 193 flow [2023-08-23 23:03:10,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:03:10,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:03:10,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 419 transitions. [2023-08-23 23:03:10,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47613636363636364 [2023-08-23 23:03:10,590 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 419 transitions. [2023-08-23 23:03:10,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 419 transitions. [2023-08-23 23:03:10,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:03:10,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 419 transitions. [2023-08-23 23:03:10,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 83.8) internal successors, (419), 5 states have internal predecessors, (419), 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) [2023-08-23 23:03:10,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 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) [2023-08-23 23:03:10,594 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 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) [2023-08-23 23:03:10,595 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 44 flow. Second operand 5 states and 419 transitions. [2023-08-23 23:03:10,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 43 transitions, 193 flow [2023-08-23 23:03:10,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 43 transitions, 183 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-23 23:03:10,596 INFO L231 Difference]: Finished difference. Result has 29 places, 18 transitions, 67 flow [2023-08-23 23:03:10,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=67, PETRI_PLACES=29, PETRI_TRANSITIONS=18} [2023-08-23 23:03:10,597 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 4 predicate places. [2023-08-23 23:03:10,600 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 18 transitions, 67 flow [2023-08-23 23:03:10,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.25) internal successors, (309), 4 states have internal predecessors, (309), 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) [2023-08-23 23:03:10,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:03:10,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:03:10,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-23 23:03:10,601 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 23:03:10,602 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:03:10,602 INFO L85 PathProgramCache]: Analyzing trace with hash 685721859, now seen corresponding path program 1 times [2023-08-23 23:03:10,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:03:10,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361405590] [2023-08-23 23:03:10,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:03:10,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:03:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:03:10,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:03:10,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:03:10,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361405590] [2023-08-23 23:03:10,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361405590] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:03:10,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:03:10,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:03:10,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807010447] [2023-08-23 23:03:10,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:03:10,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:03:10,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:03:10,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:03:10,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:03:10,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 176 [2023-08-23 23:03:10,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 18 transitions, 67 flow. Second operand has 5 states, 5 states have (on average 77.4) internal successors, (387), 5 states have internal predecessors, (387), 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) [2023-08-23 23:03:10,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:03:10,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 176 [2023-08-23 23:03:10,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:03:10,932 INFO L124 PetriNetUnfolderBase]: 28/75 cut-off events. [2023-08-23 23:03:10,932 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-08-23 23:03:10,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 75 events. 28/75 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 193 event pairs, 12 based on Foata normal form. 9/83 useless extension candidates. Maximal degree in co-relation 197. Up to 34 conditions per place. [2023-08-23 23:03:10,934 INFO L140 encePairwiseOnDemand]: 171/176 looper letters, 20 selfloop transitions, 5 changer transitions 9/35 dead transitions. [2023-08-23 23:03:10,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 35 transitions, 183 flow [2023-08-23 23:03:10,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 23:03:10,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 23:03:10,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 486 transitions. [2023-08-23 23:03:10,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4602272727272727 [2023-08-23 23:03:10,936 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 486 transitions. [2023-08-23 23:03:10,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 486 transitions. [2023-08-23 23:03:10,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:03:10,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 486 transitions. [2023-08-23 23:03:10,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 81.0) internal successors, (486), 6 states have internal predecessors, (486), 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) [2023-08-23 23:03:10,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 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) [2023-08-23 23:03:10,940 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 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) [2023-08-23 23:03:10,940 INFO L175 Difference]: Start difference. First operand has 29 places, 18 transitions, 67 flow. Second operand 6 states and 486 transitions. [2023-08-23 23:03:10,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 35 transitions, 183 flow [2023-08-23 23:03:10,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 35 transitions, 164 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-23 23:03:10,942 INFO L231 Difference]: Finished difference. Result has 32 places, 18 transitions, 74 flow [2023-08-23 23:03:10,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=74, PETRI_PLACES=32, PETRI_TRANSITIONS=18} [2023-08-23 23:03:10,943 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 7 predicate places. [2023-08-23 23:03:10,943 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 18 transitions, 74 flow [2023-08-23 23:03:10,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.4) internal successors, (387), 5 states have internal predecessors, (387), 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) [2023-08-23 23:03:10,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:03:10,944 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:03:10,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-23 23:03:10,944 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 23:03:10,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:03:10,945 INFO L85 PathProgramCache]: Analyzing trace with hash -729209633, now seen corresponding path program 1 times [2023-08-23 23:03:10,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:03:10,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514124069] [2023-08-23 23:03:10,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:03:10,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:03:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:03:11,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:03:11,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:03:11,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514124069] [2023-08-23 23:03:11,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514124069] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:03:11,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:03:11,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:03:11,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094694102] [2023-08-23 23:03:11,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:03:11,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:03:11,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:03:11,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:03:11,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:03:11,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 176 [2023-08-23 23:03:11,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 18 transitions, 74 flow. Second operand has 5 states, 5 states have (on average 78.0) internal successors, (390), 5 states have internal predecessors, (390), 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) [2023-08-23 23:03:11,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:03:11,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 176 [2023-08-23 23:03:11,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:03:11,584 INFO L124 PetriNetUnfolderBase]: 26/88 cut-off events. [2023-08-23 23:03:11,585 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2023-08-23 23:03:11,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 88 events. 26/88 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 273 event pairs, 0 based on Foata normal form. 1/89 useless extension candidates. Maximal degree in co-relation 239. Up to 30 conditions per place. [2023-08-23 23:03:11,586 INFO L140 encePairwiseOnDemand]: 170/176 looper letters, 26 selfloop transitions, 6 changer transitions 13/46 dead transitions. [2023-08-23 23:03:11,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 46 transitions, 294 flow [2023-08-23 23:03:11,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 23:03:11,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 23:03:11,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 490 transitions. [2023-08-23 23:03:11,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4640151515151515 [2023-08-23 23:03:11,588 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 490 transitions. [2023-08-23 23:03:11,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 490 transitions. [2023-08-23 23:03:11,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:03:11,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 490 transitions. [2023-08-23 23:03:11,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 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) [2023-08-23 23:03:11,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 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) [2023-08-23 23:03:11,594 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 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) [2023-08-23 23:03:11,595 INFO L175 Difference]: Start difference. First operand has 32 places, 18 transitions, 74 flow. Second operand 6 states and 490 transitions. [2023-08-23 23:03:11,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 46 transitions, 294 flow [2023-08-23 23:03:11,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 46 transitions, 248 flow, removed 15 selfloop flow, removed 5 redundant places. [2023-08-23 23:03:11,599 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 99 flow [2023-08-23 23:03:11,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=99, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2023-08-23 23:03:11,601 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 8 predicate places. [2023-08-23 23:03:11,601 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 99 flow [2023-08-23 23:03:11,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 78.0) internal successors, (390), 5 states have internal predecessors, (390), 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) [2023-08-23 23:03:11,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:03:11,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:03:11,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-23 23:03:11,601 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 23:03:11,602 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:03:11,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1488311767, now seen corresponding path program 2 times [2023-08-23 23:03:11,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:03:11,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954067874] [2023-08-23 23:03:11,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:03:11,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:03:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:03:11,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:03:11,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:03:11,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954067874] [2023-08-23 23:03:11,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954067874] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:03:11,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:03:11,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:03:11,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193735949] [2023-08-23 23:03:11,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:03:11,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:03:11,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:03:11,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:03:11,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:03:11,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 176 [2023-08-23 23:03:11,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 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) [2023-08-23 23:03:11,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:03:11,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 176 [2023-08-23 23:03:11,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:03:11,851 INFO L124 PetriNetUnfolderBase]: 37/111 cut-off events. [2023-08-23 23:03:11,851 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2023-08-23 23:03:11,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 111 events. 37/111 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 362 event pairs, 6 based on Foata normal form. 1/112 useless extension candidates. Maximal degree in co-relation 351. Up to 44 conditions per place. [2023-08-23 23:03:11,852 INFO L140 encePairwiseOnDemand]: 170/176 looper letters, 20 selfloop transitions, 7 changer transitions 17/44 dead transitions. [2023-08-23 23:03:11,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 44 transitions, 277 flow [2023-08-23 23:03:11,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:03:11,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:03:11,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 399 transitions. [2023-08-23 23:03:11,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45340909090909093 [2023-08-23 23:03:11,854 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 399 transitions. [2023-08-23 23:03:11,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 399 transitions. [2023-08-23 23:03:11,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:03:11,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 399 transitions. [2023-08-23 23:03:11,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 79.8) internal successors, (399), 5 states have internal predecessors, (399), 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) [2023-08-23 23:03:11,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 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) [2023-08-23 23:03:11,857 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 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) [2023-08-23 23:03:11,857 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 99 flow. Second operand 5 states and 399 transitions. [2023-08-23 23:03:11,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 44 transitions, 277 flow [2023-08-23 23:03:11,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 44 transitions, 275 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-23 23:03:11,859 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 109 flow [2023-08-23 23:03:11,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2023-08-23 23:03:11,860 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 10 predicate places. [2023-08-23 23:03:11,860 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 109 flow [2023-08-23 23:03:11,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 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) [2023-08-23 23:03:11,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:03:11,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:03:11,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-23 23:03:11,861 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 23:03:11,861 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:03:11,861 INFO L85 PathProgramCache]: Analyzing trace with hash 571170383, now seen corresponding path program 3 times [2023-08-23 23:03:11,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:03:11,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502853020] [2023-08-23 23:03:11,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:03:11,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:03:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 23:03:11,903 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-23 23:03:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 23:03:11,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-23 23:03:11,950 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-23 23:03:11,950 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-08-23 23:03:11,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-08-23 23:03:11,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-08-23 23:03:11,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-08-23 23:03:11,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-23 23:03:11,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-23 23:03:11,953 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2023-08-23 23:03:11,957 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-23 23:03:11,957 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-23 23:03:12,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.08 11:03:12 BasicIcfg [2023-08-23 23:03:12,016 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-23 23:03:12,016 INFO L158 Benchmark]: Toolchain (without parser) took 6968.70ms. Allocated memory was 369.1MB in the beginning and 480.2MB in the end (delta: 111.1MB). Free memory was 343.6MB in the beginning and 321.5MB in the end (delta: 22.2MB). Peak memory consumption was 134.1MB. Max. memory is 16.0GB. [2023-08-23 23:03:12,025 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 369.1MB. Free memory was 345.9MB in the beginning and 345.8MB in the end (delta: 169.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-23 23:03:12,026 INFO L158 Benchmark]: CACSL2BoogieTranslator took 477.84ms. Allocated memory is still 369.1MB. Free memory was 343.6MB in the beginning and 320.5MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-23 23:03:12,026 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.03ms. Allocated memory is still 369.1MB. Free memory was 320.5MB in the beginning and 318.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-23 23:03:12,026 INFO L158 Benchmark]: Boogie Preprocessor took 39.10ms. Allocated memory is still 369.1MB. Free memory was 318.5MB in the beginning and 316.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-23 23:03:12,027 INFO L158 Benchmark]: RCFGBuilder took 671.26ms. Allocated memory is still 369.1MB. Free memory was 316.4MB in the beginning and 283.6MB in the end (delta: 32.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. [2023-08-23 23:03:12,028 INFO L158 Benchmark]: TraceAbstraction took 5732.12ms. Allocated memory was 369.1MB in the beginning and 480.2MB in the end (delta: 111.1MB). Free memory was 282.9MB in the beginning and 321.5MB in the end (delta: -38.6MB). Peak memory consumption was 73.3MB. Max. memory is 16.0GB. [2023-08-23 23:03:12,031 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 369.1MB. Free memory was 345.9MB in the beginning and 345.8MB in the end (delta: 169.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 477.84ms. Allocated memory is still 369.1MB. Free memory was 343.6MB in the beginning and 320.5MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 40.03ms. Allocated memory is still 369.1MB. Free memory was 320.5MB in the beginning and 318.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 39.10ms. Allocated memory is still 369.1MB. Free memory was 318.5MB in the beginning and 316.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 671.26ms. Allocated memory is still 369.1MB. Free memory was 316.4MB in the beginning and 283.6MB in the end (delta: 32.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. * TraceAbstraction took 5732.12ms. Allocated memory was 369.1MB in the beginning and 480.2MB in the end (delta: 111.1MB). Free memory was 282.9MB in the beginning and 321.5MB in the end (delta: -38.6MB). Peak memory consumption was 73.3MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 95 PlacesBefore, 25 PlacesAfterwards, 90 TransitionsBefore, 18 TransitionsAfterwards, 1174 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 84 TotalNumberOfCompositions, 2779 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1264, independent: 1140, independent conditional: 0, independent unconditional: 1140, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 649, independent: 622, independent conditional: 0, independent unconditional: 622, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1264, independent: 518, independent conditional: 0, independent unconditional: 518, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 649, unknown conditional: 0, unknown unconditional: 649] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 34, Positive conditional cache size: 0, Positive unconditional cache size: 34, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$read_delayed; [L732] 0 int *z$read_delayed_var; [L733] 0 int z$w_buff0; [L734] 0 _Bool z$w_buff0_used; [L735] 0 int z$w_buff1; [L736] 0 _Bool z$w_buff1_used; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L817] 0 pthread_t t897; [L818] FCALL, FORK 0 pthread_create(&t897, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t897, ((void *)0), P0, ((void *)0))=-2, t897={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L742] 1 z$w_buff1 = z$w_buff0 [L743] 1 z$w_buff0 = 1 [L744] 1 z$w_buff1_used = z$w_buff0_used [L745] 1 z$w_buff0_used = (_Bool)1 [L746] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L746] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L747] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L748] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L749] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L819] 0 pthread_t t898; [L820] FCALL, FORK 0 pthread_create(&t898, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t898, ((void *)0), P1, ((void *)0))=-1, t897={5:0}, t898={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 y = 1 [L776] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L779] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 2 z$flush_delayed = weak$$choice2 [L782] 2 z$mem_tmp = z [L783] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L784] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L785] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L786] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L787] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L789] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 __unbuffered_p1_EBX = z [L791] 2 z = z$flush_delayed ? z$mem_tmp : z [L792] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L795] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L796] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L797] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L798] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L799] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L824] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L824] RET 0 assume_abort_if_not(main$tmp_guard0) [L826] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L828] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L829] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L830] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t897={5:0}, t898={3:0}, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L833] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L835] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 820]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 112 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.6s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 78 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 345 IncrementalHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 1 mSDtfsCounter, 345 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=6, InterpolantAutomatonStates: 28, 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.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 285 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 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! [2023-08-23 23:03:12,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...