/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-23 23:00:47,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-23 23:00:47,244 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-23 23:00:47,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-23 23:00:47,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-23 23:00:47,291 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-23 23:00:47,292 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-23 23:00:47,293 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-23 23:00:47,293 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-23 23:00:47,295 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-23 23:00:47,295 INFO L153 SettingsManager]: * Use SBE=true [2023-08-23 23:00:47,296 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-23 23:00:47,296 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-23 23:00:47,296 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-23 23:00:47,297 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-23 23:00:47,297 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-23 23:00:47,297 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-23 23:00:47,297 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-23 23:00:47,298 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-23 23:00:47,298 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-23 23:00:47,298 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-23 23:00:47,298 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-23 23:00:47,299 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-23 23:00:47,299 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-23 23:00:47,299 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-23 23:00:47,299 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-23 23:00:47,300 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-23 23:00:47,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 23:00:47,300 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-23 23:00:47,300 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-23 23:00:47,300 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-23 23:00:47,301 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-23 23:00:47,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-23 23:00:47,301 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-23 23:00:47,301 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-23 23:00:47,302 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-08-23 23:00:47,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-23 23:00:47,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-23 23:00:47,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-23 23:00:47,678 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-23 23:00:47,680 INFO L274 PluginConnector]: CDTParser initialized [2023-08-23 23:00:47,682 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i [2023-08-23 23:00:48,853 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-23 23:00:49,164 INFO L384 CDTParser]: Found 1 translation units. [2023-08-23 23:00:49,165 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i [2023-08-23 23:00:49,189 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cfb0df9a/d9bc8ebb5a8f4744b3c31b51b3ebdc0c/FLAGeef12e69c [2023-08-23 23:00:49,206 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cfb0df9a/d9bc8ebb5a8f4744b3c31b51b3ebdc0c [2023-08-23 23:00:49,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-23 23:00:49,213 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-23 23:00:49,215 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-23 23:00:49,215 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-23 23:00:49,218 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-23 23:00:49,220 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 11:00:49" (1/1) ... [2023-08-23 23:00:49,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@475991be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:00:49, skipping insertion in model container [2023-08-23 23:00:49,221 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 11:00:49" (1/1) ... [2023-08-23 23:00:49,273 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-23 23:00:49,443 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/mix023_power.opt_pso.opt_rmo.opt.i[966,979] [2023-08-23 23:00:49,678 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 23:00:49,690 INFO L201 MainTranslator]: Completed pre-run [2023-08-23 23:00:49,700 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/mix023_power.opt_pso.opt_rmo.opt.i[966,979] [2023-08-23 23:00:49,722 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-23 23:00:49,724 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-23 23:00:49,770 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 23:00:49,802 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 23:00:49,803 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 23:00:49,809 INFO L206 MainTranslator]: Completed translation [2023-08-23 23:00:49,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:00:49 WrapperNode [2023-08-23 23:00:49,809 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-23 23:00:49,811 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-23 23:00:49,811 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-23 23:00:49,811 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-23 23:00:49,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:00:49" (1/1) ... [2023-08-23 23:00:49,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:00:49" (1/1) ... [2023-08-23 23:00:49,882 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-08-23 23:00:49,882 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-23 23:00:49,883 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-23 23:00:49,883 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-23 23:00:49,883 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-23 23:00:49,891 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:00:49" (1/1) ... [2023-08-23 23:00:49,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:00:49" (1/1) ... [2023-08-23 23:00:49,907 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:00:49" (1/1) ... [2023-08-23 23:00:49,908 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:00:49" (1/1) ... [2023-08-23 23:00:49,914 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:00:49" (1/1) ... [2023-08-23 23:00:49,921 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:00:49" (1/1) ... [2023-08-23 23:00:49,924 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:00:49" (1/1) ... [2023-08-23 23:00:49,925 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:00:49" (1/1) ... [2023-08-23 23:00:49,928 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-23 23:00:49,929 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-23 23:00:49,929 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-23 23:00:49,929 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-23 23:00:49,931 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:00:49" (1/1) ... [2023-08-23 23:00:49,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 23:00:49,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-23 23:00:49,960 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-23 23:00:49,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-23 23:00:49,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-23 23:00:49,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-23 23:00:49,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-23 23:00:49,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-23 23:00:49,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-23 23:00:49,997 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-23 23:00:49,998 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-23 23:00:49,998 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-23 23:00:49,998 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-23 23:00:49,998 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-23 23:00:49,998 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-23 23:00:49,998 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-23 23:00:49,999 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-23 23:00:49,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-23 23:00:50,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-23 23:00:50,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-23 23:00:50,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-23 23:00:50,001 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-23 23:00:50,174 INFO L236 CfgBuilder]: Building ICFG [2023-08-23 23:00:50,176 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-23 23:00:50,498 INFO L277 CfgBuilder]: Performing block encoding [2023-08-23 23:00:50,619 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-23 23:00:50,619 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-23 23:00:50,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 11:00:50 BoogieIcfgContainer [2023-08-23 23:00:50,622 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-23 23:00:50,624 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-23 23:00:50,624 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-23 23:00:50,627 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-23 23:00:50,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.08 11:00:49" (1/3) ... [2023-08-23 23:00:50,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e82c58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 11:00:50, skipping insertion in model container [2023-08-23 23:00:50,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:00:49" (2/3) ... [2023-08-23 23:00:50,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e82c58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 11:00:50, skipping insertion in model container [2023-08-23 23:00:50,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 11:00:50" (3/3) ... [2023-08-23 23:00:50,630 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_power.opt_pso.opt_rmo.opt.i [2023-08-23 23:00:50,647 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-23 23:00:50,647 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-23 23:00:50,648 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-23 23:00:50,697 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-23 23:00:50,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2023-08-23 23:00:50,796 INFO L124 PetriNetUnfolderBase]: 2/126 cut-off events. [2023-08-23 23:00:50,797 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:00:50,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-08-23 23:00:50,803 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2023-08-23 23:00:50,810 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2023-08-23 23:00:50,813 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-23 23:00:50,827 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2023-08-23 23:00:50,833 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2023-08-23 23:00:50,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2023-08-23 23:00:50,875 INFO L124 PetriNetUnfolderBase]: 2/126 cut-off events. [2023-08-23 23:00:50,875 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:00:50,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-08-23 23:00:50,879 INFO L119 LiptonReduction]: Number of co-enabled transitions 2986 [2023-08-23 23:00:54,855 INFO L134 LiptonReduction]: Checked pairs total: 7942 [2023-08-23 23:00:54,855 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-08-23 23:00:54,867 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-23 23:00:54,872 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;@a25a3bb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-23 23:00:54,872 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-23 23:00:54,878 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-23 23:00:54,878 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-08-23 23:00:54,878 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:00:54,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:00:54,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:00:54,880 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:00:54,884 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:00:54,884 INFO L85 PathProgramCache]: Analyzing trace with hash 534499000, now seen corresponding path program 1 times [2023-08-23 23:00:54,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:00:54,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95647922] [2023-08-23 23:00:54,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:00:54,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:00:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:00:55,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:00:55,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:00:55,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95647922] [2023-08-23 23:00:55,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95647922] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:00:55,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:00:55,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-23 23:00:55,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162807641] [2023-08-23 23:00:55,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:00:55,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 23:00:55,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:00:55,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 23:00:55,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 23:00:55,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 240 [2023-08-23 23:00:55,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:55,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:00:55,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 240 [2023-08-23 23:00:55,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:00:56,030 INFO L124 PetriNetUnfolderBase]: 2855/4235 cut-off events. [2023-08-23 23:00:56,030 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2023-08-23 23:00:56,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8311 conditions, 4235 events. 2855/4235 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 24003 event pairs, 545 based on Foata normal form. 0/4003 useless extension candidates. Maximal degree in co-relation 8299. Up to 3103 conditions per place. [2023-08-23 23:00:56,058 INFO L140 encePairwiseOnDemand]: 236/240 looper letters, 33 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2023-08-23 23:00:56,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 42 transitions, 173 flow [2023-08-23 23:00:56,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 23:00:56,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 23:00:56,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-08-23 23:00:56,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5388888888888889 [2023-08-23 23:00:56,078 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-08-23 23:00:56,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-08-23 23:00:56,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:00:56,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-08-23 23:00:56,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:56,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:56,093 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:56,095 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 388 transitions. [2023-08-23 23:00:56,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 42 transitions, 173 flow [2023-08-23 23:00:56,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-23 23:00:56,102 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 66 flow [2023-08-23 23:00:56,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-08-23 23:00:56,107 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-08-23 23:00:56,108 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 66 flow [2023-08-23 23:00:56,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:56,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:00:56,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:00:56,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-23 23:00:56,110 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:00:56,117 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:00:56,118 INFO L85 PathProgramCache]: Analyzing trace with hash 527391973, now seen corresponding path program 1 times [2023-08-23 23:00:56,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:00:56,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232249172] [2023-08-23 23:00:56,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:00:56,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:00:56,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:00:56,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:00:56,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:00:56,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232249172] [2023-08-23 23:00:56,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232249172] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:00:56,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:00:56,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-23 23:00:56,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347629753] [2023-08-23 23:00:56,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:00:56,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 23:00:56,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:00:56,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 23:00:56,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 23:00:56,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 240 [2023-08-23 23:00:56,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:56,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:00:56,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 240 [2023-08-23 23:00:56,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:00:58,014 INFO L124 PetriNetUnfolderBase]: 12556/17185 cut-off events. [2023-08-23 23:00:58,014 INFO L125 PetriNetUnfolderBase]: For 752/752 co-relation queries the response was YES. [2023-08-23 23:00:58,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35532 conditions, 17185 events. 12556/17185 cut-off events. For 752/752 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 88981 event pairs, 4324 based on Foata normal form. 484/17669 useless extension candidates. Maximal degree in co-relation 35522. Up to 10805 conditions per place. [2023-08-23 23:00:58,125 INFO L140 encePairwiseOnDemand]: 230/240 looper letters, 40 selfloop transitions, 9 changer transitions 0/49 dead transitions. [2023-08-23 23:00:58,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 49 transitions, 214 flow [2023-08-23 23:00:58,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 23:00:58,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 23:00:58,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2023-08-23 23:00:58,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4986111111111111 [2023-08-23 23:00:58,127 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 359 transitions. [2023-08-23 23:00:58,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions. [2023-08-23 23:00:58,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:00:58,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions. [2023-08-23 23:00:58,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:58,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:58,132 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:58,133 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 3 states and 359 transitions. [2023-08-23 23:00:58,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 49 transitions, 214 flow [2023-08-23 23:00:58,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-23 23:00:58,138 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 132 flow [2023-08-23 23:00:58,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2023-08-23 23:00:58,141 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2023-08-23 23:00:58,143 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 132 flow [2023-08-23 23:00:58,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:58,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:00:58,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:00:58,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-23 23:00:58,149 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:00:58,152 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:00:58,152 INFO L85 PathProgramCache]: Analyzing trace with hash -830719293, now seen corresponding path program 1 times [2023-08-23 23:00:58,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:00:58,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064075720] [2023-08-23 23:00:58,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:00:58,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:00:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:00:58,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:00:58,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:00:58,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064075720] [2023-08-23 23:00:58,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064075720] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:00:58,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:00:58,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 23:00:58,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222769086] [2023-08-23 23:00:58,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:00:58,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:00:58,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:00:58,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:00:58,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:00:58,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 240 [2023-08-23 23:00:58,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:58,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:00:58,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 240 [2023-08-23 23:00:58,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:00:59,928 INFO L124 PetriNetUnfolderBase]: 11418/15651 cut-off events. [2023-08-23 23:00:59,928 INFO L125 PetriNetUnfolderBase]: For 7489/7489 co-relation queries the response was YES. [2023-08-23 23:00:59,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40918 conditions, 15651 events. 11418/15651 cut-off events. For 7489/7489 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 81106 event pairs, 2615 based on Foata normal form. 220/15871 useless extension candidates. Maximal degree in co-relation 40906. Up to 6937 conditions per place. [2023-08-23 23:01:00,029 INFO L140 encePairwiseOnDemand]: 231/240 looper letters, 63 selfloop transitions, 9 changer transitions 0/72 dead transitions. [2023-08-23 23:01:00,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 72 transitions, 388 flow [2023-08-23 23:01:00,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-23 23:01:00,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-23 23:01:00,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 478 transitions. [2023-08-23 23:01:00,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4979166666666667 [2023-08-23 23:01:00,032 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 478 transitions. [2023-08-23 23:01:00,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 478 transitions. [2023-08-23 23:01:00,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:01:00,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 478 transitions. [2023-08-23 23:01:00,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:00,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:00,037 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:00,037 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 132 flow. Second operand 4 states and 478 transitions. [2023-08-23 23:01:00,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 72 transitions, 388 flow [2023-08-23 23:01:00,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 72 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-23 23:01:00,099 INFO L231 Difference]: Finished difference. Result has 44 places, 40 transitions, 182 flow [2023-08-23 23:01:00,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=44, PETRI_TRANSITIONS=40} [2023-08-23 23:01:00,100 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2023-08-23 23:01:00,100 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 182 flow [2023-08-23 23:01:00,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:00,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:00,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:01:00,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-23 23:01:00,101 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:00,102 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:00,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1197194893, now seen corresponding path program 1 times [2023-08-23 23:01:00,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:00,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221108116] [2023-08-23 23:01:00,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:00,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:01:00,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:01:00,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:01:00,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221108116] [2023-08-23 23:01:00,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221108116] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:01:00,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:01:00,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 23:01:00,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331208833] [2023-08-23 23:01:00,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:01:00,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:01:00,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:01:00,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:01:00,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:01:00,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 240 [2023-08-23 23:01:00,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:00,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:01:00,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 240 [2023-08-23 23:01:00,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:01:01,464 INFO L124 PetriNetUnfolderBase]: 10830/14847 cut-off events. [2023-08-23 23:01:01,464 INFO L125 PetriNetUnfolderBase]: For 13326/13326 co-relation queries the response was YES. [2023-08-23 23:01:01,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41193 conditions, 14847 events. 10830/14847 cut-off events. For 13326/13326 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 73222 event pairs, 2795 based on Foata normal form. 120/14967 useless extension candidates. Maximal degree in co-relation 41178. Up to 6293 conditions per place. [2023-08-23 23:01:01,550 INFO L140 encePairwiseOnDemand]: 231/240 looper letters, 57 selfloop transitions, 13 changer transitions 0/70 dead transitions. [2023-08-23 23:01:01,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 70 transitions, 430 flow [2023-08-23 23:01:01,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-23 23:01:01,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-23 23:01:01,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 469 transitions. [2023-08-23 23:01:01,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48854166666666665 [2023-08-23 23:01:01,553 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 469 transitions. [2023-08-23 23:01:01,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 469 transitions. [2023-08-23 23:01:01,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:01:01,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 469 transitions. [2023-08-23 23:01:01,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:01,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:01,557 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:01,557 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 182 flow. Second operand 4 states and 469 transitions. [2023-08-23 23:01:01,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 70 transitions, 430 flow [2023-08-23 23:01:01,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 425 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-23 23:01:01,578 INFO L231 Difference]: Finished difference. Result has 49 places, 47 transitions, 294 flow [2023-08-23 23:01:01,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=294, PETRI_PLACES=49, PETRI_TRANSITIONS=47} [2023-08-23 23:01:01,580 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places. [2023-08-23 23:01:01,580 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 47 transitions, 294 flow [2023-08-23 23:01:01,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:01,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:01,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:01:01,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-23 23:01:01,581 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:01,581 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:01,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1526219066, now seen corresponding path program 1 times [2023-08-23 23:01:01,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:01,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476670688] [2023-08-23 23:01:01,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:01,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:01:01,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:01:01,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:01:01,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476670688] [2023-08-23 23:01:01,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476670688] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:01:01,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:01:01,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:01:01,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939739063] [2023-08-23 23:01:01,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:01:01,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:01:01,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:01:01,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:01:01,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:01:01,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 240 [2023-08-23 23:01:01,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 294 flow. Second operand has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:01,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:01:01,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 240 [2023-08-23 23:01:01,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:01:02,630 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][91], [Black: 157#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 32#L835true, Black: 162#true, 14#P2EXITtrue, P2Thread1of1ForFork1InUse, Black: 164#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork2InUse, 173#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, 74#L2true, 78#P0EXITtrue, 165#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 148#true, 21#L768true, Black: 154#true]) [2023-08-23 23:01:02,630 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-23 23:01:02,630 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-23 23:01:02,630 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-23 23:01:02,630 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-23 23:01:02,729 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][91], [Black: 156#(= ~__unbuffered_p1_EAX~0 0), 32#L835true, 110#L771true, 14#P2EXITtrue, Black: 162#true, P2Thread1of1ForFork1InUse, 157#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 164#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 173#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork3InUse, 74#L2true, 78#P0EXITtrue, 165#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 148#true, Black: 154#true]) [2023-08-23 23:01:02,730 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-23 23:01:02,730 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-23 23:01:02,730 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-23 23:01:02,730 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-23 23:01:02,730 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([371] L771-->L787: Formula: (let ((.cse8 (= (mod v_~y$r_buff1_thd2~0_52 256) 0)) (.cse3 (= (mod v_~y$r_buff0_thd2~0_52 256) 0))) (let ((.cse6 (not .cse3)) (.cse12 (= (mod v_~y$w_buff0_used~0_128 256) 0)) (.cse5 (and .cse3 .cse8)) (.cse11 (and (= 0 (mod v_~y$w_buff1_used~0_115 256)) .cse3))) (let ((.cse9 (or .cse12 .cse5 .cse11)) (.cse10 (and (not .cse12) .cse6))) (let ((.cse4 (= (mod v_~y$w_buff1_used~0_114 256) 0)) (.cse1 (ite .cse9 v_~y~0_86 (ite .cse10 v_~y$w_buff0~0_59 v_~y$w_buff1~0_52))) (.cse0 (not (= (mod v_~weak$$choice2~0_40 256) 0))) (.cse2 (= (mod v_~y$w_buff0_used~0_127 256) 0))) (and (= v_~y~0_86 v_~y$mem_tmp~0_24) (= v_~y$w_buff0~0_59 v_~y$w_buff0~0_58) (= v_~y~0_84 (ite .cse0 v_~y$mem_tmp~0_24 .cse1)) (= v_~y$r_buff0_thd2~0_51 (ite .cse0 v_~y$r_buff0_thd2~0_52 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~y$r_buff0_thd2~0_52 (ite (and .cse6 (not .cse2)) 0 v_~y$r_buff0_thd2~0_52)))) (= (ite .cse0 v_~y$r_buff1_thd2~0_52 (ite (let ((.cse7 (= (mod v_~y$r_buff0_thd2~0_51 256) 0))) (or .cse2 (and .cse7 .cse8) (and .cse7 .cse4))) v_~y$r_buff1_thd2~0_52 0)) v_~y$r_buff1_thd2~0_51) (= 0 v_~y$flush_delayed~0_27) (= v_~y$w_buff0_used~0_127 (ite .cse0 v_~y$w_buff0_used~0_128 (ite .cse9 v_~y$w_buff0_used~0_128 (ite .cse10 0 v_~y$w_buff0_used~0_128)))) (= v_~__unbuffered_p1_EBX~0_12 .cse1) (= v_~y$w_buff1~0_52 v_~y$w_buff1~0_51) (= v_~y$w_buff1_used~0_114 (ite .cse0 v_~y$w_buff1_used~0_115 (ite (or .cse2 .cse5 .cse11) v_~y$w_buff1_used~0_115 0)))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_52, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_128, ~y$w_buff1~0=v_~y$w_buff1~0_52, ~y$w_buff0~0=v_~y$w_buff0~0_59, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_52, ~y~0=v_~y~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_115} OutVars{P1Thread1of1ForFork0_#t~nondet3=|v_P1Thread1of1ForFork0_#t~nondet3_1|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_127, P1Thread1of1ForFork0_#t~nondet4=|v_P1Thread1of1ForFork0_#t~nondet4_1|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_51, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ~y$w_buff1~0=v_~y$w_buff1~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_58, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_51, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ~y~0=v_~y~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_40, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_114} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~nondet3, ~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork0_#t~nondet4, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][104], [Black: 156#(= ~__unbuffered_p1_EAX~0 0), Black: 157#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 42#L756true, 154#true, 162#true, 32#L835true, 14#P2EXITtrue, P2Thread1of1ForFork1InUse, Black: 164#(= ~__unbuffered_p3_EAX~0 0), Black: 165#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork2InUse, 173#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, 115#L787true, 74#L2true, Black: 150#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-08-23 23:01:02,730 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-23 23:01:02,731 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-23 23:01:02,731 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-23 23:01:02,731 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-23 23:01:02,797 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][36], [Black: 156#(= ~__unbuffered_p1_EAX~0 0), 170#true, 32#L835true, Black: 162#true, 14#P2EXITtrue, P2Thread1of1ForFork1InUse, 157#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 164#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, 115#L787true, 74#L2true, 78#P0EXITtrue, 165#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 148#true, Black: 154#true]) [2023-08-23 23:01:02,798 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-23 23:01:02,798 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-23 23:01:02,798 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-23 23:01:02,798 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-23 23:01:02,799 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][91], [Black: 156#(= ~__unbuffered_p1_EAX~0 0), 32#L835true, 14#P2EXITtrue, Black: 162#true, P2Thread1of1ForFork1InUse, 157#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 164#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 173#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork3InUse, 115#L787true, 74#L2true, 78#P0EXITtrue, 165#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 148#true, Black: 154#true]) [2023-08-23 23:01:02,799 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-23 23:01:02,799 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-23 23:01:02,799 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-23 23:01:02,799 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-23 23:01:02,819 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][36], [Black: 156#(= ~__unbuffered_p1_EAX~0 0), 170#true, 32#L835true, 14#P2EXITtrue, Black: 162#true, Black: 164#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork1InUse, 157#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, 74#L2true, 78#P0EXITtrue, 165#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 148#true, 35#P1EXITtrue, Black: 154#true]) [2023-08-23 23:01:02,819 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-23 23:01:02,819 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-23 23:01:02,819 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-23 23:01:02,819 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-23 23:01:02,821 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][36], [Black: 156#(= ~__unbuffered_p1_EAX~0 0), 170#true, 32#L835true, Black: 162#true, 14#P2EXITtrue, Black: 164#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork1InUse, 157#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, 115#L787true, 17#L877true, 78#P0EXITtrue, 165#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 148#true, Black: 154#true]) [2023-08-23 23:01:02,821 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-23 23:01:02,821 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-23 23:01:02,821 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-23 23:01:02,821 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-23 23:01:02,844 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][91], [Black: 156#(= ~__unbuffered_p1_EAX~0 0), 32#L835true, 14#P2EXITtrue, Black: 162#true, Black: 164#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork1InUse, 157#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 173#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork3InUse, 74#L2true, 78#P0EXITtrue, 35#P1EXITtrue, 165#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 148#true, Black: 154#true]) [2023-08-23 23:01:02,844 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-23 23:01:02,844 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-23 23:01:02,844 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-23 23:01:02,844 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-23 23:01:02,874 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][36], [Black: 156#(= ~__unbuffered_p1_EAX~0 0), 170#true, 32#L835true, 14#P2EXITtrue, Black: 162#true, Black: 164#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork1InUse, 157#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, 17#L877true, 78#P0EXITtrue, 165#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 148#true, 35#P1EXITtrue, Black: 154#true]) [2023-08-23 23:01:02,875 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-23 23:01:02,875 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-23 23:01:02,875 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-23 23:01:02,875 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-23 23:01:02,918 INFO L124 PetriNetUnfolderBase]: 6793/10099 cut-off events. [2023-08-23 23:01:02,918 INFO L125 PetriNetUnfolderBase]: For 11792/12612 co-relation queries the response was YES. [2023-08-23 23:01:02,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27670 conditions, 10099 events. 6793/10099 cut-off events. For 11792/12612 co-relation queries the response was YES. Maximal size of possible extension queue 686. Compared 63841 event pairs, 1155 based on Foata normal form. 811/10210 useless extension candidates. Maximal degree in co-relation 27651. Up to 6201 conditions per place. [2023-08-23 23:01:02,998 INFO L140 encePairwiseOnDemand]: 233/240 looper letters, 76 selfloop transitions, 10 changer transitions 0/105 dead transitions. [2023-08-23 23:01:02,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 105 transitions, 720 flow [2023-08-23 23:01:02,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:01:02,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:01:03,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2023-08-23 23:01:03,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075 [2023-08-23 23:01:03,000 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 609 transitions. [2023-08-23 23:01:03,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 609 transitions. [2023-08-23 23:01:03,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:01:03,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 609 transitions. [2023-08-23 23:01:03,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:03,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:03,005 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:03,006 INFO L175 Difference]: Start difference. First operand has 49 places, 47 transitions, 294 flow. Second operand 5 states and 609 transitions. [2023-08-23 23:01:03,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 105 transitions, 720 flow [2023-08-23 23:01:03,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 105 transitions, 716 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-23 23:01:03,023 INFO L231 Difference]: Finished difference. Result has 55 places, 56 transitions, 365 flow [2023-08-23 23:01:03,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=365, PETRI_PLACES=55, PETRI_TRANSITIONS=56} [2023-08-23 23:01:03,025 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2023-08-23 23:01:03,025 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 56 transitions, 365 flow [2023-08-23 23:01:03,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:03,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:03,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:01:03,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-23 23:01:03,026 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:03,026 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:03,027 INFO L85 PathProgramCache]: Analyzing trace with hash 756789948, now seen corresponding path program 1 times [2023-08-23 23:01:03,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:03,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665754634] [2023-08-23 23:01:03,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:03,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:01:03,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:01:03,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:01:03,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665754634] [2023-08-23 23:01:03,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665754634] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:01:03,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:01:03,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:01:03,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219603332] [2023-08-23 23:01:03,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:01:03,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:01:03,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:01:03,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:01:03,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:01:03,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 240 [2023-08-23 23:01:03,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 56 transitions, 365 flow. Second operand has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:03,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:01:03,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 240 [2023-08-23 23:01:03,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:01:03,954 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][99], [Black: 157#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 32#L835true, 14#P2EXITtrue, Black: 162#true, Black: 164#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 173#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 172#(= ~__unbuffered_cnt~0 0), Black: 175#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 74#L2true, 78#P0EXITtrue, 165#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 148#true, 21#L768true, 184#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 154#true]) [2023-08-23 23:01:03,954 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-23 23:01:03,954 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-23 23:01:03,955 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-23 23:01:03,955 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-23 23:01:04,023 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][99], [Black: 156#(= ~__unbuffered_p1_EAX~0 0), 32#L835true, 110#L771true, 14#P2EXITtrue, Black: 162#true, Black: 164#(= ~__unbuffered_p3_EAX~0 0), 157#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 173#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 172#(= ~__unbuffered_cnt~0 0), Black: 175#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 74#L2true, 78#P0EXITtrue, 165#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 148#true, 184#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 154#true]) [2023-08-23 23:01:04,023 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-23 23:01:04,023 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-23 23:01:04,024 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-23 23:01:04,024 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-23 23:01:04,024 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([371] L771-->L787: Formula: (let ((.cse8 (= (mod v_~y$r_buff1_thd2~0_52 256) 0)) (.cse3 (= (mod v_~y$r_buff0_thd2~0_52 256) 0))) (let ((.cse6 (not .cse3)) (.cse12 (= (mod v_~y$w_buff0_used~0_128 256) 0)) (.cse5 (and .cse3 .cse8)) (.cse11 (and (= 0 (mod v_~y$w_buff1_used~0_115 256)) .cse3))) (let ((.cse9 (or .cse12 .cse5 .cse11)) (.cse10 (and (not .cse12) .cse6))) (let ((.cse4 (= (mod v_~y$w_buff1_used~0_114 256) 0)) (.cse1 (ite .cse9 v_~y~0_86 (ite .cse10 v_~y$w_buff0~0_59 v_~y$w_buff1~0_52))) (.cse0 (not (= (mod v_~weak$$choice2~0_40 256) 0))) (.cse2 (= (mod v_~y$w_buff0_used~0_127 256) 0))) (and (= v_~y~0_86 v_~y$mem_tmp~0_24) (= v_~y$w_buff0~0_59 v_~y$w_buff0~0_58) (= v_~y~0_84 (ite .cse0 v_~y$mem_tmp~0_24 .cse1)) (= v_~y$r_buff0_thd2~0_51 (ite .cse0 v_~y$r_buff0_thd2~0_52 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~y$r_buff0_thd2~0_52 (ite (and .cse6 (not .cse2)) 0 v_~y$r_buff0_thd2~0_52)))) (= (ite .cse0 v_~y$r_buff1_thd2~0_52 (ite (let ((.cse7 (= (mod v_~y$r_buff0_thd2~0_51 256) 0))) (or .cse2 (and .cse7 .cse8) (and .cse7 .cse4))) v_~y$r_buff1_thd2~0_52 0)) v_~y$r_buff1_thd2~0_51) (= 0 v_~y$flush_delayed~0_27) (= v_~y$w_buff0_used~0_127 (ite .cse0 v_~y$w_buff0_used~0_128 (ite .cse9 v_~y$w_buff0_used~0_128 (ite .cse10 0 v_~y$w_buff0_used~0_128)))) (= v_~__unbuffered_p1_EBX~0_12 .cse1) (= v_~y$w_buff1~0_52 v_~y$w_buff1~0_51) (= v_~y$w_buff1_used~0_114 (ite .cse0 v_~y$w_buff1_used~0_115 (ite (or .cse2 .cse5 .cse11) v_~y$w_buff1_used~0_115 0)))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_52, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_128, ~y$w_buff1~0=v_~y$w_buff1~0_52, ~y$w_buff0~0=v_~y$w_buff0~0_59, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_52, ~y~0=v_~y~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_115} OutVars{P1Thread1of1ForFork0_#t~nondet3=|v_P1Thread1of1ForFork0_#t~nondet3_1|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_127, P1Thread1of1ForFork0_#t~nondet4=|v_P1Thread1of1ForFork0_#t~nondet4_1|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_51, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ~y$w_buff1~0=v_~y$w_buff1~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_58, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_51, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ~y~0=v_~y~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_40, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_114} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~nondet3, ~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork0_#t~nondet4, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][127], [Black: 156#(= ~__unbuffered_p1_EAX~0 0), Black: 157#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 42#L756true, 154#true, 162#true, 32#L835true, 14#P2EXITtrue, Black: 164#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork1InUse, Black: 165#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork2InUse, 173#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, 115#L787true, Black: 172#(= ~__unbuffered_cnt~0 0), Black: 175#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 74#L2true, Black: 150#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 188#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))]) [2023-08-23 23:01:04,024 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-23 23:01:04,024 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-23 23:01:04,024 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-23 23:01:04,025 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-23 23:01:04,096 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][99], [Black: 156#(= ~__unbuffered_p1_EAX~0 0), 32#L835true, Black: 162#true, 14#P2EXITtrue, 157#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 164#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 173#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork3InUse, Black: 172#(= ~__unbuffered_cnt~0 0), 115#L787true, Black: 175#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 74#L2true, 78#P0EXITtrue, 165#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 148#true, 184#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 154#true]) [2023-08-23 23:01:04,097 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-23 23:01:04,097 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-23 23:01:04,097 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-23 23:01:04,097 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-23 23:01:04,098 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][99], [Black: 156#(= ~__unbuffered_p1_EAX~0 0), 170#true, 32#L835true, 14#P2EXITtrue, Black: 162#true, Black: 164#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork1InUse, 157#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 172#(= ~__unbuffered_cnt~0 0), 115#L787true, Black: 175#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 173#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 74#L2true, 78#P0EXITtrue, 165#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 148#true, 184#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 154#true]) [2023-08-23 23:01:04,098 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-23 23:01:04,098 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-23 23:01:04,098 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-23 23:01:04,098 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-23 23:01:04,111 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][138], [Black: 156#(= ~__unbuffered_p1_EAX~0 0), 170#true, 32#L835true, 14#P2EXITtrue, Black: 162#true, 157#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P2Thread1of1ForFork1InUse, Black: 164#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 172#(= ~__unbuffered_cnt~0 0), Black: 175#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 173#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 74#L2true, 78#P0EXITtrue, 165#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 148#true, 35#P1EXITtrue, 184#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 154#true]) [2023-08-23 23:01:04,111 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-23 23:01:04,111 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-23 23:01:04,111 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-23 23:01:04,111 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-23 23:01:04,130 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][138], [Black: 156#(= ~__unbuffered_p1_EAX~0 0), 32#L835true, Black: 162#true, 14#P2EXITtrue, 157#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P2Thread1of1ForFork1InUse, Black: 164#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 173#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork3InUse, Black: 172#(= ~__unbuffered_cnt~0 0), Black: 175#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 74#L2true, 78#P0EXITtrue, 165#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 148#true, 35#P1EXITtrue, 184#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 154#true]) [2023-08-23 23:01:04,130 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-23 23:01:04,130 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-23 23:01:04,131 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-23 23:01:04,131 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-23 23:01:04,186 INFO L124 PetriNetUnfolderBase]: 5543/8513 cut-off events. [2023-08-23 23:01:04,186 INFO L125 PetriNetUnfolderBase]: For 13231/14561 co-relation queries the response was YES. [2023-08-23 23:01:04,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29511 conditions, 8513 events. 5543/8513 cut-off events. For 13231/14561 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 55215 event pairs, 509 based on Foata normal form. 832/8816 useless extension candidates. Maximal degree in co-relation 29488. Up to 2851 conditions per place. [2023-08-23 23:01:04,249 INFO L140 encePairwiseOnDemand]: 233/240 looper letters, 105 selfloop transitions, 19 changer transitions 1/144 dead transitions. [2023-08-23 23:01:04,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 144 transitions, 1071 flow [2023-08-23 23:01:04,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 23:01:04,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 23:01:04,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 854 transitions. [2023-08-23 23:01:04,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2023-08-23 23:01:04,253 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 854 transitions. [2023-08-23 23:01:04,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 854 transitions. [2023-08-23 23:01:04,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:01:04,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 854 transitions. [2023-08-23 23:01:04,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:04,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:04,258 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:04,258 INFO L175 Difference]: Start difference. First operand has 55 places, 56 transitions, 365 flow. Second operand 7 states and 854 transitions. [2023-08-23 23:01:04,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 144 transitions, 1071 flow [2023-08-23 23:01:04,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 144 transitions, 1066 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-23 23:01:04,296 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 494 flow [2023-08-23 23:01:04,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=494, PETRI_PLACES=63, PETRI_TRANSITIONS=65} [2023-08-23 23:01:04,296 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2023-08-23 23:01:04,297 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 494 flow [2023-08-23 23:01:04,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:04,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:04,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:01:04,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-23 23:01:04,298 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:04,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:04,298 INFO L85 PathProgramCache]: Analyzing trace with hash 481364174, now seen corresponding path program 1 times [2023-08-23 23:01:04,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:04,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322361477] [2023-08-23 23:01:04,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:04,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:01:04,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:01:04,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:01:04,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322361477] [2023-08-23 23:01:04,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322361477] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:01:04,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:01:04,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:01:04,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17776280] [2023-08-23 23:01:04,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:01:04,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:01:04,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:01:04,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:01:04,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:01:04,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 240 [2023-08-23 23:01:04,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 494 flow. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:04,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:01:04,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 240 [2023-08-23 23:01:04,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:01:05,730 INFO L124 PetriNetUnfolderBase]: 7887/12343 cut-off events. [2023-08-23 23:01:05,731 INFO L125 PetriNetUnfolderBase]: For 40317/41196 co-relation queries the response was YES. [2023-08-23 23:01:05,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51836 conditions, 12343 events. 7887/12343 cut-off events. For 40317/41196 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 84628 event pairs, 1233 based on Foata normal form. 197/12140 useless extension candidates. Maximal degree in co-relation 51809. Up to 5884 conditions per place. [2023-08-23 23:01:05,798 INFO L140 encePairwiseOnDemand]: 237/240 looper letters, 94 selfloop transitions, 3 changer transitions 24/137 dead transitions. [2023-08-23 23:01:05,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 137 transitions, 1269 flow [2023-08-23 23:01:05,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-23 23:01:05,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-23 23:01:05,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 502 transitions. [2023-08-23 23:01:05,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5229166666666667 [2023-08-23 23:01:05,801 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 502 transitions. [2023-08-23 23:01:05,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 502 transitions. [2023-08-23 23:01:05,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:01:05,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 502 transitions. [2023-08-23 23:01:05,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:05,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:05,804 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:05,804 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 494 flow. Second operand 4 states and 502 transitions. [2023-08-23 23:01:05,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 137 transitions, 1269 flow [2023-08-23 23:01:06,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 137 transitions, 1134 flow, removed 47 selfloop flow, removed 3 redundant places. [2023-08-23 23:01:06,160 INFO L231 Difference]: Finished difference. Result has 65 places, 67 transitions, 479 flow [2023-08-23 23:01:06,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=479, PETRI_PLACES=65, PETRI_TRANSITIONS=67} [2023-08-23 23:01:06,161 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2023-08-23 23:01:06,161 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 67 transitions, 479 flow [2023-08-23 23:01:06,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:06,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:06,161 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:01:06,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-23 23:01:06,161 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:06,162 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:06,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1279211058, now seen corresponding path program 1 times [2023-08-23 23:01:06,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:06,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902404950] [2023-08-23 23:01:06,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:06,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:01:06,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:01:06,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:01:06,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902404950] [2023-08-23 23:01:06,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902404950] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:01:06,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:01:06,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 23:01:06,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263384184] [2023-08-23 23:01:06,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:01:06,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-23 23:01:06,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:01:06,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-23 23:01:06,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-23 23:01:06,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 240 [2023-08-23 23:01:06,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 67 transitions, 479 flow. Second operand has 6 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:06,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:01:06,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 240 [2023-08-23 23:01:06,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:01:07,057 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][100], [Black: 188#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 157#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 32#L835true, Black: 162#true, 14#P2EXITtrue, Black: 164#(= ~__unbuffered_p3_EAX~0 0), Black: 195#(= ~a~0 1), P2Thread1of1ForFork1InUse, 213#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 173#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork3InUse, Black: 172#(= ~__unbuffered_cnt~0 0), Black: 175#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 74#L2true, 78#P0EXITtrue, 165#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 148#true, 21#L768true, 198#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 184#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 183#(<= ~__unbuffered_cnt~0 1), Black: 154#true]) [2023-08-23 23:01:07,058 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-23 23:01:07,058 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-23 23:01:07,058 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-23 23:01:07,058 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-23 23:01:07,155 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][100], [Black: 188#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 32#L835true, 157#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 195#(= ~a~0 1), P2Thread1of1ForFork1InUse, 213#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, 165#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 148#true, Black: 154#true, Black: 156#(= ~__unbuffered_p1_EAX~0 0), 110#L771true, Black: 162#true, 14#P2EXITtrue, Black: 164#(= ~__unbuffered_p3_EAX~0 0), 173#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 172#(= ~__unbuffered_cnt~0 0), Black: 175#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 74#L2true, 78#P0EXITtrue, 198#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 184#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 183#(<= ~__unbuffered_cnt~0 1)]) [2023-08-23 23:01:07,155 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-23 23:01:07,155 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-23 23:01:07,155 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-23 23:01:07,155 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-23 23:01:07,156 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([371] L771-->L787: Formula: (let ((.cse8 (= (mod v_~y$r_buff1_thd2~0_52 256) 0)) (.cse3 (= (mod v_~y$r_buff0_thd2~0_52 256) 0))) (let ((.cse6 (not .cse3)) (.cse12 (= (mod v_~y$w_buff0_used~0_128 256) 0)) (.cse5 (and .cse3 .cse8)) (.cse11 (and (= 0 (mod v_~y$w_buff1_used~0_115 256)) .cse3))) (let ((.cse9 (or .cse12 .cse5 .cse11)) (.cse10 (and (not .cse12) .cse6))) (let ((.cse4 (= (mod v_~y$w_buff1_used~0_114 256) 0)) (.cse1 (ite .cse9 v_~y~0_86 (ite .cse10 v_~y$w_buff0~0_59 v_~y$w_buff1~0_52))) (.cse0 (not (= (mod v_~weak$$choice2~0_40 256) 0))) (.cse2 (= (mod v_~y$w_buff0_used~0_127 256) 0))) (and (= v_~y~0_86 v_~y$mem_tmp~0_24) (= v_~y$w_buff0~0_59 v_~y$w_buff0~0_58) (= v_~y~0_84 (ite .cse0 v_~y$mem_tmp~0_24 .cse1)) (= v_~y$r_buff0_thd2~0_51 (ite .cse0 v_~y$r_buff0_thd2~0_52 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~y$r_buff0_thd2~0_52 (ite (and .cse6 (not .cse2)) 0 v_~y$r_buff0_thd2~0_52)))) (= (ite .cse0 v_~y$r_buff1_thd2~0_52 (ite (let ((.cse7 (= (mod v_~y$r_buff0_thd2~0_51 256) 0))) (or .cse2 (and .cse7 .cse8) (and .cse7 .cse4))) v_~y$r_buff1_thd2~0_52 0)) v_~y$r_buff1_thd2~0_51) (= 0 v_~y$flush_delayed~0_27) (= v_~y$w_buff0_used~0_127 (ite .cse0 v_~y$w_buff0_used~0_128 (ite .cse9 v_~y$w_buff0_used~0_128 (ite .cse10 0 v_~y$w_buff0_used~0_128)))) (= v_~__unbuffered_p1_EBX~0_12 .cse1) (= v_~y$w_buff1~0_52 v_~y$w_buff1~0_51) (= v_~y$w_buff1_used~0_114 (ite .cse0 v_~y$w_buff1_used~0_115 (ite (or .cse2 .cse5 .cse11) v_~y$w_buff1_used~0_115 0)))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_52, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_128, ~y$w_buff1~0=v_~y$w_buff1~0_52, ~y$w_buff0~0=v_~y$w_buff0~0_59, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_52, ~y~0=v_~y~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_115} OutVars{P1Thread1of1ForFork0_#t~nondet3=|v_P1Thread1of1ForFork0_#t~nondet3_1|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_127, P1Thread1of1ForFork0_#t~nondet4=|v_P1Thread1of1ForFork0_#t~nondet4_1|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_51, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ~y$w_buff1~0=v_~y$w_buff1~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_58, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_51, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ~y~0=v_~y~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_40, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_114} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~nondet3, ~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork0_#t~nondet4, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][128], [42#L756true, 154#true, 32#L835true, Black: 195#(= ~a~0 1), P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 150#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 188#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 156#(= ~__unbuffered_p1_EAX~0 0), Black: 157#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 162#true, 14#P2EXITtrue, Black: 164#(= ~__unbuffered_p3_EAX~0 0), Black: 165#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 173#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 115#L787true, Black: 172#(= ~__unbuffered_cnt~0 0), Black: 175#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 74#L2true, 198#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 183#(<= ~__unbuffered_cnt~0 1), Black: 184#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)]) [2023-08-23 23:01:07,156 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-23 23:01:07,156 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-23 23:01:07,156 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-23 23:01:07,156 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-23 23:01:07,220 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][100], [Black: 188#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 32#L835true, Black: 195#(= ~a~0 1), 157#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P2Thread1of1ForFork1InUse, 213#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, 165#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 148#true, Black: 154#true, Black: 156#(= ~__unbuffered_p1_EAX~0 0), Black: 162#true, 14#P2EXITtrue, Black: 164#(= ~__unbuffered_p3_EAX~0 0), 173#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 172#(= ~__unbuffered_cnt~0 0), 115#L787true, Black: 175#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 74#L2true, 78#P0EXITtrue, 198#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 184#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 183#(<= ~__unbuffered_cnt~0 1)]) [2023-08-23 23:01:07,221 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-23 23:01:07,221 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-23 23:01:07,221 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-23 23:01:07,221 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-23 23:01:07,222 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][100], [Black: 188#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 32#L835true, Black: 195#(= ~a~0 1), 157#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P2Thread1of1ForFork1InUse, 213#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, 165#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 148#true, Black: 154#true, Black: 156#(= ~__unbuffered_p1_EAX~0 0), 14#P2EXITtrue, Black: 162#true, Black: 164#(= ~__unbuffered_p3_EAX~0 0), Black: 172#(= ~__unbuffered_cnt~0 0), 115#L787true, Black: 175#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 173#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 74#L2true, 78#P0EXITtrue, 198#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 184#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 183#(<= ~__unbuffered_cnt~0 1)]) [2023-08-23 23:01:07,222 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-23 23:01:07,222 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-23 23:01:07,222 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-23 23:01:07,222 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-23 23:01:07,241 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][140], [Black: 188#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 32#L835true, Black: 195#(= ~a~0 1), 157#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, 165#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 148#true, Black: 154#true, Black: 156#(= ~__unbuffered_p1_EAX~0 0), Black: 162#true, 14#P2EXITtrue, Black: 164#(= ~__unbuffered_p3_EAX~0 0), Black: 172#(= ~__unbuffered_cnt~0 0), Black: 175#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 173#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 74#L2true, 78#P0EXITtrue, 35#P1EXITtrue, 198#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 207#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 184#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 183#(<= ~__unbuffered_cnt~0 1)]) [2023-08-23 23:01:07,241 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-23 23:01:07,241 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-23 23:01:07,241 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-23 23:01:07,241 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-23 23:01:07,259 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][140], [Black: 188#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 32#L835true, Black: 195#(= ~a~0 1), 157#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, 165#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 148#true, Black: 154#true, Black: 156#(= ~__unbuffered_p1_EAX~0 0), Black: 162#true, 14#P2EXITtrue, Black: 164#(= ~__unbuffered_p3_EAX~0 0), 173#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 172#(= ~__unbuffered_cnt~0 0), Black: 175#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 74#L2true, 78#P0EXITtrue, 35#P1EXITtrue, 198#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 207#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 184#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 183#(<= ~__unbuffered_cnt~0 1)]) [2023-08-23 23:01:07,260 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-23 23:01:07,260 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-23 23:01:07,260 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-23 23:01:07,260 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-23 23:01:07,318 INFO L124 PetriNetUnfolderBase]: 6710/10432 cut-off events. [2023-08-23 23:01:07,318 INFO L125 PetriNetUnfolderBase]: For 26043/28046 co-relation queries the response was YES. [2023-08-23 23:01:07,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39183 conditions, 10432 events. 6710/10432 cut-off events. For 26043/28046 co-relation queries the response was YES. Maximal size of possible extension queue 737. Compared 71870 event pairs, 469 based on Foata normal form. 866/10674 useless extension candidates. Maximal degree in co-relation 39155. Up to 2728 conditions per place. [2023-08-23 23:01:07,389 INFO L140 encePairwiseOnDemand]: 233/240 looper letters, 116 selfloop transitions, 28 changer transitions 12/177 dead transitions. [2023-08-23 23:01:07,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 177 transitions, 1420 flow [2023-08-23 23:01:07,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-23 23:01:07,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-23 23:01:07,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1097 transitions. [2023-08-23 23:01:07,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5078703703703704 [2023-08-23 23:01:07,397 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1097 transitions. [2023-08-23 23:01:07,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1097 transitions. [2023-08-23 23:01:07,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:01:07,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1097 transitions. [2023-08-23 23:01:07,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 121.88888888888889) internal successors, (1097), 9 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:07,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 240.0) internal successors, (2400), 10 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:07,407 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 240.0) internal successors, (2400), 10 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:07,407 INFO L175 Difference]: Start difference. First operand has 65 places, 67 transitions, 479 flow. Second operand 9 states and 1097 transitions. [2023-08-23 23:01:07,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 177 transitions, 1420 flow [2023-08-23 23:01:07,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 177 transitions, 1412 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-23 23:01:07,814 INFO L231 Difference]: Finished difference. Result has 75 places, 76 transitions, 656 flow [2023-08-23 23:01:07,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=656, PETRI_PLACES=75, PETRI_TRANSITIONS=76} [2023-08-23 23:01:07,815 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 33 predicate places. [2023-08-23 23:01:07,815 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 76 transitions, 656 flow [2023-08-23 23:01:07,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:07,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:07,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:01:07,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-23 23:01:07,816 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:07,816 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:07,816 INFO L85 PathProgramCache]: Analyzing trace with hash -2092226554, now seen corresponding path program 1 times [2023-08-23 23:01:07,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:07,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636135398] [2023-08-23 23:01:07,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:07,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:01:08,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:01:08,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:01:08,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636135398] [2023-08-23 23:01:08,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636135398] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:01:08,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:01:08,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:01:08,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873101868] [2023-08-23 23:01:08,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:01:08,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:01:08,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:01:08,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:01:08,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:01:08,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 240 [2023-08-23 23:01:08,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 76 transitions, 656 flow. Second operand has 5 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:08,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:01:08,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 240 [2023-08-23 23:01:08,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:01:10,310 INFO L124 PetriNetUnfolderBase]: 15212/22761 cut-off events. [2023-08-23 23:01:10,310 INFO L125 PetriNetUnfolderBase]: For 103056/103056 co-relation queries the response was YES. [2023-08-23 23:01:10,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106531 conditions, 22761 events. 15212/22761 cut-off events. For 103056/103056 co-relation queries the response was YES. Maximal size of possible extension queue 1025. Compared 150778 event pairs, 1538 based on Foata normal form. 9/22770 useless extension candidates. Maximal degree in co-relation 106499. Up to 6117 conditions per place. [2023-08-23 23:01:10,436 INFO L140 encePairwiseOnDemand]: 226/240 looper letters, 133 selfloop transitions, 71 changer transitions 103/307 dead transitions. [2023-08-23 23:01:10,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 307 transitions, 3322 flow [2023-08-23 23:01:10,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 23:01:10,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 23:01:10,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 814 transitions. [2023-08-23 23:01:10,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4845238095238095 [2023-08-23 23:01:10,439 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 814 transitions. [2023-08-23 23:01:10,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 814 transitions. [2023-08-23 23:01:10,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:01:10,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 814 transitions. [2023-08-23 23:01:10,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.28571428571429) internal successors, (814), 7 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:10,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:10,444 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:10,445 INFO L175 Difference]: Start difference. First operand has 75 places, 76 transitions, 656 flow. Second operand 7 states and 814 transitions. [2023-08-23 23:01:10,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 307 transitions, 3322 flow [2023-08-23 23:01:12,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 307 transitions, 2789 flow, removed 188 selfloop flow, removed 4 redundant places. [2023-08-23 23:01:12,541 INFO L231 Difference]: Finished difference. Result has 81 places, 114 transitions, 1157 flow [2023-08-23 23:01:12,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1157, PETRI_PLACES=81, PETRI_TRANSITIONS=114} [2023-08-23 23:01:12,542 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 39 predicate places. [2023-08-23 23:01:12,543 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 114 transitions, 1157 flow [2023-08-23 23:01:12,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:12,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:12,544 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:01:12,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-23 23:01:12,544 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:12,544 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:12,544 INFO L85 PathProgramCache]: Analyzing trace with hash 511535332, now seen corresponding path program 1 times [2023-08-23 23:01:12,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:12,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300637799] [2023-08-23 23:01:12,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:12,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:01:12,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:01:12,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:01:12,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300637799] [2023-08-23 23:01:12,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300637799] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:01:12,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:01:12,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:01:12,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068305456] [2023-08-23 23:01:12,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:01:12,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:01:12,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:01:12,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:01:12,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:01:12,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 240 [2023-08-23 23:01:12,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 114 transitions, 1157 flow. Second operand has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:12,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:01:12,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 240 [2023-08-23 23:01:12,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:01:13,799 INFO L124 PetriNetUnfolderBase]: 7526/11792 cut-off events. [2023-08-23 23:01:13,799 INFO L125 PetriNetUnfolderBase]: For 47227/47227 co-relation queries the response was YES. [2023-08-23 23:01:13,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56743 conditions, 11792 events. 7526/11792 cut-off events. For 47227/47227 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 74893 event pairs, 1229 based on Foata normal form. 12/11804 useless extension candidates. Maximal degree in co-relation 56706. Up to 4978 conditions per place. [2023-08-23 23:01:13,866 INFO L140 encePairwiseOnDemand]: 230/240 looper letters, 113 selfloop transitions, 55 changer transitions 59/227 dead transitions. [2023-08-23 23:01:13,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 227 transitions, 2609 flow [2023-08-23 23:01:13,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-23 23:01:13,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-23 23:01:13,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 484 transitions. [2023-08-23 23:01:13,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5041666666666667 [2023-08-23 23:01:13,869 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 484 transitions. [2023-08-23 23:01:13,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 484 transitions. [2023-08-23 23:01:13,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:01:13,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 484 transitions. [2023-08-23 23:01:13,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:13,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:13,873 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:13,873 INFO L175 Difference]: Start difference. First operand has 81 places, 114 transitions, 1157 flow. Second operand 4 states and 484 transitions. [2023-08-23 23:01:13,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 227 transitions, 2609 flow [2023-08-23 23:01:14,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 227 transitions, 2457 flow, removed 76 selfloop flow, removed 5 redundant places. [2023-08-23 23:01:14,254 INFO L231 Difference]: Finished difference. Result has 76 places, 119 transitions, 1356 flow [2023-08-23 23:01:14,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1356, PETRI_PLACES=76, PETRI_TRANSITIONS=119} [2023-08-23 23:01:14,254 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 34 predicate places. [2023-08-23 23:01:14,254 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 119 transitions, 1356 flow [2023-08-23 23:01:14,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:14,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:14,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:01:14,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-23 23:01:14,255 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:14,255 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:14,256 INFO L85 PathProgramCache]: Analyzing trace with hash -443683906, now seen corresponding path program 2 times [2023-08-23 23:01:14,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:14,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846577862] [2023-08-23 23:01:14,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:14,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:01:14,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:01:14,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:01:14,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846577862] [2023-08-23 23:01:14,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846577862] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:01:14,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:01:14,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-23 23:01:14,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053102044] [2023-08-23 23:01:14,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:01:14,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 23:01:14,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:01:14,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 23:01:14,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-23 23:01:14,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 240 [2023-08-23 23:01:14,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 119 transitions, 1356 flow. Second operand has 7 states, 7 states have (on average 111.71428571428571) internal successors, (782), 7 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:14,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:01:14,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 240 [2023-08-23 23:01:14,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:01:15,373 INFO L124 PetriNetUnfolderBase]: 4284/7346 cut-off events. [2023-08-23 23:01:15,373 INFO L125 PetriNetUnfolderBase]: For 28377/29000 co-relation queries the response was YES. [2023-08-23 23:01:15,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33438 conditions, 7346 events. 4284/7346 cut-off events. For 28377/29000 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 53492 event pairs, 324 based on Foata normal form. 426/7601 useless extension candidates. Maximal degree in co-relation 33401. Up to 2523 conditions per place. [2023-08-23 23:01:15,407 INFO L140 encePairwiseOnDemand]: 233/240 looper letters, 73 selfloop transitions, 18 changer transitions 137/248 dead transitions. [2023-08-23 23:01:15,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 248 transitions, 2976 flow [2023-08-23 23:01:15,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-23 23:01:15,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-23 23:01:15,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 953 transitions. [2023-08-23 23:01:15,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49635416666666665 [2023-08-23 23:01:15,410 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 953 transitions. [2023-08-23 23:01:15,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 953 transitions. [2023-08-23 23:01:15,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:01:15,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 953 transitions. [2023-08-23 23:01:15,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 119.125) internal successors, (953), 8 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:15,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 240.0) internal successors, (2160), 9 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:15,415 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 240.0) internal successors, (2160), 9 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:15,415 INFO L175 Difference]: Start difference. First operand has 76 places, 119 transitions, 1356 flow. Second operand 8 states and 953 transitions. [2023-08-23 23:01:15,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 248 transitions, 2976 flow [2023-08-23 23:01:15,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 248 transitions, 2939 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-08-23 23:01:15,750 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 722 flow [2023-08-23 23:01:15,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=1301, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=722, PETRI_PLACES=84, PETRI_TRANSITIONS=70} [2023-08-23 23:01:15,750 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 42 predicate places. [2023-08-23 23:01:15,750 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 70 transitions, 722 flow [2023-08-23 23:01:15,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.71428571428571) internal successors, (782), 7 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:15,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:15,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:01:15,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-23 23:01:15,751 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:15,751 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:15,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1722705330, now seen corresponding path program 1 times [2023-08-23 23:01:15,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:15,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630979414] [2023-08-23 23:01:15,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:15,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:01:15,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:01:15,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:01:15,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630979414] [2023-08-23 23:01:15,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630979414] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:01:15,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:01:15,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:01:15,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246510229] [2023-08-23 23:01:15,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:01:15,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:01:15,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:01:15,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:01:15,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:01:15,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 240 [2023-08-23 23:01:15,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 70 transitions, 722 flow. Second operand has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:15,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:01:15,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 240 [2023-08-23 23:01:15,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:01:16,198 INFO L124 PetriNetUnfolderBase]: 1077/1883 cut-off events. [2023-08-23 23:01:16,198 INFO L125 PetriNetUnfolderBase]: For 10194/10194 co-relation queries the response was YES. [2023-08-23 23:01:16,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9853 conditions, 1883 events. 1077/1883 cut-off events. For 10194/10194 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9711 event pairs, 177 based on Foata normal form. 1/1884 useless extension candidates. Maximal degree in co-relation 9821. Up to 1139 conditions per place. [2023-08-23 23:01:16,206 INFO L140 encePairwiseOnDemand]: 234/240 looper letters, 55 selfloop transitions, 10 changer transitions 60/125 dead transitions. [2023-08-23 23:01:16,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 125 transitions, 1441 flow [2023-08-23 23:01:16,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-23 23:01:16,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-23 23:01:16,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 468 transitions. [2023-08-23 23:01:16,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4875 [2023-08-23 23:01:16,208 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 468 transitions. [2023-08-23 23:01:16,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 468 transitions. [2023-08-23 23:01:16,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:01:16,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 468 transitions. [2023-08-23 23:01:16,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:16,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:16,211 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:16,211 INFO L175 Difference]: Start difference. First operand has 84 places, 70 transitions, 722 flow. Second operand 4 states and 468 transitions. [2023-08-23 23:01:16,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 125 transitions, 1441 flow [2023-08-23 23:01:16,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 125 transitions, 1113 flow, removed 52 selfloop flow, removed 15 redundant places. [2023-08-23 23:01:16,245 INFO L231 Difference]: Finished difference. Result has 71 places, 51 transitions, 334 flow [2023-08-23 23:01:16,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=334, PETRI_PLACES=71, PETRI_TRANSITIONS=51} [2023-08-23 23:01:16,245 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 29 predicate places. [2023-08-23 23:01:16,245 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 51 transitions, 334 flow [2023-08-23 23:01:16,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:16,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:16,246 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:01:16,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-23 23:01:16,246 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:16,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:16,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1742156746, now seen corresponding path program 2 times [2023-08-23 23:01:16,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:16,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560007544] [2023-08-23 23:01:16,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:16,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:01:16,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:01:16,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:01:16,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560007544] [2023-08-23 23:01:16,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560007544] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:01:16,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:01:16,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 23:01:16,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169741702] [2023-08-23 23:01:16,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:01:16,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 23:01:16,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:01:16,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 23:01:16,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-23 23:01:16,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 240 [2023-08-23 23:01:16,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 51 transitions, 334 flow. Second operand has 7 states, 7 states have (on average 110.14285714285714) internal successors, (771), 7 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:16,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:01:16,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 240 [2023-08-23 23:01:16,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:01:17,279 INFO L124 PetriNetUnfolderBase]: 202/398 cut-off events. [2023-08-23 23:01:17,279 INFO L125 PetriNetUnfolderBase]: For 1060/1074 co-relation queries the response was YES. [2023-08-23 23:01:17,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1606 conditions, 398 events. 202/398 cut-off events. For 1060/1074 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1425 event pairs, 29 based on Foata normal form. 1/399 useless extension candidates. Maximal degree in co-relation 1589. Up to 221 conditions per place. [2023-08-23 23:01:17,281 INFO L140 encePairwiseOnDemand]: 234/240 looper letters, 46 selfloop transitions, 4 changer transitions 31/87 dead transitions. [2023-08-23 23:01:17,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 87 transitions, 694 flow [2023-08-23 23:01:17,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 23:01:17,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 23:01:17,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 791 transitions. [2023-08-23 23:01:17,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4708333333333333 [2023-08-23 23:01:17,284 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 791 transitions. [2023-08-23 23:01:17,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 791 transitions. [2023-08-23 23:01:17,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:01:17,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 791 transitions. [2023-08-23 23:01:17,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:17,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:17,289 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:17,289 INFO L175 Difference]: Start difference. First operand has 71 places, 51 transitions, 334 flow. Second operand 7 states and 791 transitions. [2023-08-23 23:01:17,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 87 transitions, 694 flow [2023-08-23 23:01:17,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 87 transitions, 606 flow, removed 14 selfloop flow, removed 11 redundant places. [2023-08-23 23:01:17,294 INFO L231 Difference]: Finished difference. Result has 66 places, 44 transitions, 235 flow [2023-08-23 23:01:17,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=235, PETRI_PLACES=66, PETRI_TRANSITIONS=44} [2023-08-23 23:01:17,295 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2023-08-23 23:01:17,295 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 44 transitions, 235 flow [2023-08-23 23:01:17,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.14285714285714) internal successors, (771), 7 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:17,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:17,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:01:17,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-23 23:01:17,296 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:17,296 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:17,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1189277932, now seen corresponding path program 3 times [2023-08-23 23:01:17,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:17,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103964524] [2023-08-23 23:01:17,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:17,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 23:01:17,335 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-23 23:01:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 23:01:17,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-23 23:01:17,401 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-23 23:01:17,401 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-23 23:01:17,403 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-23 23:01:17,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-23 23:01:17,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-23 23:01:17,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-23 23:01:17,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-23 23:01:17,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-23 23:01:17,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-23 23:01:17,405 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:01:17,410 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-23 23:01:17,410 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-23 23:01:17,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.08 11:01:17 BasicIcfg [2023-08-23 23:01:17,490 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-23 23:01:17,491 INFO L158 Benchmark]: Toolchain (without parser) took 28278.18ms. Allocated memory was 356.5MB in the beginning and 4.3GB in the end (delta: 3.9GB). Free memory was 331.2MB in the beginning and 3.5GB in the end (delta: -3.2GB). Peak memory consumption was 714.1MB. Max. memory is 16.0GB. [2023-08-23 23:01:17,491 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 356.5MB. Free memory is still 333.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-23 23:01:17,491 INFO L158 Benchmark]: CACSL2BoogieTranslator took 594.51ms. Allocated memory is still 356.5MB. Free memory was 330.7MB in the beginning and 307.2MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-23 23:01:17,491 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.87ms. Allocated memory is still 356.5MB. Free memory was 307.2MB in the beginning and 305.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-23 23:01:17,492 INFO L158 Benchmark]: Boogie Preprocessor took 45.29ms. Allocated memory is still 356.5MB. Free memory was 305.1MB in the beginning and 303.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-23 23:01:17,492 INFO L158 Benchmark]: RCFGBuilder took 692.74ms. Allocated memory is still 356.5MB. Free memory was 303.0MB in the beginning and 327.4MB in the end (delta: -24.4MB). Peak memory consumption was 38.1MB. Max. memory is 16.0GB. [2023-08-23 23:01:17,492 INFO L158 Benchmark]: TraceAbstraction took 26866.14ms. Allocated memory was 356.5MB in the beginning and 4.3GB in the end (delta: 3.9GB). Free memory was 326.4MB in the beginning and 3.5GB in the end (delta: -3.2GB). Peak memory consumption was 707.5MB. Max. memory is 16.0GB. [2023-08-23 23:01:17,493 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.19ms. Allocated memory is still 356.5MB. Free memory is still 333.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 594.51ms. Allocated memory is still 356.5MB. Free memory was 330.7MB in the beginning and 307.2MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 71.87ms. Allocated memory is still 356.5MB. Free memory was 307.2MB in the beginning and 305.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 45.29ms. Allocated memory is still 356.5MB. Free memory was 305.1MB in the beginning and 303.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 692.74ms. Allocated memory is still 356.5MB. Free memory was 303.0MB in the beginning and 327.4MB in the end (delta: -24.4MB). Peak memory consumption was 38.1MB. Max. memory is 16.0GB. * TraceAbstraction took 26866.14ms. Allocated memory was 356.5MB in the beginning and 4.3GB in the end (delta: 3.9GB). Free memory was 326.4MB in the beginning and 3.5GB in the end (delta: -3.2GB). Peak memory consumption was 707.5MB. 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: 4.0s, 137 PlacesBefore, 42 PlacesAfterwards, 126 TransitionsBefore, 30 TransitionsAfterwards, 2986 CoEnabledTransitionPairs, 6 FixpointIterations, 43 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 110 TotalNumberOfCompositions, 7942 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3394, independent: 3189, independent conditional: 0, independent unconditional: 3189, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1610, independent: 1567, independent conditional: 0, independent unconditional: 1567, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3394, independent: 1622, independent conditional: 0, independent unconditional: 1622, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 1610, unknown conditional: 0, unknown unconditional: 1610] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 114, Positive conditional cache size: 0, Positive unconditional cache size: 114, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L859] 0 pthread_t t605; [L860] FCALL, FORK 0 pthread_create(&t605, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t605, ((void *)0), P0, ((void *)0))=-3, t605={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L861] 0 pthread_t t606; [L862] FCALL, FORK 0 pthread_create(&t606, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t606, ((void *)0), P1, ((void *)0))=-2, t605={5:0}, t606={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L863] 0 pthread_t t607; [L864] FCALL, FORK 0 pthread_create(&t607, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t607, ((void *)0), P2, ((void *)0))=-1, t605={5:0}, t606={6:0}, t607={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L865] 0 pthread_t t608; [L866] FCALL, FORK 0 pthread_create(&t608, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t608, ((void *)0), P3, ((void *)0))=0, t605={5:0}, t606={6:0}, t607={7:0}, t608={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L798] 3 y$w_buff1 = y$w_buff0 [L799] 3 y$w_buff0 = 1 [L800] 3 y$w_buff1_used = y$w_buff0_used [L801] 3 y$w_buff0_used = (_Bool)1 [L802] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L802] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L803] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L804] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L805] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L806] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L807] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L808] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0: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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L811] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0: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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L828] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L831] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0: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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L834] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0: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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0: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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L837] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L838] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L839] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L840] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L841] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0: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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L770] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0: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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L773] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 2 y$flush_delayed = weak$$choice2 [L776] 2 y$mem_tmp = y [L777] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L778] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L779] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L780] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L781] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L783] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 __unbuffered_p1_EBX = y [L785] 2 y = y$flush_delayed ? y$mem_tmp : y [L786] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L814] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L816] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L817] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L818] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0: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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 4 return 0; [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L870] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L870] RET 0 assume_abort_if_not(main$tmp_guard0) [L872] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L873] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L874] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L875] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L876] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t605={5:0}, t606={6:0}, t607={7:0}, t608={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L879] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L881] 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}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0: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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] - 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: 864]: 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: 860]: 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: 862]: 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: 866]: 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 9 procedures, 166 locations, 7 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: 26.7s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 18.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 452 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 452 mSDsluCounter, 89 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1371 IncrementalHoareTripleChecker+Invalid, 1425 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 48 mSDtfsCounter, 1371 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1356occurred in iteration=10, InterpolantAutomatonStates: 69, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 1826 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-23 23:01:17,524 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...