/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 --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 05:29:54,250 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 05:29:54,284 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-24 05:29:54,289 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 05:29:54,289 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 05:29:54,307 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 05:29:54,308 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 05:29:54,308 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 05:29:54,309 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 05:29:54,311 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 05:29:54,311 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 05:29:54,312 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 05:29:54,312 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 05:29:54,313 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 05:29:54,313 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 05:29:54,313 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 05:29:54,313 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 05:29:54,313 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 05:29:54,313 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 05:29:54,314 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 05:29:54,314 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 05:29:54,314 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 05:29:54,314 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 05:29:54,314 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 05:29:54,315 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 05:29:54,315 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 05:29:54,315 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 05:29:54,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:29:54,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 05:29:54,315 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 05:29:54,316 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 05:29:54,316 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 05:29:54,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 05:29:54,316 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 05:29:54,316 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 05:29:54,316 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-24 05:29:54,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 05:29:54,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 05:29:54,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 05:29:54,591 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 05:29:54,592 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 05:29:54,593 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i [2023-08-24 05:29:55,715 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 05:29:55,934 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 05:29:55,935 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i [2023-08-24 05:29:55,945 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c3a81187/4841a234db084e7b9b896dbc1d0ed246/FLAG795d2d2ef [2023-08-24 05:29:55,956 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c3a81187/4841a234db084e7b9b896dbc1d0ed246 [2023-08-24 05:29:55,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 05:29:55,959 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 05:29:55,968 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 05:29:55,968 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 05:29:55,970 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 05:29:55,970 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:29:55" (1/1) ... [2023-08-24 05:29:55,971 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@757da8ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:55, skipping insertion in model container [2023-08-24 05:29:55,971 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:29:55" (1/1) ... [2023-08-24 05:29:56,010 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 05:29:56,125 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/mix041_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-24 05:29:56,290 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:29:56,298 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 05:29:56,308 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/mix041_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-24 05:29:56,323 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:29:56,324 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:29:56,359 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:29:56,386 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:29:56,386 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:29:56,391 INFO L206 MainTranslator]: Completed translation [2023-08-24 05:29:56,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:56 WrapperNode [2023-08-24 05:29:56,393 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 05:29:56,394 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 05:29:56,394 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 05:29:56,394 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 05:29:56,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:56" (1/1) ... [2023-08-24 05:29:56,423 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:56" (1/1) ... [2023-08-24 05:29:56,451 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 114 [2023-08-24 05:29:56,451 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 05:29:56,452 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 05:29:56,452 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 05:29:56,452 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 05:29:56,458 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:56" (1/1) ... [2023-08-24 05:29:56,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:56" (1/1) ... [2023-08-24 05:29:56,470 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:56" (1/1) ... [2023-08-24 05:29:56,471 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:56" (1/1) ... [2023-08-24 05:29:56,475 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:56" (1/1) ... [2023-08-24 05:29:56,476 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:56" (1/1) ... [2023-08-24 05:29:56,477 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:56" (1/1) ... [2023-08-24 05:29:56,478 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:56" (1/1) ... [2023-08-24 05:29:56,480 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 05:29:56,492 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 05:29:56,493 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 05:29:56,493 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 05:29:56,493 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:56" (1/1) ... [2023-08-24 05:29:56,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:29:56,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 05:29:56,613 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-24 05:29:56,619 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-24 05:29:56,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 05:29:56,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 05:29:56,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 05:29:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 05:29:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 05:29:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 05:29:56,642 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 05:29:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 05:29:56,642 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 05:29:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 05:29:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 05:29:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 05:29:56,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 05:29:56,643 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 05:29:56,732 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 05:29:56,733 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 05:29:56,916 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 05:29:56,996 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 05:29:56,996 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 05:29:56,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:29:56 BoogieIcfgContainer [2023-08-24 05:29:56,999 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 05:29:57,000 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 05:29:57,000 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 05:29:57,002 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 05:29:57,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 05:29:55" (1/3) ... [2023-08-24 05:29:57,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40795b9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:29:57, skipping insertion in model container [2023-08-24 05:29:57,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:56" (2/3) ... [2023-08-24 05:29:57,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40795b9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:29:57, skipping insertion in model container [2023-08-24 05:29:57,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:29:56" (3/3) ... [2023-08-24 05:29:57,004 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_power.oepc_pso.oepc_rmo.oepc.i [2023-08-24 05:29:57,016 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 05:29:57,017 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 05:29:57,017 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 05:29:57,062 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 05:29:57,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 91 transitions, 192 flow [2023-08-24 05:29:57,134 INFO L124 PetriNetUnfolderBase]: 2/89 cut-off events. [2023-08-24 05:29:57,134 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:29:57,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2023-08-24 05:29:57,139 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 91 transitions, 192 flow [2023-08-24 05:29:57,142 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 89 transitions, 184 flow [2023-08-24 05:29:57,145 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 05:29:57,154 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 89 transitions, 184 flow [2023-08-24 05:29:57,157 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 89 transitions, 184 flow [2023-08-24 05:29:57,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 184 flow [2023-08-24 05:29:57,183 INFO L124 PetriNetUnfolderBase]: 2/89 cut-off events. [2023-08-24 05:29:57,183 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:29:57,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2023-08-24 05:29:57,185 INFO L119 LiptonReduction]: Number of co-enabled transitions 1174 [2023-08-24 05:29:59,416 INFO L134 LiptonReduction]: Checked pairs total: 3011 [2023-08-24 05:29:59,416 INFO L136 LiptonReduction]: Total number of compositions: 79 [2023-08-24 05:29:59,425 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 05:29:59,429 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;@512c268e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 05:29:59,429 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-24 05:29:59,430 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 05:29:59,430 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-24 05:29:59,430 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:29:59,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:59,431 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-24 05:29:59,431 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-24 05:29:59,434 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:59,434 INFO L85 PathProgramCache]: Analyzing trace with hash 408543, now seen corresponding path program 1 times [2023-08-24 05:29:59,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:59,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224268359] [2023-08-24 05:29:59,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:59,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:59,645 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-24 05:29:59,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:59,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224268359] [2023-08-24 05:29:59,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224268359] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:59,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:59,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:29:59,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548241514] [2023-08-24 05:29:59,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:59,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:29:59,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:59,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:29:59,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:29:59,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 170 [2023-08-24 05:29:59,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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-24 05:29:59,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:59,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 170 [2023-08-24 05:29:59,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:59,819 INFO L124 PetriNetUnfolderBase]: 249/470 cut-off events. [2023-08-24 05:29:59,820 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 05:29:59,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 910 conditions, 470 events. 249/470 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2148 event pairs, 30 based on Foata normal form. 24/446 useless extension candidates. Maximal degree in co-relation 900. Up to 352 conditions per place. [2023-08-24 05:29:59,825 INFO L140 encePairwiseOnDemand]: 166/170 looper letters, 25 selfloop transitions, 2 changer transitions 4/32 dead transitions. [2023-08-24 05:29:59,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 32 transitions, 135 flow [2023-08-24 05:29:59,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:29:59,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:29:59,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 271 transitions. [2023-08-24 05:29:59,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5313725490196078 [2023-08-24 05:29:59,837 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 271 transitions. [2023-08-24 05:29:59,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 271 transitions. [2023-08-24 05:29:59,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:59,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 271 transitions. [2023-08-24 05:29:59,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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-24 05:29:59,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 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-24 05:29:59,845 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 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-24 05:29:59,847 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 48 flow. Second operand 3 states and 271 transitions. [2023-08-24 05:29:59,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 32 transitions, 135 flow [2023-08-24 05:29:59,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 32 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:29:59,853 INFO L231 Difference]: Finished difference. Result has 26 places, 17 transitions, 42 flow [2023-08-24 05:29:59,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2023-08-24 05:29:59,857 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2023-08-24 05:29:59,857 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 17 transitions, 42 flow [2023-08-24 05:29:59,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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-24 05:29:59,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:59,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:59,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 05:29:59,858 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-24 05:29:59,858 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:59,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1756126342, now seen corresponding path program 1 times [2023-08-24 05:29:59,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:59,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811539208] [2023-08-24 05:29:59,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:59,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:00,048 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-24 05:30:00,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:00,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811539208] [2023-08-24 05:30:00,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811539208] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:00,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:00,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:30:00,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402847882] [2023-08-24 05:30:00,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:00,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:30:00,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:00,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:30:00,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:30:00,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 170 [2023-08-24 05:30:00,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 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-24 05:30:00,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:00,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 170 [2023-08-24 05:30:00,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:00,191 INFO L124 PetriNetUnfolderBase]: 332/603 cut-off events. [2023-08-24 05:30:00,192 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-08-24 05:30:00,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1258 conditions, 603 events. 332/603 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2739 event pairs, 86 based on Foata normal form. 45/648 useless extension candidates. Maximal degree in co-relation 1248. Up to 321 conditions per place. [2023-08-24 05:30:00,199 INFO L140 encePairwiseOnDemand]: 163/170 looper letters, 23 selfloop transitions, 5 changer transitions 18/46 dead transitions. [2023-08-24 05:30:00,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 46 transitions, 198 flow [2023-08-24 05:30:00,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:30:00,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:30:00,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 403 transitions. [2023-08-24 05:30:00,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47411764705882353 [2023-08-24 05:30:00,206 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 403 transitions. [2023-08-24 05:30:00,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 403 transitions. [2023-08-24 05:30:00,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:00,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 403 transitions. [2023-08-24 05:30:00,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 80.6) internal successors, (403), 5 states have internal predecessors, (403), 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-24 05:30:00,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 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-24 05:30:00,213 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 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-24 05:30:00,214 INFO L175 Difference]: Start difference. First operand has 26 places, 17 transitions, 42 flow. Second operand 5 states and 403 transitions. [2023-08-24 05:30:00,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 46 transitions, 198 flow [2023-08-24 05:30:00,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 46 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:30:00,215 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 82 flow [2023-08-24 05:30:00,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, 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=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-08-24 05:30:00,217 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 3 predicate places. [2023-08-24 05:30:00,217 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 82 flow [2023-08-24 05:30:00,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 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-24 05:30:00,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:00,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:30:00,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 05:30:00,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-24 05:30:00,226 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:00,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1394633125, now seen corresponding path program 1 times [2023-08-24 05:30:00,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:00,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555331011] [2023-08-24 05:30:00,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:00,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:00,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:00,372 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-24 05:30:00,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:00,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555331011] [2023-08-24 05:30:00,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555331011] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:00,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:00,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:30:00,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142105350] [2023-08-24 05:30:00,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:00,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:30:00,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:00,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:30:00,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:30:00,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 170 [2023-08-24 05:30:00,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 82 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-24 05:30:00,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:00,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 170 [2023-08-24 05:30:00,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:00,458 INFO L124 PetriNetUnfolderBase]: 258/490 cut-off events. [2023-08-24 05:30:00,458 INFO L125 PetriNetUnfolderBase]: For 316/321 co-relation queries the response was YES. [2023-08-24 05:30:00,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1284 conditions, 490 events. 258/490 cut-off events. For 316/321 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2181 event pairs, 97 based on Foata normal form. 39/524 useless extension candidates. Maximal degree in co-relation 1270. Up to 339 conditions per place. [2023-08-24 05:30:00,460 INFO L140 encePairwiseOnDemand]: 166/170 looper letters, 20 selfloop transitions, 3 changer transitions 13/38 dead transitions. [2023-08-24 05:30:00,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 38 transitions, 208 flow [2023-08-24 05:30:00,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:30:00,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:30:00,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 409 transitions. [2023-08-24 05:30:00,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4811764705882353 [2023-08-24 05:30:00,461 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 409 transitions. [2023-08-24 05:30:00,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 409 transitions. [2023-08-24 05:30:00,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:00,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 409 transitions. [2023-08-24 05:30:00,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 81.8) internal successors, (409), 5 states have internal predecessors, (409), 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-24 05:30:00,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 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-24 05:30:00,464 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 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-24 05:30:00,464 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 82 flow. Second operand 5 states and 409 transitions. [2023-08-24 05:30:00,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 38 transitions, 208 flow [2023-08-24 05:30:00,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 38 transitions, 188 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-24 05:30:00,466 INFO L231 Difference]: Finished difference. Result has 33 places, 20 transitions, 83 flow [2023-08-24 05:30:00,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=83, PETRI_PLACES=33, PETRI_TRANSITIONS=20} [2023-08-24 05:30:00,467 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2023-08-24 05:30:00,467 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 20 transitions, 83 flow [2023-08-24 05:30:00,467 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-24 05:30:00,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:00,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:30:00,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 05:30:00,467 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-24 05:30:00,468 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:00,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1233607448, now seen corresponding path program 1 times [2023-08-24 05:30:00,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:00,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273890850] [2023-08-24 05:30:00,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:00,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:00,565 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-24 05:30:00,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:00,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273890850] [2023-08-24 05:30:00,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273890850] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:00,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:00,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:30:00,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140967667] [2023-08-24 05:30:00,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:00,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:30:00,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:00,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:30:00,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:30:00,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 170 [2023-08-24 05:30:00,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 20 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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-24 05:30:00,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:00,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 170 [2023-08-24 05:30:00,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:00,617 INFO L124 PetriNetUnfolderBase]: 73/179 cut-off events. [2023-08-24 05:30:00,618 INFO L125 PetriNetUnfolderBase]: For 95/96 co-relation queries the response was YES. [2023-08-24 05:30:00,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 179 events. 73/179 cut-off events. For 95/96 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 644 event pairs, 21 based on Foata normal form. 23/201 useless extension candidates. Maximal degree in co-relation 476. Up to 127 conditions per place. [2023-08-24 05:30:00,619 INFO L140 encePairwiseOnDemand]: 166/170 looper letters, 27 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2023-08-24 05:30:00,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 32 transitions, 187 flow [2023-08-24 05:30:00,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:30:00,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:30:00,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 255 transitions. [2023-08-24 05:30:00,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-24 05:30:00,620 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 255 transitions. [2023-08-24 05:30:00,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 255 transitions. [2023-08-24 05:30:00,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:00,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 255 transitions. [2023-08-24 05:30:00,621 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-24 05:30:00,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 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-24 05:30:00,622 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 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-24 05:30:00,622 INFO L175 Difference]: Start difference. First operand has 33 places, 20 transitions, 83 flow. Second operand 3 states and 255 transitions. [2023-08-24 05:30:00,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 32 transitions, 187 flow [2023-08-24 05:30:00,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 32 transitions, 171 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-24 05:30:00,626 INFO L231 Difference]: Finished difference. Result has 29 places, 22 transitions, 90 flow [2023-08-24 05:30:00,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=29, PETRI_TRANSITIONS=22} [2023-08-24 05:30:00,627 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2023-08-24 05:30:00,627 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 22 transitions, 90 flow [2023-08-24 05:30:00,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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-24 05:30:00,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:00,628 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:30:00,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 05:30:00,628 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-24 05:30:00,628 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:00,628 INFO L85 PathProgramCache]: Analyzing trace with hash 34550546, now seen corresponding path program 1 times [2023-08-24 05:30:00,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:00,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088353756] [2023-08-24 05:30:00,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:00,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:00,768 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-24 05:30:00,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:00,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088353756] [2023-08-24 05:30:00,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088353756] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:00,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:00,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:30:00,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167609] [2023-08-24 05:30:00,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:00,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:30:00,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:00,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:30:00,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:30:00,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 170 [2023-08-24 05:30:00,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 79.25) internal successors, (317), 4 states have internal predecessors, (317), 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-24 05:30:00,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:00,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 170 [2023-08-24 05:30:00,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:00,817 INFO L124 PetriNetUnfolderBase]: 31/90 cut-off events. [2023-08-24 05:30:00,817 INFO L125 PetriNetUnfolderBase]: For 19/20 co-relation queries the response was YES. [2023-08-24 05:30:00,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 90 events. 31/90 cut-off events. For 19/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 256 event pairs, 13 based on Foata normal form. 14/103 useless extension candidates. Maximal degree in co-relation 259. Up to 47 conditions per place. [2023-08-24 05:30:00,817 INFO L140 encePairwiseOnDemand]: 166/170 looper letters, 24 selfloop transitions, 5 changer transitions 1/32 dead transitions. [2023-08-24 05:30:00,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 32 transitions, 186 flow [2023-08-24 05:30:00,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:30:00,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:30:00,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 331 transitions. [2023-08-24 05:30:00,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48676470588235293 [2023-08-24 05:30:00,818 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 331 transitions. [2023-08-24 05:30:00,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 331 transitions. [2023-08-24 05:30:00,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:00,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 331 transitions. [2023-08-24 05:30:00,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 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-24 05:30:00,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 170.0) internal successors, (850), 5 states have internal predecessors, (850), 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-24 05:30:00,821 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 170.0) internal successors, (850), 5 states have internal predecessors, (850), 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-24 05:30:00,821 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 90 flow. Second operand 4 states and 331 transitions. [2023-08-24 05:30:00,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 32 transitions, 186 flow [2023-08-24 05:30:00,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 32 transitions, 170 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-24 05:30:00,822 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 94 flow [2023-08-24 05:30:00,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2023-08-24 05:30:00,822 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 3 predicate places. [2023-08-24 05:30:00,822 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 94 flow [2023-08-24 05:30:00,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.25) internal successors, (317), 4 states have internal predecessors, (317), 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-24 05:30:00,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:00,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:30:00,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 05:30:00,823 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-24 05:30:00,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:00,823 INFO L85 PathProgramCache]: Analyzing trace with hash 104746922, now seen corresponding path program 1 times [2023-08-24 05:30:00,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:00,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457136439] [2023-08-24 05:30:00,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:00,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:01,312 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-24 05:30:01,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:01,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457136439] [2023-08-24 05:30:01,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457136439] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:01,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:01,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:30:01,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969687085] [2023-08-24 05:30:01,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:01,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 05:30:01,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:01,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 05:30:01,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-24 05:30:01,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 170 [2023-08-24 05:30:01,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 94 flow. Second operand has 7 states, 7 states have (on average 72.28571428571429) internal successors, (506), 7 states have internal predecessors, (506), 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-24 05:30:01,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:01,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 170 [2023-08-24 05:30:01,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:01,463 INFO L124 PetriNetUnfolderBase]: 34/115 cut-off events. [2023-08-24 05:30:01,463 INFO L125 PetriNetUnfolderBase]: For 111/111 co-relation queries the response was YES. [2023-08-24 05:30:01,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 115 events. 34/115 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 405 event pairs, 0 based on Foata normal form. 1/116 useless extension candidates. Maximal degree in co-relation 343. Up to 42 conditions per place. [2023-08-24 05:30:01,464 INFO L140 encePairwiseOnDemand]: 162/170 looper letters, 27 selfloop transitions, 5 changer transitions 18/52 dead transitions. [2023-08-24 05:30:01,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 52 transitions, 334 flow [2023-08-24 05:30:01,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 05:30:01,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 05:30:01,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 601 transitions. [2023-08-24 05:30:01,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44191176470588234 [2023-08-24 05:30:01,465 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 601 transitions. [2023-08-24 05:30:01,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 601 transitions. [2023-08-24 05:30:01,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:01,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 601 transitions. [2023-08-24 05:30:01,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 75.125) internal successors, (601), 8 states have internal predecessors, (601), 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-24 05:30:01,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 170.0) internal successors, (1530), 9 states have internal predecessors, (1530), 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-24 05:30:01,468 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 170.0) internal successors, (1530), 9 states have internal predecessors, (1530), 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-24 05:30:01,468 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 94 flow. Second operand 8 states and 601 transitions. [2023-08-24 05:30:01,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 52 transitions, 334 flow [2023-08-24 05:30:01,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 52 transitions, 306 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-24 05:30:01,469 INFO L231 Difference]: Finished difference. Result has 39 places, 24 transitions, 115 flow [2023-08-24 05:30:01,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=115, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2023-08-24 05:30:01,470 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 12 predicate places. [2023-08-24 05:30:01,470 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 24 transitions, 115 flow [2023-08-24 05:30:01,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 72.28571428571429) internal successors, (506), 7 states have internal predecessors, (506), 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-24 05:30:01,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:01,470 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:30:01,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 05:30:01,471 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-24 05:30:01,471 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:01,471 INFO L85 PathProgramCache]: Analyzing trace with hash 268825188, now seen corresponding path program 2 times [2023-08-24 05:30:01,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:01,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589539643] [2023-08-24 05:30:01,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:01,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:30:01,494 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 05:30:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:30:01,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 05:30:01,564 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 05:30:01,565 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-08-24 05:30:01,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-08-24 05:30:01,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-08-24 05:30:01,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-08-24 05:30:01,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-24 05:30:01,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 05:30:01,568 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-08-24 05:30:01,571 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 05:30:01,571 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 05:30:01,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 05:30:01 BasicIcfg [2023-08-24 05:30:01,599 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 05:30:01,599 INFO L158 Benchmark]: Toolchain (without parser) took 5640.83ms. Allocated memory was 388.0MB in the beginning and 591.4MB in the end (delta: 203.4MB). Free memory was 361.5MB in the beginning and 461.8MB in the end (delta: -100.3MB). Peak memory consumption was 106.1MB. Max. memory is 16.0GB. [2023-08-24 05:30:01,600 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 388.0MB. Free memory is still 365.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 05:30:01,600 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.89ms. Allocated memory is still 388.0MB. Free memory was 361.5MB in the beginning and 339.1MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 05:30:01,600 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.64ms. Allocated memory is still 388.0MB. Free memory was 339.1MB in the beginning and 336.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:30:01,600 INFO L158 Benchmark]: Boogie Preprocessor took 28.45ms. Allocated memory is still 388.0MB. Free memory was 336.3MB in the beginning and 334.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:30:01,600 INFO L158 Benchmark]: RCFGBuilder took 506.36ms. Allocated memory is still 388.0MB. Free memory was 334.9MB in the beginning and 301.3MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-08-24 05:30:01,601 INFO L158 Benchmark]: TraceAbstraction took 4598.90ms. Allocated memory was 388.0MB in the beginning and 591.4MB in the end (delta: 203.4MB). Free memory was 300.7MB in the beginning and 461.8MB in the end (delta: -161.1MB). Peak memory consumption was 45.3MB. Max. memory is 16.0GB. [2023-08-24 05:30:01,602 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.15ms. Allocated memory is still 388.0MB. Free memory is still 365.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 424.89ms. Allocated memory is still 388.0MB. Free memory was 361.5MB in the beginning and 339.1MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 57.64ms. Allocated memory is still 388.0MB. Free memory was 339.1MB in the beginning and 336.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 28.45ms. Allocated memory is still 388.0MB. Free memory was 336.3MB in the beginning and 334.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 506.36ms. Allocated memory is still 388.0MB. Free memory was 334.9MB in the beginning and 301.3MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * TraceAbstraction took 4598.90ms. Allocated memory was 388.0MB in the beginning and 591.4MB in the end (delta: 203.4MB). Free memory was 300.7MB in the beginning and 461.8MB in the end (delta: -161.1MB). Peak memory consumption was 45.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: 2.3s, 94 PlacesBefore, 27 PlacesAfterwards, 89 TransitionsBefore, 21 TransitionsAfterwards, 1174 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 79 TotalNumberOfCompositions, 3011 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1285, independent: 1151, independent conditional: 0, independent unconditional: 1151, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 608, independent: 587, independent conditional: 0, independent unconditional: 587, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1285, independent: 564, independent conditional: 0, independent unconditional: 564, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 608, unknown conditional: 0, unknown unconditional: 608] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 41, Positive conditional cache size: 0, Positive unconditional cache size: 41, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, 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_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L720] 0 int z = 0; [L721] 0 _Bool z$flush_delayed; [L722] 0 int z$mem_tmp; [L723] 0 _Bool z$r_buff0_thd0; [L724] 0 _Bool z$r_buff0_thd1; [L725] 0 _Bool z$r_buff0_thd2; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$read_delayed; [L730] 0 int *z$read_delayed_var; [L731] 0 int z$w_buff0; [L732] 0 _Bool z$w_buff0_used; [L733] 0 int z$w_buff1; [L734] 0 _Bool z$w_buff1_used; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L815] 0 pthread_t t1089; [L816] FCALL, FORK 0 pthread_create(&t1089, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1089, ((void *)0), P0, ((void *)0))=-1, t1089={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] [L817] 0 pthread_t t1090; [L818] FCALL, FORK 0 pthread_create(&t1090, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1090, ((void *)0), P1, ((void *)0))=0, t1089={5:0}, t1090={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=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] [L740] 1 z$w_buff1 = z$w_buff0 [L741] 1 z$w_buff0 = 1 [L742] 1 z$w_buff1_used = z$w_buff0_used [L743] 1 z$w_buff0_used = (_Bool)1 [L744] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L744] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L745] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L746] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L747] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=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] [L751] 1 x = 1 VAL [__unbuffered_cnt=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=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] [L768] 2 x = 2 VAL [__unbuffered_cnt=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=2, 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] [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=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=2, 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] [L777] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L778] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L779] 2 z$flush_delayed = weak$$choice2 [L780] 2 z$mem_tmp = z [L781] 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) [L782] 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)) [L783] 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)) [L784] 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)) [L785] 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)) [L786] 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)) [L787] 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)) [L788] 2 __unbuffered_p1_EBX = z [L789] 2 z = z$flush_delayed ? z$mem_tmp : z [L790] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=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=0, x=2, 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] [L793] 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) [L794] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L795] 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 [L796] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L797] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, 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] [L754] 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) [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] 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 [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] 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_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=0, x=2, 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] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, 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] [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 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) [L825] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L826] 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 [L827] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L828] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1089={5:0}, t1090={3:0}, weak$$choice2=0, x=2, 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] [L831] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L833] 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_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=0, x=2, 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: 816]: 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, 111 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: 4.5s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 81 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 81 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 388 IncrementalHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 2 mSDtfsCounter, 388 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred 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.0s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 372 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-24 05:30:01,616 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...