/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 10:09:31,717 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 10:09:31,765 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-27 10:09:31,770 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 10:09:31,770 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 10:09:31,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 10:09:31,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 10:09:31,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 10:09:31,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 10:09:31,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 10:09:31,792 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 10:09:31,792 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 10:09:31,792 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 10:09:31,793 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 10:09:31,793 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 10:09:31,793 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 10:09:31,794 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 10:09:31,794 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 10:09:31,794 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 10:09:31,794 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 10:09:31,795 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 10:09:31,795 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 10:09:31,795 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 10:09:31,796 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 10:09:31,796 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 10:09:31,797 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 10:09:31,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 10:09:31,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:09:31,798 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 10:09:31,798 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 10:09:31,798 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 10:09:31,799 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 10:09:31,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 10:09:31,799 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 10:09:31,800 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 10:09:31,800 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 10:09:32,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 10:09:32,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 10:09:32,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 10:09:32,156 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 10:09:32,158 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 10:09:32,163 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_power.oepc_pso.oepc_rmo.oepc.i [2023-08-27 10:09:33,324 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 10:09:33,592 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 10:09:33,593 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.oepc_pso.oepc_rmo.oepc.i [2023-08-27 10:09:33,618 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/405ccd166/a5d01322c43843808a2d493cc201f369/FLAGeaaeb4dfe [2023-08-27 10:09:33,633 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/405ccd166/a5d01322c43843808a2d493cc201f369 [2023-08-27 10:09:33,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 10:09:33,640 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 10:09:33,643 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 10:09:33,644 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 10:09:33,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 10:09:33,648 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:09:33" (1/1) ... [2023-08-27 10:09:33,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@670b0f66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:09:33, skipping insertion in model container [2023-08-27 10:09:33,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:09:33" (1/1) ... [2023-08-27 10:09:33,707 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 10:09:34,017 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:09:34,031 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 10:09:34,061 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 10:09:34,063 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 10:09:34,093 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:09:34,120 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:09:34,120 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:09:34,126 INFO L206 MainTranslator]: Completed translation [2023-08-27 10:09:34,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:09:34 WrapperNode [2023-08-27 10:09:34,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 10:09:34,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 10:09:34,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 10:09:34,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 10:09:34,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:09:34" (1/1) ... [2023-08-27 10:09:34,164 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:09:34" (1/1) ... [2023-08-27 10:09:34,203 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 152 [2023-08-27 10:09:34,203 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 10:09:34,204 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 10:09:34,204 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 10:09:34,204 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 10:09:34,216 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:09:34" (1/1) ... [2023-08-27 10:09:34,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:09:34" (1/1) ... [2023-08-27 10:09:34,230 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:09:34" (1/1) ... [2023-08-27 10:09:34,231 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:09:34" (1/1) ... [2023-08-27 10:09:34,242 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:09:34" (1/1) ... [2023-08-27 10:09:34,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:09:34" (1/1) ... [2023-08-27 10:09:34,246 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:09:34" (1/1) ... [2023-08-27 10:09:34,248 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:09:34" (1/1) ... [2023-08-27 10:09:34,255 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 10:09:34,256 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 10:09:34,256 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 10:09:34,256 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 10:09:34,264 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:09:34" (1/1) ... [2023-08-27 10:09:34,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:09:34,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 10:09:34,302 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-27 10:09:34,327 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-27 10:09:34,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 10:09:34,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 10:09:34,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 10:09:34,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 10:09:34,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 10:09:34,344 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 10:09:34,344 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 10:09:34,344 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 10:09:34,344 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 10:09:34,344 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 10:09:34,344 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 10:09:34,344 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-27 10:09:34,345 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-27 10:09:34,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 10:09:34,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 10:09:34,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 10:09:34,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 10:09:34,347 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 10:09:34,478 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 10:09:34,480 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 10:09:34,813 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 10:09:34,935 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 10:09:34,935 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 10:09:34,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:09:34 BoogieIcfgContainer [2023-08-27 10:09:34,937 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 10:09:34,958 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 10:09:34,958 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 10:09:34,961 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 10:09:34,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 10:09:33" (1/3) ... [2023-08-27 10:09:34,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74061a5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:09:34, skipping insertion in model container [2023-08-27 10:09:34,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:09:34" (2/3) ... [2023-08-27 10:09:34,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74061a5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:09:34, skipping insertion in model container [2023-08-27 10:09:34,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:09:34" (3/3) ... [2023-08-27 10:09:34,964 INFO L112 eAbstractionObserver]: Analyzing ICFG mix047_power.oepc_pso.oepc_rmo.oepc.i [2023-08-27 10:09:34,983 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 10:09:34,983 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-27 10:09:34,984 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 10:09:35,051 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 10:09:35,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 143 transitions, 306 flow [2023-08-27 10:09:35,163 INFO L124 PetriNetUnfolderBase]: 3/139 cut-off events. [2023-08-27 10:09:35,163 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:09:35,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 3/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 109 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-27 10:09:35,168 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 143 transitions, 306 flow [2023-08-27 10:09:35,176 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 139 transitions, 290 flow [2023-08-27 10:09:35,178 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 10:09:35,188 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 139 transitions, 290 flow [2023-08-27 10:09:35,190 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 139 transitions, 290 flow [2023-08-27 10:09:35,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 139 transitions, 290 flow [2023-08-27 10:09:35,219 INFO L124 PetriNetUnfolderBase]: 3/139 cut-off events. [2023-08-27 10:09:35,219 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:09:35,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 3/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 109 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-27 10:09:35,224 INFO L119 LiptonReduction]: Number of co-enabled transitions 4666 [2023-08-27 10:09:39,097 INFO L134 LiptonReduction]: Checked pairs total: 17466 [2023-08-27 10:09:39,097 INFO L136 LiptonReduction]: Total number of compositions: 116 [2023-08-27 10:09:39,110 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 10:09:39,115 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;@62414dab, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 10:09:39,116 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-27 10:09:39,118 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 10:09:39,118 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-27 10:09:39,118 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:09:39,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:09:39,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-27 10:09:39,119 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:09:39,123 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:09:39,123 INFO L85 PathProgramCache]: Analyzing trace with hash 621949, now seen corresponding path program 1 times [2023-08-27 10:09:39,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:09:39,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507811563] [2023-08-27 10:09:39,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:09:39,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:09:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:09:39,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:09:39,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:09:39,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507811563] [2023-08-27 10:09:39,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507811563] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:09:39,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:09:39,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:09:39,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478887406] [2023-08-27 10:09:39,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:09:39,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:09:39,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:09:39,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:09:39,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:09:39,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 259 [2023-08-27 10:09:39,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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-27 10:09:39,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:09:39,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 259 [2023-08-27 10:09:39,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:09:41,721 INFO L124 PetriNetUnfolderBase]: 14489/20549 cut-off events. [2023-08-27 10:09:41,721 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2023-08-27 10:09:41,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40167 conditions, 20549 events. 14489/20549 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 122965 event pairs, 8213 based on Foata normal form. 0/16148 useless extension candidates. Maximal degree in co-relation 40155. Up to 16209 conditions per place. [2023-08-27 10:09:41,906 INFO L140 encePairwiseOnDemand]: 255/259 looper letters, 52 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-08-27 10:09:41,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 62 transitions, 253 flow [2023-08-27 10:09:41,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:09:41,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:09:41,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions. [2023-08-27 10:09:41,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.528957528957529 [2023-08-27 10:09:41,925 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 411 transitions. [2023-08-27 10:09:41,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 411 transitions. [2023-08-27 10:09:41,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:09:41,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 411 transitions. [2023-08-27 10:09:41,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 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-27 10:09:41,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 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-27 10:09:41,940 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 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-27 10:09:41,942 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 3 states and 411 transitions. [2023-08-27 10:09:41,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 62 transitions, 253 flow [2023-08-27 10:09:41,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 62 transitions, 246 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 10:09:41,950 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 88 flow [2023-08-27 10:09:41,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2023-08-27 10:09:41,955 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2023-08-27 10:09:41,955 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 88 flow [2023-08-27 10:09:41,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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-27 10:09:41,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:09:41,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 10:09:41,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 10:09:41,957 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:09:41,957 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:09:41,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1349084191, now seen corresponding path program 1 times [2023-08-27 10:09:41,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:09:41,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600634825] [2023-08-27 10:09:41,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:09:41,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:09:41,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:09:42,014 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-27 10:09:42,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:09:42,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600634825] [2023-08-27 10:09:42,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600634825] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:09:42,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:09:42,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:09:42,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911544863] [2023-08-27 10:09:42,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:09:42,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:09:42,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:09:42,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:09:42,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:09:42,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 259 [2023-08-27 10:09:42,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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-27 10:09:42,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:09:42,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 259 [2023-08-27 10:09:42,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:09:44,096 INFO L124 PetriNetUnfolderBase]: 14733/20282 cut-off events. [2023-08-27 10:09:44,096 INFO L125 PetriNetUnfolderBase]: For 877/877 co-relation queries the response was YES. [2023-08-27 10:09:44,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41688 conditions, 20282 events. 14733/20282 cut-off events. For 877/877 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 116601 event pairs, 4111 based on Foata normal form. 0/14460 useless extension candidates. Maximal degree in co-relation 41678. Up to 17701 conditions per place. [2023-08-27 10:09:44,204 INFO L140 encePairwiseOnDemand]: 246/259 looper letters, 53 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2023-08-27 10:09:44,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 62 transitions, 260 flow [2023-08-27 10:09:44,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:09:44,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:09:44,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions. [2023-08-27 10:09:44,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5212355212355212 [2023-08-27 10:09:44,207 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 405 transitions. [2023-08-27 10:09:44,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 405 transitions. [2023-08-27 10:09:44,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:09:44,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 405 transitions. [2023-08-27 10:09:44,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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-27 10:09:44,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 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-27 10:09:44,212 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 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-27 10:09:44,212 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 88 flow. Second operand 3 states and 405 transitions. [2023-08-27 10:09:44,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 62 transitions, 260 flow [2023-08-27 10:09:44,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 62 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:09:44,215 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 131 flow [2023-08-27 10:09:44,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=131, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-08-27 10:09:44,218 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2023-08-27 10:09:44,219 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 131 flow [2023-08-27 10:09:44,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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-27 10:09:44,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:09:44,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:09:44,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 10:09:44,225 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:09:44,229 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:09:44,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1687010846, now seen corresponding path program 1 times [2023-08-27 10:09:44,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:09:44,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887246688] [2023-08-27 10:09:44,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:09:44,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:09:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:09:44,371 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-27 10:09:44,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:09:44,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887246688] [2023-08-27 10:09:44,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887246688] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:09:44,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:09:44,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:09:44,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316522893] [2023-08-27 10:09:44,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:09:44,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:09:44,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:09:44,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:09:44,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:09:44,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 259 [2023-08-27 10:09:44,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 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-27 10:09:44,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:09:44,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 259 [2023-08-27 10:09:44,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:09:45,567 INFO L124 PetriNetUnfolderBase]: 9361/12854 cut-off events. [2023-08-27 10:09:45,567 INFO L125 PetriNetUnfolderBase]: For 753/753 co-relation queries the response was YES. [2023-08-27 10:09:45,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31015 conditions, 12854 events. 9361/12854 cut-off events. For 753/753 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 69993 event pairs, 2551 based on Foata normal form. 0/10584 useless extension candidates. Maximal degree in co-relation 31004. Up to 10272 conditions per place. [2023-08-27 10:09:45,635 INFO L140 encePairwiseOnDemand]: 250/259 looper letters, 49 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2023-08-27 10:09:45,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 269 flow [2023-08-27 10:09:45,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:09:45,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:09:45,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 510 transitions. [2023-08-27 10:09:45,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4922779922779923 [2023-08-27 10:09:45,638 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 510 transitions. [2023-08-27 10:09:45,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 510 transitions. [2023-08-27 10:09:45,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:09:45,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 510 transitions. [2023-08-27 10:09:45,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 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-27 10:09:45,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 259.0) internal successors, (1295), 5 states have internal predecessors, (1295), 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-27 10:09:45,642 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 259.0) internal successors, (1295), 5 states have internal predecessors, (1295), 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-27 10:09:45,642 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 131 flow. Second operand 4 states and 510 transitions. [2023-08-27 10:09:45,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 269 flow [2023-08-27 10:09:45,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 264 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:09:45,647 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 120 flow [2023-08-27 10:09:45,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-08-27 10:09:45,647 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2023-08-27 10:09:45,648 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 120 flow [2023-08-27 10:09:45,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 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-27 10:09:45,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:09:45,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:09:45,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 10:09:45,649 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:09:45,649 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:09:45,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1687010847, now seen corresponding path program 1 times [2023-08-27 10:09:45,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:09:45,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689700248] [2023-08-27 10:09:45,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:09:45,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:09:45,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:09:45,750 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-27 10:09:45,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:09:45,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689700248] [2023-08-27 10:09:45,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689700248] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:09:45,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:09:45,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:09:45,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554441408] [2023-08-27 10:09:45,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:09:45,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:09:45,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:09:45,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:09:45,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:09:45,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 259 [2023-08-27 10:09:45,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 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-27 10:09:45,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:09:45,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 259 [2023-08-27 10:09:45,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:09:46,662 INFO L124 PetriNetUnfolderBase]: 6400/8833 cut-off events. [2023-08-27 10:09:46,663 INFO L125 PetriNetUnfolderBase]: For 2384/2384 co-relation queries the response was YES. [2023-08-27 10:09:46,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21028 conditions, 8833 events. 6400/8833 cut-off events. For 2384/2384 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 46352 event pairs, 1877 based on Foata normal form. 0/8080 useless extension candidates. Maximal degree in co-relation 21016. Up to 3375 conditions per place. [2023-08-27 10:09:46,699 INFO L140 encePairwiseOnDemand]: 250/259 looper letters, 67 selfloop transitions, 9 changer transitions 0/80 dead transitions. [2023-08-27 10:09:46,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 80 transitions, 374 flow [2023-08-27 10:09:46,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:09:46,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:09:46,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 532 transitions. [2023-08-27 10:09:46,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2023-08-27 10:09:46,701 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 532 transitions. [2023-08-27 10:09:46,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 532 transitions. [2023-08-27 10:09:46,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:09:46,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 532 transitions. [2023-08-27 10:09:46,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 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-27 10:09:46,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 259.0) internal successors, (1295), 5 states have internal predecessors, (1295), 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-27 10:09:46,705 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 259.0) internal successors, (1295), 5 states have internal predecessors, (1295), 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-27 10:09:46,705 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 120 flow. Second operand 4 states and 532 transitions. [2023-08-27 10:09:46,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 80 transitions, 374 flow [2023-08-27 10:09:46,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 80 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:09:46,711 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 172 flow [2023-08-27 10:09:46,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=172, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-08-27 10:09:46,712 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2023-08-27 10:09:46,712 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 172 flow [2023-08-27 10:09:46,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 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-27 10:09:46,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:09:46,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:09:46,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 10:09:46,713 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:09:46,713 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:09:46,713 INFO L85 PathProgramCache]: Analyzing trace with hash -988662679, now seen corresponding path program 1 times [2023-08-27 10:09:46,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:09:46,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828135335] [2023-08-27 10:09:46,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:09:46,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:09:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:09:46,931 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-27 10:09:46,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:09:46,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828135335] [2023-08-27 10:09:46,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828135335] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:09:46,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:09:46,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:09:46,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104691072] [2023-08-27 10:09:46,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:09:46,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:09:46,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:09:46,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:09:46,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:09:46,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 259 [2023-08-27 10:09:46,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 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-27 10:09:46,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:09:46,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 259 [2023-08-27 10:09:46,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:09:50,149 INFO L124 PetriNetUnfolderBase]: 31850/42692 cut-off events. [2023-08-27 10:09:50,149 INFO L125 PetriNetUnfolderBase]: For 29451/29451 co-relation queries the response was YES. [2023-08-27 10:09:50,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110656 conditions, 42692 events. 31850/42692 cut-off events. For 29451/29451 co-relation queries the response was YES. Maximal size of possible extension queue 1248. Compared 233636 event pairs, 7758 based on Foata normal form. 0/40281 useless extension candidates. Maximal degree in co-relation 110643. Up to 15475 conditions per place. [2023-08-27 10:09:50,353 INFO L140 encePairwiseOnDemand]: 247/259 looper letters, 120 selfloop transitions, 20 changer transitions 0/140 dead transitions. [2023-08-27 10:09:50,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 140 transitions, 880 flow [2023-08-27 10:09:50,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:09:50,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:09:50,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 620 transitions. [2023-08-27 10:09:50,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47876447876447875 [2023-08-27 10:09:50,356 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 620 transitions. [2023-08-27 10:09:50,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 620 transitions. [2023-08-27 10:09:50,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:09:50,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 620 transitions. [2023-08-27 10:09:50,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.0) internal successors, (620), 5 states have internal predecessors, (620), 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-27 10:09:50,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 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-27 10:09:50,361 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 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-27 10:09:50,361 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 172 flow. Second operand 5 states and 620 transitions. [2023-08-27 10:09:50,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 140 transitions, 880 flow [2023-08-27 10:09:50,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 140 transitions, 814 flow, removed 16 selfloop flow, removed 2 redundant places. [2023-08-27 10:09:50,415 INFO L231 Difference]: Finished difference. Result has 56 places, 61 transitions, 314 flow [2023-08-27 10:09:50,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=314, PETRI_PLACES=56, PETRI_TRANSITIONS=61} [2023-08-27 10:09:50,416 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2023-08-27 10:09:50,416 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 61 transitions, 314 flow [2023-08-27 10:09:50,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 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-27 10:09:50,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:09:50,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:09:50,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 10:09:50,424 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:09:50,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:09:50,425 INFO L85 PathProgramCache]: Analyzing trace with hash -583799855, now seen corresponding path program 1 times [2023-08-27 10:09:50,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:09:50,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9169175] [2023-08-27 10:09:50,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:09:50,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:09:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:09:50,594 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-27 10:09:50,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:09:50,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9169175] [2023-08-27 10:09:50,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9169175] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:09:50,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:09:50,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:09:50,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908944731] [2023-08-27 10:09:50,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:09:50,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:09:50,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:09:50,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:09:50,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:09:50,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 259 [2023-08-27 10:09:50,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 61 transitions, 314 flow. Second operand has 5 states, 5 states have (on average 104.6) internal successors, (523), 5 states have internal predecessors, (523), 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-27 10:09:50,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:09:50,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 259 [2023-08-27 10:09:50,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:09:54,650 INFO L124 PetriNetUnfolderBase]: 35345/47356 cut-off events. [2023-08-27 10:09:54,650 INFO L125 PetriNetUnfolderBase]: For 58447/58447 co-relation queries the response was YES. [2023-08-27 10:09:54,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161418 conditions, 47356 events. 35345/47356 cut-off events. For 58447/58447 co-relation queries the response was YES. Maximal size of possible extension queue 1397. Compared 263132 event pairs, 2519 based on Foata normal form. 1435/47737 useless extension candidates. Maximal degree in co-relation 161401. Up to 14188 conditions per place. [2023-08-27 10:09:54,934 INFO L140 encePairwiseOnDemand]: 247/259 looper letters, 168 selfloop transitions, 40 changer transitions 0/208 dead transitions. [2023-08-27 10:09:54,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 208 transitions, 1476 flow [2023-08-27 10:09:54,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:09:54,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:09:54,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 855 transitions. [2023-08-27 10:09:54,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47159404302261443 [2023-08-27 10:09:54,938 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 855 transitions. [2023-08-27 10:09:54,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 855 transitions. [2023-08-27 10:09:54,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:09:54,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 855 transitions. [2023-08-27 10:09:54,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 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-27 10:09:54,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 259.0) internal successors, (2072), 8 states have internal predecessors, (2072), 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-27 10:09:54,944 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 259.0) internal successors, (2072), 8 states have internal predecessors, (2072), 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-27 10:09:54,944 INFO L175 Difference]: Start difference. First operand has 56 places, 61 transitions, 314 flow. Second operand 7 states and 855 transitions. [2023-08-27 10:09:54,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 208 transitions, 1476 flow [2023-08-27 10:09:54,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 208 transitions, 1476 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 10:09:54,985 INFO L231 Difference]: Finished difference. Result has 68 places, 93 transitions, 714 flow [2023-08-27 10:09:54,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=714, PETRI_PLACES=68, PETRI_TRANSITIONS=93} [2023-08-27 10:09:54,986 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 16 predicate places. [2023-08-27 10:09:54,986 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 93 transitions, 714 flow [2023-08-27 10:09:54,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.6) internal successors, (523), 5 states have internal predecessors, (523), 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-27 10:09:54,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:09:54,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:09:54,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 10:09:54,989 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:09:54,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:09:54,989 INFO L85 PathProgramCache]: Analyzing trace with hash -583806582, now seen corresponding path program 1 times [2023-08-27 10:09:54,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:09:54,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074287331] [2023-08-27 10:09:54,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:09:54,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:09:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:09:55,143 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-27 10:09:55,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:09:55,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074287331] [2023-08-27 10:09:55,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074287331] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:09:55,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:09:55,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:09:55,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393582138] [2023-08-27 10:09:55,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:09:55,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:09:55,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:09:55,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:09:55,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:09:55,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 259 [2023-08-27 10:09:55,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 93 transitions, 714 flow. Second operand has 5 states, 5 states have (on average 104.6) internal successors, (523), 5 states have internal predecessors, (523), 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-27 10:09:55,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:09:55,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 259 [2023-08-27 10:09:55,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:10:00,182 INFO L124 PetriNetUnfolderBase]: 40057/53693 cut-off events. [2023-08-27 10:10:00,182 INFO L125 PetriNetUnfolderBase]: For 176979/176979 co-relation queries the response was YES. [2023-08-27 10:10:00,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218348 conditions, 53693 events. 40057/53693 cut-off events. For 176979/176979 co-relation queries the response was YES. Maximal size of possible extension queue 1596. Compared 299491 event pairs, 4366 based on Foata normal form. 1355/53762 useless extension candidates. Maximal degree in co-relation 218323. Up to 13751 conditions per place. [2023-08-27 10:10:00,610 INFO L140 encePairwiseOnDemand]: 248/259 looper letters, 217 selfloop transitions, 67 changer transitions 0/284 dead transitions. [2023-08-27 10:10:00,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 284 transitions, 2598 flow [2023-08-27 10:10:00,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:10:00,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:10:00,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 851 transitions. [2023-08-27 10:10:00,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46938775510204084 [2023-08-27 10:10:00,613 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 851 transitions. [2023-08-27 10:10:00,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 851 transitions. [2023-08-27 10:10:00,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:10:00,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 851 transitions. [2023-08-27 10:10:00,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.57142857142857) internal successors, (851), 7 states have internal predecessors, (851), 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-27 10:10:00,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 259.0) internal successors, (2072), 8 states have internal predecessors, (2072), 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-27 10:10:00,619 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 259.0) internal successors, (2072), 8 states have internal predecessors, (2072), 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-27 10:10:00,619 INFO L175 Difference]: Start difference. First operand has 68 places, 93 transitions, 714 flow. Second operand 7 states and 851 transitions. [2023-08-27 10:10:00,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 284 transitions, 2598 flow [2023-08-27 10:10:02,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 284 transitions, 2598 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 10:10:02,918 INFO L231 Difference]: Finished difference. Result has 80 places, 146 transitions, 1576 flow [2023-08-27 10:10:02,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1576, PETRI_PLACES=80, PETRI_TRANSITIONS=146} [2023-08-27 10:10:02,919 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 28 predicate places. [2023-08-27 10:10:02,919 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 146 transitions, 1576 flow [2023-08-27 10:10:02,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.6) internal successors, (523), 5 states have internal predecessors, (523), 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-27 10:10:02,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:10:02,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:10:02,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 10:10:02,920 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:10:02,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:10:02,920 INFO L85 PathProgramCache]: Analyzing trace with hash -627053056, now seen corresponding path program 1 times [2023-08-27 10:10:02,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:10:02,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538377920] [2023-08-27 10:10:02,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:10:02,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:10:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:10:03,033 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-27 10:10:03,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:10:03,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538377920] [2023-08-27 10:10:03,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538377920] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:10:03,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:10:03,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:10:03,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234993223] [2023-08-27 10:10:03,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:10:03,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:10:03,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:10:03,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:10:03,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:10:03,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 259 [2023-08-27 10:10:03,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 146 transitions, 1576 flow. Second operand has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 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-27 10:10:03,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:10:03,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 259 [2023-08-27 10:10:03,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:10:10,447 INFO L124 PetriNetUnfolderBase]: 48820/67097 cut-off events. [2023-08-27 10:10:10,447 INFO L125 PetriNetUnfolderBase]: For 370176/374017 co-relation queries the response was YES. [2023-08-27 10:10:10,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304129 conditions, 67097 events. 48820/67097 cut-off events. For 370176/374017 co-relation queries the response was YES. Maximal size of possible extension queue 2588. Compared 424388 event pairs, 12453 based on Foata normal form. 2797/66805 useless extension candidates. Maximal degree in co-relation 304096. Up to 32203 conditions per place. [2023-08-27 10:10:11,050 INFO L140 encePairwiseOnDemand]: 253/259 looper letters, 230 selfloop transitions, 50 changer transitions 0/316 dead transitions. [2023-08-27 10:10:11,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 316 transitions, 3836 flow [2023-08-27 10:10:11,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:10:11,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:10:11,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 637 transitions. [2023-08-27 10:10:11,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4918918918918919 [2023-08-27 10:10:11,053 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 637 transitions. [2023-08-27 10:10:11,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 637 transitions. [2023-08-27 10:10:11,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:10:11,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 637 transitions. [2023-08-27 10:10:11,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 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-27 10:10:11,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 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-27 10:10:11,057 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 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-27 10:10:11,058 INFO L175 Difference]: Start difference. First operand has 80 places, 146 transitions, 1576 flow. Second operand 5 states and 637 transitions. [2023-08-27 10:10:11,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 316 transitions, 3836 flow [2023-08-27 10:10:15,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 316 transitions, 3836 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 10:10:15,033 INFO L231 Difference]: Finished difference. Result has 88 places, 195 transitions, 2474 flow [2023-08-27 10:10:15,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=1576, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2474, PETRI_PLACES=88, PETRI_TRANSITIONS=195} [2023-08-27 10:10:15,034 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 36 predicate places. [2023-08-27 10:10:15,034 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 195 transitions, 2474 flow [2023-08-27 10:10:15,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 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-27 10:10:15,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:10:15,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:10:15,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 10:10:15,034 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:10:15,035 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:10:15,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1670522384, now seen corresponding path program 1 times [2023-08-27 10:10:15,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:10:15,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485794015] [2023-08-27 10:10:15,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:10:15,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:10:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:10:15,154 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-27 10:10:15,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:10:15,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485794015] [2023-08-27 10:10:15,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485794015] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:10:15,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:10:15,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:10:15,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459004626] [2023-08-27 10:10:15,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:10:15,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:10:15,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:10:15,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:10:15,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:10:15,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 259 [2023-08-27 10:10:15,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 195 transitions, 2474 flow. Second operand has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 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-27 10:10:15,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:10:15,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 259 [2023-08-27 10:10:15,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:10:28,367 INFO L124 PetriNetUnfolderBase]: 76762/106222 cut-off events. [2023-08-27 10:10:28,367 INFO L125 PetriNetUnfolderBase]: For 794909/800677 co-relation queries the response was YES. [2023-08-27 10:10:28,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 513792 conditions, 106222 events. 76762/106222 cut-off events. For 794909/800677 co-relation queries the response was YES. Maximal size of possible extension queue 4124. Compared 727502 event pairs, 15959 based on Foata normal form. 3713/103884 useless extension candidates. Maximal degree in co-relation 513753. Up to 35214 conditions per place. [2023-08-27 10:10:29,427 INFO L140 encePairwiseOnDemand]: 254/259 looper letters, 213 selfloop transitions, 78 changer transitions 0/342 dead transitions. [2023-08-27 10:10:29,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 342 transitions, 4410 flow [2023-08-27 10:10:29,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:10:29,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:10:29,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 649 transitions. [2023-08-27 10:10:29,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5011583011583012 [2023-08-27 10:10:29,430 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 649 transitions. [2023-08-27 10:10:29,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 649 transitions. [2023-08-27 10:10:29,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:10:29,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 649 transitions. [2023-08-27 10:10:29,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 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-27 10:10:29,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 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-27 10:10:29,434 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 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-27 10:10:29,434 INFO L175 Difference]: Start difference. First operand has 88 places, 195 transitions, 2474 flow. Second operand 5 states and 649 transitions. [2023-08-27 10:10:29,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 342 transitions, 4410 flow [2023-08-27 10:10:44,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 342 transitions, 4400 flow, removed 5 selfloop flow, removed 0 redundant places. [2023-08-27 10:10:44,021 INFO L231 Difference]: Finished difference. Result has 96 places, 233 transitions, 3334 flow [2023-08-27 10:10:44,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=2464, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3334, PETRI_PLACES=96, PETRI_TRANSITIONS=233} [2023-08-27 10:10:44,022 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 44 predicate places. [2023-08-27 10:10:44,022 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 233 transitions, 3334 flow [2023-08-27 10:10:44,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 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-27 10:10:44,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:10:44,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:10:44,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 10:10:44,023 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:10:44,023 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:10:44,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1438806814, now seen corresponding path program 1 times [2023-08-27 10:10:44,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:10:44,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360742809] [2023-08-27 10:10:44,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:10:44,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:10:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:10:44,171 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-27 10:10:44,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:10:44,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360742809] [2023-08-27 10:10:44,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360742809] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:10:44,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:10:44,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:10:44,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251837701] [2023-08-27 10:10:44,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:10:44,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:10:44,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:10:44,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:10:44,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:10:44,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 259 [2023-08-27 10:10:44,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 233 transitions, 3334 flow. Second operand has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 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-27 10:10:44,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:10:44,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 259 [2023-08-27 10:10:44,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:10:45,925 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L827-->L843: Formula: (let ((.cse3 (= (mod v_~b$r_buff1_thd4~0_62 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse12 (= (mod v_~b$w_buff0_used~0_154 256) 0)) (.cse5 (and .cse3 .cse7)) (.cse6 (and .cse7 (= (mod v_~b$w_buff1_used~0_141 256) 0)))) (let ((.cse9 (or .cse12 .cse5 .cse6)) (.cse10 (and .cse8 (not .cse12)))) (let ((.cse1 (= (mod v_~b$w_buff1_used~0_140 256) 0)) (.cse4 (= (mod v_~b$w_buff0_used~0_153 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse11 (ite .cse9 v_~b~0_78 (ite .cse10 v_~b$w_buff0~0_51 v_~b$w_buff1~0_46)))) (and (= v_~b$mem_tmp~0_18 v_~b~0_78) (= v_~b$flush_delayed~0_25 0) (= v_~b$r_buff1_thd4~0_61 (ite .cse0 v_~b$r_buff1_thd4~0_62 (ite (let ((.cse2 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse2) .cse4)) v_~b$r_buff1_thd4~0_62 0))) (= v_~b$w_buff0~0_51 v_~b$w_buff0~0_50) (= (ite .cse0 v_~b$w_buff1_used~0_141 (ite (or .cse4 .cse5 .cse6) v_~b$w_buff1_used~0_141 0)) v_~b$w_buff1_used~0_140) (= (ite .cse0 v_~b$r_buff0_thd4~0_62 (ite (or .cse4 .cse5 (and .cse1 .cse7)) v_~b$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse4)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= v_~b$w_buff1~0_45 v_~b$w_buff1~0_46) (= v_~b$w_buff0_used~0_153 (ite .cse0 v_~b$w_buff0_used~0_154 (ite .cse9 v_~b$w_buff0_used~0_154 (ite .cse10 0 v_~b$w_buff0_used~0_154)))) (= .cse11 v_~__unbuffered_p3_EBX~0_16) (= v_~b~0_76 (ite .cse0 v_~b$mem_tmp~0_18 .cse11))))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_154, ~b~0=v_~b~0_78, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_141, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_62, ~b$w_buff1~0=v_~b$w_buff1~0_46, ~b$w_buff0~0=v_~b$w_buff0~0_51, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_153, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_11, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_76, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_140, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_61, ~b$w_buff1~0=v_~b$w_buff1~0_45, ~b$w_buff0~0=v_~b$w_buff0~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][141], [Black: 189#(<= ~y~0 0), Black: 195#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 32#L764true, Black: 193#(and (<= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 190#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 63#L878true, Black: 191#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), 187#true, 81#L843true, P2Thread1of1ForFork1InUse, Black: 211#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 205#(<= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork2InUse, Black: 206#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 207#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), P1Thread1of1ForFork0InUse, 242#true, 21#P2EXITtrue, Black: 209#(and (<= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 168#(<= 1 ~__unbuffered_cnt~0), P3Thread1of1ForFork3InUse, 232#(= ~y~0 1), Black: 224#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 221#(= ~x~0 0), Black: 162#(= ~__unbuffered_cnt~0 0), Black: 222#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), 173#(<= ~__unbuffered_cnt~0 1), 219#true, Black: 235#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 203#true, 125#L784true, Black: 233#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 230#true, Black: 179#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 181#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 178#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 176#true]) [2023-08-27 10:10:45,925 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 10:10:45,926 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 10:10:45,926 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 10:10:45,926 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 10:10:46,369 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([454] L784-->L791: Formula: (let ((.cse3 (not (= (mod v_~b$r_buff1_thd2~0_18 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd2~0_20 256) 0))) (.cse2 (not (= (mod v_~b$w_buff0_used~0_103 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse0 (and .cse5 (not (= (mod v_~b$w_buff0_used~0_104 256) 0)))) (.cse4 (and .cse3 (not (= (mod v_~b$w_buff1_used~0_97 256) 0))))) (and (= v_~b$w_buff0_used~0_103 (ite .cse0 0 v_~b$w_buff0_used~0_104)) (= (ite .cse1 0 v_~b$r_buff0_thd2~0_20) v_~b$r_buff0_thd2~0_19) (= v_~b$r_buff1_thd2~0_17 (ite (or (and .cse2 (not (= (mod v_~b$r_buff0_thd2~0_19 256) 0))) (and (not (= (mod v_~b$w_buff1_used~0_96 256) 0)) .cse3)) 0 v_~b$r_buff1_thd2~0_18)) (= (ite (or .cse1 .cse4) 0 v_~b$w_buff1_used~0_97) v_~b$w_buff1_used~0_96) (= v_~b~0_44 (ite .cse0 v_~b$w_buff0~0_24 (ite .cse4 v_~b$w_buff1~0_23 v_~b~0_45)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_104, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_20, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_97, ~b~0=v_~b~0_45, ~b$w_buff1~0=v_~b$w_buff1~0_23, ~b$w_buff0~0=v_~b$w_buff0~0_24, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_18} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_103, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_19, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_96, ~b~0=v_~b~0_44, ~b$w_buff1~0=v_~b$w_buff1~0_23, ~b$w_buff0~0=v_~b$w_buff0~0_24, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_17} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd2~0][38], [Black: 189#(<= ~y~0 0), Black: 195#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 193#(and (<= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 190#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 63#L878true, Black: 191#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 187#true, 105#L791true, 54#L771true, P2Thread1of1ForFork1InUse, Black: 211#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 205#(<= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, Black: 207#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 203#true, 242#true, 21#P2EXITtrue, 22#L827true, Black: 209#(and (<= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P3Thread1of1ForFork3InUse, 168#(<= 1 ~__unbuffered_cnt~0), 232#(= ~y~0 1), Black: 224#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 221#(= ~x~0 0), Black: 162#(= ~__unbuffered_cnt~0 0), Black: 222#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), 173#(<= ~__unbuffered_cnt~0 1), 219#true, Black: 235#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), Black: 233#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 230#true, Black: 179#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 181#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#true, 206#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 178#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-08-27 10:10:46,369 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-27 10:10:46,369 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:10:46,369 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:10:46,370 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:10:46,370 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L827-->L843: Formula: (let ((.cse3 (= (mod v_~b$r_buff1_thd4~0_62 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse12 (= (mod v_~b$w_buff0_used~0_154 256) 0)) (.cse5 (and .cse3 .cse7)) (.cse6 (and .cse7 (= (mod v_~b$w_buff1_used~0_141 256) 0)))) (let ((.cse9 (or .cse12 .cse5 .cse6)) (.cse10 (and .cse8 (not .cse12)))) (let ((.cse1 (= (mod v_~b$w_buff1_used~0_140 256) 0)) (.cse4 (= (mod v_~b$w_buff0_used~0_153 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse11 (ite .cse9 v_~b~0_78 (ite .cse10 v_~b$w_buff0~0_51 v_~b$w_buff1~0_46)))) (and (= v_~b$mem_tmp~0_18 v_~b~0_78) (= v_~b$flush_delayed~0_25 0) (= v_~b$r_buff1_thd4~0_61 (ite .cse0 v_~b$r_buff1_thd4~0_62 (ite (let ((.cse2 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse2) .cse4)) v_~b$r_buff1_thd4~0_62 0))) (= v_~b$w_buff0~0_51 v_~b$w_buff0~0_50) (= (ite .cse0 v_~b$w_buff1_used~0_141 (ite (or .cse4 .cse5 .cse6) v_~b$w_buff1_used~0_141 0)) v_~b$w_buff1_used~0_140) (= (ite .cse0 v_~b$r_buff0_thd4~0_62 (ite (or .cse4 .cse5 (and .cse1 .cse7)) v_~b$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse4)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= v_~b$w_buff1~0_45 v_~b$w_buff1~0_46) (= v_~b$w_buff0_used~0_153 (ite .cse0 v_~b$w_buff0_used~0_154 (ite .cse9 v_~b$w_buff0_used~0_154 (ite .cse10 0 v_~b$w_buff0_used~0_154)))) (= .cse11 v_~__unbuffered_p3_EBX~0_16) (= v_~b~0_76 (ite .cse0 v_~b$mem_tmp~0_18 .cse11))))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_154, ~b~0=v_~b~0_78, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_141, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_62, ~b$w_buff1~0=v_~b$w_buff1~0_46, ~b$w_buff0~0=v_~b$w_buff0~0_51, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_153, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_11, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_76, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_140, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_61, ~b$w_buff1~0=v_~b$w_buff1~0_45, ~b$w_buff0~0=v_~b$w_buff0~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][141], [Black: 189#(<= ~y~0 0), Black: 195#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 193#(and (<= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 190#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 63#L878true, Black: 191#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), 187#true, 54#L771true, 81#L843true, P2Thread1of1ForFork1InUse, Black: 211#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 205#(<= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork2InUse, Black: 206#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 207#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), P1Thread1of1ForFork0InUse, 242#true, 21#P2EXITtrue, Black: 209#(and (<= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 168#(<= 1 ~__unbuffered_cnt~0), P3Thread1of1ForFork3InUse, 232#(= ~y~0 1), Black: 224#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 221#(= ~x~0 0), Black: 162#(= ~__unbuffered_cnt~0 0), Black: 222#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), 173#(<= ~__unbuffered_cnt~0 1), 219#true, Black: 235#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 203#true, 125#L784true, Black: 233#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 230#true, Black: 179#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 181#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 178#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 176#true]) [2023-08-27 10:10:46,370 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-27 10:10:46,370 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:10:46,370 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:10:46,370 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:10:46,371 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L827-->L843: Formula: (let ((.cse3 (= (mod v_~b$r_buff1_thd4~0_62 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse12 (= (mod v_~b$w_buff0_used~0_154 256) 0)) (.cse5 (and .cse3 .cse7)) (.cse6 (and .cse7 (= (mod v_~b$w_buff1_used~0_141 256) 0)))) (let ((.cse9 (or .cse12 .cse5 .cse6)) (.cse10 (and .cse8 (not .cse12)))) (let ((.cse1 (= (mod v_~b$w_buff1_used~0_140 256) 0)) (.cse4 (= (mod v_~b$w_buff0_used~0_153 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse11 (ite .cse9 v_~b~0_78 (ite .cse10 v_~b$w_buff0~0_51 v_~b$w_buff1~0_46)))) (and (= v_~b$mem_tmp~0_18 v_~b~0_78) (= v_~b$flush_delayed~0_25 0) (= v_~b$r_buff1_thd4~0_61 (ite .cse0 v_~b$r_buff1_thd4~0_62 (ite (let ((.cse2 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse2) .cse4)) v_~b$r_buff1_thd4~0_62 0))) (= v_~b$w_buff0~0_51 v_~b$w_buff0~0_50) (= (ite .cse0 v_~b$w_buff1_used~0_141 (ite (or .cse4 .cse5 .cse6) v_~b$w_buff1_used~0_141 0)) v_~b$w_buff1_used~0_140) (= (ite .cse0 v_~b$r_buff0_thd4~0_62 (ite (or .cse4 .cse5 (and .cse1 .cse7)) v_~b$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse4)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= v_~b$w_buff1~0_45 v_~b$w_buff1~0_46) (= v_~b$w_buff0_used~0_153 (ite .cse0 v_~b$w_buff0_used~0_154 (ite .cse9 v_~b$w_buff0_used~0_154 (ite .cse10 0 v_~b$w_buff0_used~0_154)))) (= .cse11 v_~__unbuffered_p3_EBX~0_16) (= v_~b~0_76 (ite .cse0 v_~b$mem_tmp~0_18 .cse11))))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_154, ~b~0=v_~b~0_78, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_141, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_62, ~b$w_buff1~0=v_~b$w_buff1~0_46, ~b$w_buff0~0=v_~b$w_buff0~0_51, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_153, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_11, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_76, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_140, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_61, ~b$w_buff1~0=v_~b$w_buff1~0_45, ~b$w_buff0~0=v_~b$w_buff0~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][141], [Black: 189#(<= ~y~0 0), Black: 195#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 32#L764true, Black: 193#(and (<= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 190#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 191#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), 187#true, 81#L843true, P2Thread1of1ForFork1InUse, Black: 211#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 205#(<= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork2InUse, Black: 206#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 67#L885true, Black: 207#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), P1Thread1of1ForFork0InUse, 21#P2EXITtrue, 242#true, Black: 209#(and (<= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 168#(<= 1 ~__unbuffered_cnt~0), P3Thread1of1ForFork3InUse, 232#(= ~y~0 1), Black: 224#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 221#(= ~x~0 0), Black: 162#(= ~__unbuffered_cnt~0 0), Black: 222#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), 173#(<= ~__unbuffered_cnt~0 1), 219#true, Black: 235#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 125#L784true, 203#true, Black: 233#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 230#true, Black: 179#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 181#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 178#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 176#true]) [2023-08-27 10:10:46,371 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-27 10:10:46,371 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:10:46,371 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:10:46,371 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:10:47,029 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L885-->L18-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_7| (mod v_~main$tmp_guard1~0_10 256)) (= (ite (= (ite (not (and (= v_~z~0_15 2) (= v_~y~0_13 2) (= v_~x~0_11 2) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~__unbuffered_p3_EAX~0_10 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_10) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_7| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_13|)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~z~0=v_~z~0_15, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_13, ~x~0=v_~x~0_11} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_13|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_7|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~z~0=v_~z~0_15, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_13, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][174], [Black: 189#(<= ~y~0 0), 32#L764true, Black: 193#(and (<= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 190#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 191#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 187#true, 211#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 65#L18-1true, P2Thread1of1ForFork1InUse, 181#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork2InUse, Black: 205#(<= ~__unbuffered_p3_EAX~0 0), Black: 206#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 207#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), P1Thread1of1ForFork0InUse, 242#true, 21#P2EXITtrue, Black: 203#true, P3Thread1of1ForFork3InUse, Black: 209#(and (<= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 168#(<= 1 ~__unbuffered_cnt~0), 22#L827true, Black: 224#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 235#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), Black: 221#(= ~x~0 0), Black: 162#(= ~__unbuffered_cnt~0 0), Black: 222#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), 173#(<= ~__unbuffered_cnt~0 1), 219#true, 125#L784true, Black: 233#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 230#true, Black: 232#(= ~y~0 1), 195#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 179#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 176#true, Black: 178#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-08-27 10:10:47,029 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2023-08-27 10:10:47,030 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-27 10:10:47,030 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-27 10:10:47,030 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-27 10:10:47,156 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([454] L784-->L791: Formula: (let ((.cse3 (not (= (mod v_~b$r_buff1_thd2~0_18 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd2~0_20 256) 0))) (.cse2 (not (= (mod v_~b$w_buff0_used~0_103 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse0 (and .cse5 (not (= (mod v_~b$w_buff0_used~0_104 256) 0)))) (.cse4 (and .cse3 (not (= (mod v_~b$w_buff1_used~0_97 256) 0))))) (and (= v_~b$w_buff0_used~0_103 (ite .cse0 0 v_~b$w_buff0_used~0_104)) (= (ite .cse1 0 v_~b$r_buff0_thd2~0_20) v_~b$r_buff0_thd2~0_19) (= v_~b$r_buff1_thd2~0_17 (ite (or (and .cse2 (not (= (mod v_~b$r_buff0_thd2~0_19 256) 0))) (and (not (= (mod v_~b$w_buff1_used~0_96 256) 0)) .cse3)) 0 v_~b$r_buff1_thd2~0_18)) (= (ite (or .cse1 .cse4) 0 v_~b$w_buff1_used~0_97) v_~b$w_buff1_used~0_96) (= v_~b~0_44 (ite .cse0 v_~b$w_buff0~0_24 (ite .cse4 v_~b$w_buff1~0_23 v_~b~0_45)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_104, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_20, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_97, ~b~0=v_~b~0_45, ~b$w_buff1~0=v_~b$w_buff1~0_23, ~b$w_buff0~0=v_~b$w_buff0~0_24, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_18} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_103, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_19, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_96, ~b~0=v_~b~0_44, ~b$w_buff1~0=v_~b$w_buff1~0_23, ~b$w_buff0~0=v_~b$w_buff0~0_24, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_17} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd2~0][38], [Black: 189#(<= ~y~0 0), Black: 195#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 193#(and (<= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 190#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 191#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 187#true, 105#L791true, 54#L771true, P2Thread1of1ForFork1InUse, Black: 211#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 205#(<= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 67#L885true, Black: 207#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 203#true, 242#true, 21#P2EXITtrue, 22#L827true, Black: 209#(and (<= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P3Thread1of1ForFork3InUse, 168#(<= 1 ~__unbuffered_cnt~0), 232#(= ~y~0 1), Black: 224#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 221#(= ~x~0 0), Black: 162#(= ~__unbuffered_cnt~0 0), Black: 222#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), 173#(<= ~__unbuffered_cnt~0 1), 219#true, Black: 235#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), Black: 233#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 230#true, Black: 179#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 181#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#true, 206#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 178#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-08-27 10:10:47,157 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-27 10:10:47,157 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:10:47,157 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:10:47,157 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:10:47,157 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L827-->L843: Formula: (let ((.cse3 (= (mod v_~b$r_buff1_thd4~0_62 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse12 (= (mod v_~b$w_buff0_used~0_154 256) 0)) (.cse5 (and .cse3 .cse7)) (.cse6 (and .cse7 (= (mod v_~b$w_buff1_used~0_141 256) 0)))) (let ((.cse9 (or .cse12 .cse5 .cse6)) (.cse10 (and .cse8 (not .cse12)))) (let ((.cse1 (= (mod v_~b$w_buff1_used~0_140 256) 0)) (.cse4 (= (mod v_~b$w_buff0_used~0_153 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse11 (ite .cse9 v_~b~0_78 (ite .cse10 v_~b$w_buff0~0_51 v_~b$w_buff1~0_46)))) (and (= v_~b$mem_tmp~0_18 v_~b~0_78) (= v_~b$flush_delayed~0_25 0) (= v_~b$r_buff1_thd4~0_61 (ite .cse0 v_~b$r_buff1_thd4~0_62 (ite (let ((.cse2 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse2) .cse4)) v_~b$r_buff1_thd4~0_62 0))) (= v_~b$w_buff0~0_51 v_~b$w_buff0~0_50) (= (ite .cse0 v_~b$w_buff1_used~0_141 (ite (or .cse4 .cse5 .cse6) v_~b$w_buff1_used~0_141 0)) v_~b$w_buff1_used~0_140) (= (ite .cse0 v_~b$r_buff0_thd4~0_62 (ite (or .cse4 .cse5 (and .cse1 .cse7)) v_~b$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse4)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= v_~b$w_buff1~0_45 v_~b$w_buff1~0_46) (= v_~b$w_buff0_used~0_153 (ite .cse0 v_~b$w_buff0_used~0_154 (ite .cse9 v_~b$w_buff0_used~0_154 (ite .cse10 0 v_~b$w_buff0_used~0_154)))) (= .cse11 v_~__unbuffered_p3_EBX~0_16) (= v_~b~0_76 (ite .cse0 v_~b$mem_tmp~0_18 .cse11))))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_154, ~b~0=v_~b~0_78, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_141, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_62, ~b$w_buff1~0=v_~b$w_buff1~0_46, ~b$w_buff0~0=v_~b$w_buff0~0_51, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_153, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_11, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_76, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_140, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_61, ~b$w_buff1~0=v_~b$w_buff1~0_45, ~b$w_buff0~0=v_~b$w_buff0~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][141], [Black: 189#(<= ~y~0 0), Black: 195#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 193#(and (<= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 190#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 191#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), 187#true, 54#L771true, 81#L843true, P2Thread1of1ForFork1InUse, Black: 211#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 205#(<= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork2InUse, Black: 206#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 67#L885true, Black: 207#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), P1Thread1of1ForFork0InUse, 242#true, 21#P2EXITtrue, Black: 209#(and (<= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 168#(<= 1 ~__unbuffered_cnt~0), P3Thread1of1ForFork3InUse, 232#(= ~y~0 1), Black: 224#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 221#(= ~x~0 0), Black: 162#(= ~__unbuffered_cnt~0 0), Black: 222#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), 173#(<= ~__unbuffered_cnt~0 1), 219#true, Black: 235#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 125#L784true, 203#true, Black: 233#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 230#true, Black: 179#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 181#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 178#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 176#true]) [2023-08-27 10:10:47,157 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-27 10:10:47,157 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:10:47,157 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:10:47,157 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:10:47,516 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L885-->L18-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_7| (mod v_~main$tmp_guard1~0_10 256)) (= (ite (= (ite (not (and (= v_~z~0_15 2) (= v_~y~0_13 2) (= v_~x~0_11 2) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~__unbuffered_p3_EAX~0_10 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_10) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_7| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_13|)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~z~0=v_~z~0_15, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_13, ~x~0=v_~x~0_11} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_13|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_7|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~z~0=v_~z~0_15, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_13, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][174], [Black: 189#(<= ~y~0 0), Black: 193#(and (<= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 190#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 191#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 187#true, 54#L771true, 211#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 65#L18-1true, P2Thread1of1ForFork1InUse, 181#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork2InUse, Black: 205#(<= ~__unbuffered_p3_EAX~0 0), Black: 206#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 207#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), P1Thread1of1ForFork0InUse, Black: 203#true, 21#P2EXITtrue, 242#true, Black: 209#(and (<= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 168#(<= 1 ~__unbuffered_cnt~0), P3Thread1of1ForFork3InUse, 22#L827true, Black: 224#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 235#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), Black: 221#(= ~x~0 0), Black: 162#(= ~__unbuffered_cnt~0 0), Black: 222#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), 173#(<= ~__unbuffered_cnt~0 1), 219#true, 125#L784true, Black: 233#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 230#true, Black: 232#(= ~y~0 1), 195#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 179#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 176#true, Black: 178#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-08-27 10:10:47,517 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2023-08-27 10:10:47,517 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-08-27 10:10:47,517 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-08-27 10:10:47,517 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-08-27 10:10:50,772 INFO L124 PetriNetUnfolderBase]: 34665/51011 cut-off events. [2023-08-27 10:10:50,772 INFO L125 PetriNetUnfolderBase]: For 501883/508185 co-relation queries the response was YES. [2023-08-27 10:10:51,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256380 conditions, 51011 events. 34665/51011 cut-off events. For 501883/508185 co-relation queries the response was YES. Maximal size of possible extension queue 2216. Compared 365179 event pairs, 6319 based on Foata normal form. 3897/50752 useless extension candidates. Maximal degree in co-relation 256337. Up to 40548 conditions per place. [2023-08-27 10:10:51,476 INFO L140 encePairwiseOnDemand]: 252/259 looper letters, 231 selfloop transitions, 10 changer transitions 0/306 dead transitions. [2023-08-27 10:10:51,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 306 transitions, 4362 flow [2023-08-27 10:10:51,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:10:51,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:10:51,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 637 transitions. [2023-08-27 10:10:51,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4918918918918919 [2023-08-27 10:10:51,478 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 637 transitions. [2023-08-27 10:10:51,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 637 transitions. [2023-08-27 10:10:51,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:10:51,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 637 transitions. [2023-08-27 10:10:51,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 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-27 10:10:51,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 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-27 10:10:51,482 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 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-27 10:10:51,482 INFO L175 Difference]: Start difference. First operand has 96 places, 233 transitions, 3334 flow. Second operand 5 states and 637 transitions. [2023-08-27 10:10:51,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 306 transitions, 4362 flow [2023-08-27 10:10:55,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 306 transitions, 4342 flow, removed 10 selfloop flow, removed 0 redundant places. [2023-08-27 10:10:55,835 INFO L231 Difference]: Finished difference. Result has 103 places, 212 transitions, 2981 flow [2023-08-27 10:10:55,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=2910, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2981, PETRI_PLACES=103, PETRI_TRANSITIONS=212} [2023-08-27 10:10:55,836 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 51 predicate places. [2023-08-27 10:10:55,836 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 212 transitions, 2981 flow [2023-08-27 10:10:55,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 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-27 10:10:55,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:10:55,837 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-27 10:10:55,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 10:10:55,837 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:10:55,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:10:55,837 INFO L85 PathProgramCache]: Analyzing trace with hash 931888197, now seen corresponding path program 1 times [2023-08-27 10:10:55,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:10:55,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587084699] [2023-08-27 10:10:55,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:10:55,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:10:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:10:55,903 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-27 10:10:55,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:10:55,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587084699] [2023-08-27 10:10:55,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587084699] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:10:55,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:10:55,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:10:55,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540598363] [2023-08-27 10:10:55,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:10:55,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:10:55,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:10:55,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:10:55,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:10:55,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 259 [2023-08-27 10:10:55,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 212 transitions, 2981 flow. Second operand has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 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-27 10:10:55,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:10:55,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 259 [2023-08-27 10:10:55,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:10:57,566 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L827-->L843: Formula: (let ((.cse3 (= (mod v_~b$r_buff1_thd4~0_62 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse12 (= (mod v_~b$w_buff0_used~0_154 256) 0)) (.cse5 (and .cse3 .cse7)) (.cse6 (and .cse7 (= (mod v_~b$w_buff1_used~0_141 256) 0)))) (let ((.cse9 (or .cse12 .cse5 .cse6)) (.cse10 (and .cse8 (not .cse12)))) (let ((.cse1 (= (mod v_~b$w_buff1_used~0_140 256) 0)) (.cse4 (= (mod v_~b$w_buff0_used~0_153 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse11 (ite .cse9 v_~b~0_78 (ite .cse10 v_~b$w_buff0~0_51 v_~b$w_buff1~0_46)))) (and (= v_~b$mem_tmp~0_18 v_~b~0_78) (= v_~b$flush_delayed~0_25 0) (= v_~b$r_buff1_thd4~0_61 (ite .cse0 v_~b$r_buff1_thd4~0_62 (ite (let ((.cse2 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse2) .cse4)) v_~b$r_buff1_thd4~0_62 0))) (= v_~b$w_buff0~0_51 v_~b$w_buff0~0_50) (= (ite .cse0 v_~b$w_buff1_used~0_141 (ite (or .cse4 .cse5 .cse6) v_~b$w_buff1_used~0_141 0)) v_~b$w_buff1_used~0_140) (= (ite .cse0 v_~b$r_buff0_thd4~0_62 (ite (or .cse4 .cse5 (and .cse1 .cse7)) v_~b$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse4)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= v_~b$w_buff1~0_45 v_~b$w_buff1~0_46) (= v_~b$w_buff0_used~0_153 (ite .cse0 v_~b$w_buff0_used~0_154 (ite .cse9 v_~b$w_buff0_used~0_154 (ite .cse10 0 v_~b$w_buff0_used~0_154)))) (= .cse11 v_~__unbuffered_p3_EBX~0_16) (= v_~b~0_76 (ite .cse0 v_~b$mem_tmp~0_18 .cse11))))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_154, ~b~0=v_~b~0_78, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_141, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_62, ~b$w_buff1~0=v_~b$w_buff1~0_46, ~b$w_buff0~0=v_~b$w_buff0~0_51, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_153, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_11, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_76, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_140, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_61, ~b$w_buff1~0=v_~b$w_buff1~0_45, ~b$w_buff0~0=v_~b$w_buff0~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][105], [Black: 189#(<= ~y~0 0), Black: 195#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 32#L764true, Black: 193#(and (<= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 190#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 63#L878true, Black: 191#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), 187#true, 81#L843true, P2Thread1of1ForFork1InUse, Black: 211#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork2InUse, Black: 205#(<= ~__unbuffered_p3_EAX~0 0), Black: 206#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 207#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), P1Thread1of1ForFork0InUse, 242#true, 21#P2EXITtrue, P3Thread1of1ForFork3InUse, Black: 209#(and (<= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 168#(<= 1 ~__unbuffered_cnt~0), 232#(= ~y~0 1), Black: 224#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 221#(= ~x~0 0), Black: 162#(= ~__unbuffered_cnt~0 0), Black: 222#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), 173#(<= ~__unbuffered_cnt~0 1), 219#true, 125#L784true, 203#true, Black: 235#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), Black: 233#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 230#true, 255#(<= ~__unbuffered_cnt~0 1), Black: 179#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 181#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 247#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 178#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 244#(= ~__unbuffered_cnt~0 0), Black: 245#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 176#true]) [2023-08-27 10:10:57,566 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 10:10:57,566 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 10:10:57,566 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 10:10:57,567 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 10:10:58,157 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([454] L784-->L791: Formula: (let ((.cse3 (not (= (mod v_~b$r_buff1_thd2~0_18 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd2~0_20 256) 0))) (.cse2 (not (= (mod v_~b$w_buff0_used~0_103 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse0 (and .cse5 (not (= (mod v_~b$w_buff0_used~0_104 256) 0)))) (.cse4 (and .cse3 (not (= (mod v_~b$w_buff1_used~0_97 256) 0))))) (and (= v_~b$w_buff0_used~0_103 (ite .cse0 0 v_~b$w_buff0_used~0_104)) (= (ite .cse1 0 v_~b$r_buff0_thd2~0_20) v_~b$r_buff0_thd2~0_19) (= v_~b$r_buff1_thd2~0_17 (ite (or (and .cse2 (not (= (mod v_~b$r_buff0_thd2~0_19 256) 0))) (and (not (= (mod v_~b$w_buff1_used~0_96 256) 0)) .cse3)) 0 v_~b$r_buff1_thd2~0_18)) (= (ite (or .cse1 .cse4) 0 v_~b$w_buff1_used~0_97) v_~b$w_buff1_used~0_96) (= v_~b~0_44 (ite .cse0 v_~b$w_buff0~0_24 (ite .cse4 v_~b$w_buff1~0_23 v_~b~0_45)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_104, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_20, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_97, ~b~0=v_~b~0_45, ~b$w_buff1~0=v_~b$w_buff1~0_23, ~b$w_buff0~0=v_~b$w_buff0~0_24, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_18} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_103, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_19, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_96, ~b~0=v_~b~0_44, ~b$w_buff1~0=v_~b$w_buff1~0_23, ~b$w_buff0~0=v_~b$w_buff0~0_24, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_17} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd2~0][38], [Black: 189#(<= ~y~0 0), Black: 195#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 193#(and (<= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 63#L878true, 190#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 191#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 187#true, 105#L791true, 54#L771true, P2Thread1of1ForFork1InUse, Black: 211#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 205#(<= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, Black: 207#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), 242#true, 21#P2EXITtrue, Black: 203#true, P3Thread1of1ForFork3InUse, Black: 209#(and (<= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 22#L827true, 168#(<= 1 ~__unbuffered_cnt~0), 232#(= ~y~0 1), Black: 224#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 221#(= ~x~0 0), Black: 162#(= ~__unbuffered_cnt~0 0), Black: 222#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), 173#(<= ~__unbuffered_cnt~0 1), 219#true, Black: 235#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), Black: 233#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 230#true, 255#(<= ~__unbuffered_cnt~0 1), Black: 179#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 181#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 247#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 176#true, Black: 244#(= ~__unbuffered_cnt~0 0), 206#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 245#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 178#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-08-27 10:10:58,158 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-27 10:10:58,158 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:10:58,158 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:10:58,158 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:10:58,158 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L827-->L843: Formula: (let ((.cse3 (= (mod v_~b$r_buff1_thd4~0_62 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse12 (= (mod v_~b$w_buff0_used~0_154 256) 0)) (.cse5 (and .cse3 .cse7)) (.cse6 (and .cse7 (= (mod v_~b$w_buff1_used~0_141 256) 0)))) (let ((.cse9 (or .cse12 .cse5 .cse6)) (.cse10 (and .cse8 (not .cse12)))) (let ((.cse1 (= (mod v_~b$w_buff1_used~0_140 256) 0)) (.cse4 (= (mod v_~b$w_buff0_used~0_153 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse11 (ite .cse9 v_~b~0_78 (ite .cse10 v_~b$w_buff0~0_51 v_~b$w_buff1~0_46)))) (and (= v_~b$mem_tmp~0_18 v_~b~0_78) (= v_~b$flush_delayed~0_25 0) (= v_~b$r_buff1_thd4~0_61 (ite .cse0 v_~b$r_buff1_thd4~0_62 (ite (let ((.cse2 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse2) .cse4)) v_~b$r_buff1_thd4~0_62 0))) (= v_~b$w_buff0~0_51 v_~b$w_buff0~0_50) (= (ite .cse0 v_~b$w_buff1_used~0_141 (ite (or .cse4 .cse5 .cse6) v_~b$w_buff1_used~0_141 0)) v_~b$w_buff1_used~0_140) (= (ite .cse0 v_~b$r_buff0_thd4~0_62 (ite (or .cse4 .cse5 (and .cse1 .cse7)) v_~b$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse4)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= v_~b$w_buff1~0_45 v_~b$w_buff1~0_46) (= v_~b$w_buff0_used~0_153 (ite .cse0 v_~b$w_buff0_used~0_154 (ite .cse9 v_~b$w_buff0_used~0_154 (ite .cse10 0 v_~b$w_buff0_used~0_154)))) (= .cse11 v_~__unbuffered_p3_EBX~0_16) (= v_~b~0_76 (ite .cse0 v_~b$mem_tmp~0_18 .cse11))))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_154, ~b~0=v_~b~0_78, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_141, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_62, ~b$w_buff1~0=v_~b$w_buff1~0_46, ~b$w_buff0~0=v_~b$w_buff0~0_51, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_153, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_11, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_76, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_140, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_61, ~b$w_buff1~0=v_~b$w_buff1~0_45, ~b$w_buff0~0=v_~b$w_buff0~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][105], [Black: 189#(<= ~y~0 0), Black: 195#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 193#(and (<= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 190#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 63#L878true, Black: 191#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), 187#true, 54#L771true, 81#L843true, P2Thread1of1ForFork1InUse, Black: 211#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork2InUse, Black: 205#(<= ~__unbuffered_p3_EAX~0 0), Black: 206#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 207#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), P1Thread1of1ForFork0InUse, 242#true, 21#P2EXITtrue, P3Thread1of1ForFork3InUse, Black: 209#(and (<= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 168#(<= 1 ~__unbuffered_cnt~0), 232#(= ~y~0 1), Black: 224#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 221#(= ~x~0 0), Black: 162#(= ~__unbuffered_cnt~0 0), Black: 222#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), 173#(<= ~__unbuffered_cnt~0 1), 219#true, 125#L784true, 203#true, Black: 235#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), Black: 233#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 230#true, 255#(<= ~__unbuffered_cnt~0 1), Black: 179#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 181#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 247#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 178#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 244#(= ~__unbuffered_cnt~0 0), Black: 245#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 176#true]) [2023-08-27 10:10:58,158 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-27 10:10:58,158 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:10:58,158 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:10:58,158 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:10:58,159 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L827-->L843: Formula: (let ((.cse3 (= (mod v_~b$r_buff1_thd4~0_62 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse12 (= (mod v_~b$w_buff0_used~0_154 256) 0)) (.cse5 (and .cse3 .cse7)) (.cse6 (and .cse7 (= (mod v_~b$w_buff1_used~0_141 256) 0)))) (let ((.cse9 (or .cse12 .cse5 .cse6)) (.cse10 (and .cse8 (not .cse12)))) (let ((.cse1 (= (mod v_~b$w_buff1_used~0_140 256) 0)) (.cse4 (= (mod v_~b$w_buff0_used~0_153 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse11 (ite .cse9 v_~b~0_78 (ite .cse10 v_~b$w_buff0~0_51 v_~b$w_buff1~0_46)))) (and (= v_~b$mem_tmp~0_18 v_~b~0_78) (= v_~b$flush_delayed~0_25 0) (= v_~b$r_buff1_thd4~0_61 (ite .cse0 v_~b$r_buff1_thd4~0_62 (ite (let ((.cse2 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse2) .cse4)) v_~b$r_buff1_thd4~0_62 0))) (= v_~b$w_buff0~0_51 v_~b$w_buff0~0_50) (= (ite .cse0 v_~b$w_buff1_used~0_141 (ite (or .cse4 .cse5 .cse6) v_~b$w_buff1_used~0_141 0)) v_~b$w_buff1_used~0_140) (= (ite .cse0 v_~b$r_buff0_thd4~0_62 (ite (or .cse4 .cse5 (and .cse1 .cse7)) v_~b$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse4)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= v_~b$w_buff1~0_45 v_~b$w_buff1~0_46) (= v_~b$w_buff0_used~0_153 (ite .cse0 v_~b$w_buff0_used~0_154 (ite .cse9 v_~b$w_buff0_used~0_154 (ite .cse10 0 v_~b$w_buff0_used~0_154)))) (= .cse11 v_~__unbuffered_p3_EBX~0_16) (= v_~b~0_76 (ite .cse0 v_~b$mem_tmp~0_18 .cse11))))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_154, ~b~0=v_~b~0_78, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_141, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_62, ~b$w_buff1~0=v_~b$w_buff1~0_46, ~b$w_buff0~0=v_~b$w_buff0~0_51, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_153, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_11, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_76, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_140, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_61, ~b$w_buff1~0=v_~b$w_buff1~0_45, ~b$w_buff0~0=v_~b$w_buff0~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][105], [Black: 189#(<= ~y~0 0), Black: 195#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 32#L764true, Black: 193#(and (<= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 190#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 191#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), 187#true, 81#L843true, P2Thread1of1ForFork1InUse, Black: 211#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork2InUse, Black: 205#(<= ~__unbuffered_p3_EAX~0 0), Black: 206#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 207#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), P1Thread1of1ForFork0InUse, 67#L885true, 242#true, 21#P2EXITtrue, P3Thread1of1ForFork3InUse, Black: 209#(and (<= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 168#(<= 1 ~__unbuffered_cnt~0), 232#(= ~y~0 1), Black: 224#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 221#(= ~x~0 0), Black: 162#(= ~__unbuffered_cnt~0 0), Black: 222#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), 173#(<= ~__unbuffered_cnt~0 1), 219#true, Black: 235#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 203#true, 125#L784true, Black: 233#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 230#true, Black: 179#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), 255#(<= ~__unbuffered_cnt~0 1), Black: 181#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 247#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 178#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 244#(= ~__unbuffered_cnt~0 0), Black: 245#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 176#true]) [2023-08-27 10:10:58,159 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-27 10:10:58,159 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:10:58,159 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:10:58,159 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:10:58,476 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([454] L784-->L791: Formula: (let ((.cse3 (not (= (mod v_~b$r_buff1_thd2~0_18 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd2~0_20 256) 0))) (.cse2 (not (= (mod v_~b$w_buff0_used~0_103 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse0 (and .cse5 (not (= (mod v_~b$w_buff0_used~0_104 256) 0)))) (.cse4 (and .cse3 (not (= (mod v_~b$w_buff1_used~0_97 256) 0))))) (and (= v_~b$w_buff0_used~0_103 (ite .cse0 0 v_~b$w_buff0_used~0_104)) (= (ite .cse1 0 v_~b$r_buff0_thd2~0_20) v_~b$r_buff0_thd2~0_19) (= v_~b$r_buff1_thd2~0_17 (ite (or (and .cse2 (not (= (mod v_~b$r_buff0_thd2~0_19 256) 0))) (and (not (= (mod v_~b$w_buff1_used~0_96 256) 0)) .cse3)) 0 v_~b$r_buff1_thd2~0_18)) (= (ite (or .cse1 .cse4) 0 v_~b$w_buff1_used~0_97) v_~b$w_buff1_used~0_96) (= v_~b~0_44 (ite .cse0 v_~b$w_buff0~0_24 (ite .cse4 v_~b$w_buff1~0_23 v_~b~0_45)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_104, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_20, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_97, ~b~0=v_~b~0_45, ~b$w_buff1~0=v_~b$w_buff1~0_23, ~b$w_buff0~0=v_~b$w_buff0~0_24, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_18} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_103, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_19, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_96, ~b~0=v_~b~0_44, ~b$w_buff1~0=v_~b$w_buff1~0_23, ~b$w_buff0~0=v_~b$w_buff0~0_24, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_17} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd2~0][111], [Black: 189#(<= ~y~0 0), Black: 195#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 193#(and (<= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 63#L878true, 190#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 191#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 187#true, 105#L791true, P2Thread1of1ForFork1InUse, Black: 211#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 90#P0EXITtrue, P0Thread1of1ForFork2InUse, Black: 205#(<= ~__unbuffered_p3_EAX~0 0), P1Thread1of1ForFork0InUse, Black: 207#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 203#true, 21#P2EXITtrue, Black: 209#(and (<= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 168#(<= 1 ~__unbuffered_cnt~0), P3Thread1of1ForFork3InUse, 22#L827true, 245#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 256#(<= ~__unbuffered_cnt~0 2), 232#(= ~y~0 1), Black: 224#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 221#(= ~x~0 0), Black: 162#(= ~__unbuffered_cnt~0 0), Black: 222#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), 219#true, Black: 235#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), Black: 233#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 173#(<= ~__unbuffered_cnt~0 1), Black: 230#true, Black: 179#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 181#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#true, Black: 247#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 244#(= ~__unbuffered_cnt~0 0), 206#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 178#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-08-27 10:10:58,477 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-27 10:10:58,477 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:10:58,477 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:10:58,477 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:10:58,477 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L827-->L843: Formula: (let ((.cse3 (= (mod v_~b$r_buff1_thd4~0_62 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse12 (= (mod v_~b$w_buff0_used~0_154 256) 0)) (.cse5 (and .cse3 .cse7)) (.cse6 (and .cse7 (= (mod v_~b$w_buff1_used~0_141 256) 0)))) (let ((.cse9 (or .cse12 .cse5 .cse6)) (.cse10 (and .cse8 (not .cse12)))) (let ((.cse1 (= (mod v_~b$w_buff1_used~0_140 256) 0)) (.cse4 (= (mod v_~b$w_buff0_used~0_153 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse11 (ite .cse9 v_~b~0_78 (ite .cse10 v_~b$w_buff0~0_51 v_~b$w_buff1~0_46)))) (and (= v_~b$mem_tmp~0_18 v_~b~0_78) (= v_~b$flush_delayed~0_25 0) (= v_~b$r_buff1_thd4~0_61 (ite .cse0 v_~b$r_buff1_thd4~0_62 (ite (let ((.cse2 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse2) .cse4)) v_~b$r_buff1_thd4~0_62 0))) (= v_~b$w_buff0~0_51 v_~b$w_buff0~0_50) (= (ite .cse0 v_~b$w_buff1_used~0_141 (ite (or .cse4 .cse5 .cse6) v_~b$w_buff1_used~0_141 0)) v_~b$w_buff1_used~0_140) (= (ite .cse0 v_~b$r_buff0_thd4~0_62 (ite (or .cse4 .cse5 (and .cse1 .cse7)) v_~b$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse4)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= v_~b$w_buff1~0_45 v_~b$w_buff1~0_46) (= v_~b$w_buff0_used~0_153 (ite .cse0 v_~b$w_buff0_used~0_154 (ite .cse9 v_~b$w_buff0_used~0_154 (ite .cse10 0 v_~b$w_buff0_used~0_154)))) (= .cse11 v_~__unbuffered_p3_EBX~0_16) (= v_~b~0_76 (ite .cse0 v_~b$mem_tmp~0_18 .cse11))))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_154, ~b~0=v_~b~0_78, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_141, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_62, ~b$w_buff1~0=v_~b$w_buff1~0_46, ~b$w_buff0~0=v_~b$w_buff0~0_51, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_153, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_11, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_76, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_140, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_61, ~b$w_buff1~0=v_~b$w_buff1~0_45, ~b$w_buff0~0=v_~b$w_buff0~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][203], [Black: 189#(<= ~y~0 0), Black: 195#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 193#(and (<= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 63#L878true, Black: 190#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 191#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), 187#true, 81#L843true, P2Thread1of1ForFork1InUse, Black: 211#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 90#P0EXITtrue, P0Thread1of1ForFork2InUse, Black: 205#(<= ~__unbuffered_p3_EAX~0 0), Black: 206#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 207#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), P1Thread1of1ForFork0InUse, 21#P2EXITtrue, Black: 209#(and (<= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 168#(<= 1 ~__unbuffered_cnt~0), P3Thread1of1ForFork3InUse, 245#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 232#(= ~y~0 1), 256#(<= ~__unbuffered_cnt~0 2), Black: 224#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 221#(= ~x~0 0), Black: 162#(= ~__unbuffered_cnt~0 0), Black: 222#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), 219#true, Black: 235#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 125#L784true, 203#true, Black: 233#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 173#(<= ~__unbuffered_cnt~0 1), Black: 230#true, Black: 179#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 181#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 247#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 244#(= ~__unbuffered_cnt~0 0), Black: 178#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 176#true]) [2023-08-27 10:10:58,477 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-27 10:10:58,477 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:10:58,477 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:10:58,477 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:10:58,591 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L885-->L18-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_7| (mod v_~main$tmp_guard1~0_10 256)) (= (ite (= (ite (not (and (= v_~z~0_15 2) (= v_~y~0_13 2) (= v_~x~0_11 2) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~__unbuffered_p3_EAX~0_10 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_10) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_7| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_13|)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~z~0=v_~z~0_15, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_13, ~x~0=v_~x~0_11} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_13|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_7|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~z~0=v_~z~0_15, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_13, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][133], [Black: 189#(<= ~y~0 0), 32#L764true, Black: 193#(and (<= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 190#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 191#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 187#true, 211#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 65#L18-1true, P2Thread1of1ForFork1InUse, 181#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork2InUse, Black: 205#(<= ~__unbuffered_p3_EAX~0 0), Black: 206#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P1Thread1of1ForFork0InUse, Black: 207#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), 242#true, 21#P2EXITtrue, Black: 203#true, Black: 209#(and (<= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 168#(<= 1 ~__unbuffered_cnt~0), 22#L827true, P3Thread1of1ForFork3InUse, Black: 224#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 235#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), Black: 221#(= ~x~0 0), Black: 162#(= ~__unbuffered_cnt~0 0), Black: 222#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), 173#(<= ~__unbuffered_cnt~0 1), 219#true, 125#L784true, Black: 233#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 230#true, Black: 232#(= ~y~0 1), 195#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 179#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), 255#(<= ~__unbuffered_cnt~0 1), Black: 247#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 176#true, Black: 244#(= ~__unbuffered_cnt~0 0), Black: 178#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 245#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|))]) [2023-08-27 10:10:58,591 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2023-08-27 10:10:58,591 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-27 10:10:58,591 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-27 10:10:58,591 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-27 10:10:58,726 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([454] L784-->L791: Formula: (let ((.cse3 (not (= (mod v_~b$r_buff1_thd2~0_18 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd2~0_20 256) 0))) (.cse2 (not (= (mod v_~b$w_buff0_used~0_103 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse0 (and .cse5 (not (= (mod v_~b$w_buff0_used~0_104 256) 0)))) (.cse4 (and .cse3 (not (= (mod v_~b$w_buff1_used~0_97 256) 0))))) (and (= v_~b$w_buff0_used~0_103 (ite .cse0 0 v_~b$w_buff0_used~0_104)) (= (ite .cse1 0 v_~b$r_buff0_thd2~0_20) v_~b$r_buff0_thd2~0_19) (= v_~b$r_buff1_thd2~0_17 (ite (or (and .cse2 (not (= (mod v_~b$r_buff0_thd2~0_19 256) 0))) (and (not (= (mod v_~b$w_buff1_used~0_96 256) 0)) .cse3)) 0 v_~b$r_buff1_thd2~0_18)) (= (ite (or .cse1 .cse4) 0 v_~b$w_buff1_used~0_97) v_~b$w_buff1_used~0_96) (= v_~b~0_44 (ite .cse0 v_~b$w_buff0~0_24 (ite .cse4 v_~b$w_buff1~0_23 v_~b~0_45)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_104, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_20, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_97, ~b~0=v_~b~0_45, ~b$w_buff1~0=v_~b$w_buff1~0_23, ~b$w_buff0~0=v_~b$w_buff0~0_24, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_18} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_103, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_19, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_96, ~b~0=v_~b~0_44, ~b$w_buff1~0=v_~b$w_buff1~0_23, ~b$w_buff0~0=v_~b$w_buff0~0_24, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_17} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd2~0][38], [Black: 189#(<= ~y~0 0), Black: 195#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 193#(and (<= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 190#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 191#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 187#true, 105#L791true, 54#L771true, P2Thread1of1ForFork1InUse, Black: 211#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 205#(<= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 67#L885true, Black: 207#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 203#true, 242#true, 21#P2EXITtrue, P3Thread1of1ForFork3InUse, Black: 209#(and (<= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 22#L827true, 168#(<= 1 ~__unbuffered_cnt~0), 232#(= ~y~0 1), Black: 224#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 221#(= ~x~0 0), Black: 162#(= ~__unbuffered_cnt~0 0), Black: 222#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), 173#(<= ~__unbuffered_cnt~0 1), 219#true, Black: 235#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), Black: 233#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 230#true, Black: 179#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), 255#(<= ~__unbuffered_cnt~0 1), Black: 181#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#true, Black: 247#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 206#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 244#(= ~__unbuffered_cnt~0 0), Black: 245#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 178#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-08-27 10:10:58,726 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-27 10:10:58,726 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:10:58,726 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:10:58,726 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:10:58,727 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L827-->L843: Formula: (let ((.cse3 (= (mod v_~b$r_buff1_thd4~0_62 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse12 (= (mod v_~b$w_buff0_used~0_154 256) 0)) (.cse5 (and .cse3 .cse7)) (.cse6 (and .cse7 (= (mod v_~b$w_buff1_used~0_141 256) 0)))) (let ((.cse9 (or .cse12 .cse5 .cse6)) (.cse10 (and .cse8 (not .cse12)))) (let ((.cse1 (= (mod v_~b$w_buff1_used~0_140 256) 0)) (.cse4 (= (mod v_~b$w_buff0_used~0_153 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse11 (ite .cse9 v_~b~0_78 (ite .cse10 v_~b$w_buff0~0_51 v_~b$w_buff1~0_46)))) (and (= v_~b$mem_tmp~0_18 v_~b~0_78) (= v_~b$flush_delayed~0_25 0) (= v_~b$r_buff1_thd4~0_61 (ite .cse0 v_~b$r_buff1_thd4~0_62 (ite (let ((.cse2 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse2) .cse4)) v_~b$r_buff1_thd4~0_62 0))) (= v_~b$w_buff0~0_51 v_~b$w_buff0~0_50) (= (ite .cse0 v_~b$w_buff1_used~0_141 (ite (or .cse4 .cse5 .cse6) v_~b$w_buff1_used~0_141 0)) v_~b$w_buff1_used~0_140) (= (ite .cse0 v_~b$r_buff0_thd4~0_62 (ite (or .cse4 .cse5 (and .cse1 .cse7)) v_~b$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse4)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= v_~b$w_buff1~0_45 v_~b$w_buff1~0_46) (= v_~b$w_buff0_used~0_153 (ite .cse0 v_~b$w_buff0_used~0_154 (ite .cse9 v_~b$w_buff0_used~0_154 (ite .cse10 0 v_~b$w_buff0_used~0_154)))) (= .cse11 v_~__unbuffered_p3_EBX~0_16) (= v_~b~0_76 (ite .cse0 v_~b$mem_tmp~0_18 .cse11))))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_154, ~b~0=v_~b~0_78, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_141, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_62, ~b$w_buff1~0=v_~b$w_buff1~0_46, ~b$w_buff0~0=v_~b$w_buff0~0_51, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_153, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_11, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_76, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_140, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_61, ~b$w_buff1~0=v_~b$w_buff1~0_45, ~b$w_buff0~0=v_~b$w_buff0~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][105], [Black: 189#(<= ~y~0 0), Black: 195#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 193#(and (<= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 190#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 191#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), 187#true, 54#L771true, 81#L843true, P2Thread1of1ForFork1InUse, Black: 211#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork2InUse, Black: 205#(<= ~__unbuffered_p3_EAX~0 0), Black: 206#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 207#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), P1Thread1of1ForFork0InUse, 67#L885true, 242#true, 21#P2EXITtrue, P3Thread1of1ForFork3InUse, Black: 209#(and (<= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 168#(<= 1 ~__unbuffered_cnt~0), 232#(= ~y~0 1), Black: 224#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 221#(= ~x~0 0), Black: 162#(= ~__unbuffered_cnt~0 0), Black: 222#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), 173#(<= ~__unbuffered_cnt~0 1), 219#true, 203#true, Black: 235#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 125#L784true, Black: 233#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 230#true, 255#(<= ~__unbuffered_cnt~0 1), Black: 179#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 181#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 247#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 178#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 244#(= ~__unbuffered_cnt~0 0), Black: 245#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 176#true]) [2023-08-27 10:10:58,727 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-27 10:10:58,727 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:10:58,727 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:10:58,727 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:10:59,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L885-->L18-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_7| (mod v_~main$tmp_guard1~0_10 256)) (= (ite (= (ite (not (and (= v_~z~0_15 2) (= v_~y~0_13 2) (= v_~x~0_11 2) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~__unbuffered_p3_EAX~0_10 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_10) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_7| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_13|)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~z~0=v_~z~0_15, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_13, ~x~0=v_~x~0_11} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_13|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_7|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~z~0=v_~z~0_15, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_13, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][133], [Black: 189#(<= ~y~0 0), Black: 193#(and (<= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 190#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 191#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 187#true, 54#L771true, 211#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 65#L18-1true, P2Thread1of1ForFork1InUse, 181#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 205#(<= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork2InUse, Black: 206#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 207#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), P1Thread1of1ForFork0InUse, Black: 203#true, 242#true, 21#P2EXITtrue, 168#(<= 1 ~__unbuffered_cnt~0), 22#L827true, Black: 209#(and (<= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 224#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 235#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), Black: 221#(= ~x~0 0), Black: 162#(= ~__unbuffered_cnt~0 0), Black: 222#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), 173#(<= ~__unbuffered_cnt~0 1), 219#true, 125#L784true, Black: 233#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 230#true, Black: 232#(= ~y~0 1), 195#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 179#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), 255#(<= ~__unbuffered_cnt~0 1), Black: 247#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 176#true, Black: 178#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 244#(= ~__unbuffered_cnt~0 0), Black: 245#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|))]) [2023-08-27 10:10:59,362 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2023-08-27 10:10:59,362 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-08-27 10:10:59,362 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-08-27 10:10:59,362 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-08-27 10:11:01,606 INFO L124 PetriNetUnfolderBase]: 29767/43445 cut-off events. [2023-08-27 10:11:01,607 INFO L125 PetriNetUnfolderBase]: For 424283/429961 co-relation queries the response was YES. [2023-08-27 10:11:01,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220763 conditions, 43445 events. 29767/43445 cut-off events. For 424283/429961 co-relation queries the response was YES. Maximal size of possible extension queue 2058. Compared 305444 event pairs, 2406 based on Foata normal form. 1856/44109 useless extension candidates. Maximal degree in co-relation 220715. Up to 18932 conditions per place. [2023-08-27 10:11:02,251 INFO L140 encePairwiseOnDemand]: 250/259 looper letters, 349 selfloop transitions, 17 changer transitions 0/431 dead transitions. [2023-08-27 10:11:02,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 431 transitions, 6811 flow [2023-08-27 10:11:02,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:11:02,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:11:02,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 661 transitions. [2023-08-27 10:11:02,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5104247104247104 [2023-08-27 10:11:02,254 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 661 transitions. [2023-08-27 10:11:02,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 661 transitions. [2023-08-27 10:11:02,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:11:02,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 661 transitions. [2023-08-27 10:11:02,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 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-27 10:11:02,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 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-27 10:11:02,258 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 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-27 10:11:02,258 INFO L175 Difference]: Start difference. First operand has 103 places, 212 transitions, 2981 flow. Second operand 5 states and 661 transitions. [2023-08-27 10:11:02,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 431 transitions, 6811 flow [2023-08-27 10:11:04,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 431 transitions, 6797 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:11:04,763 INFO L231 Difference]: Finished difference. Result has 106 places, 216 transitions, 3049 flow [2023-08-27 10:11:04,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=2967, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3049, PETRI_PLACES=106, PETRI_TRANSITIONS=216} [2023-08-27 10:11:04,763 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 54 predicate places. [2023-08-27 10:11:04,763 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 216 transitions, 3049 flow [2023-08-27 10:11:04,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 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-27 10:11:04,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:04,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:11:04,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 10:11:04,764 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:11:04,765 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:04,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1753394658, now seen corresponding path program 1 times [2023-08-27 10:11:04,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:04,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11723472] [2023-08-27 10:11:04,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:04,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:11:04,910 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-27 10:11:04,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:11:04,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11723472] [2023-08-27 10:11:04,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11723472] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:11:04,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:11:04,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:11:04,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412425826] [2023-08-27 10:11:04,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:11:04,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:11:04,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:11:04,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:11:04,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:11:04,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 259 [2023-08-27 10:11:04,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 216 transitions, 3049 flow. Second operand has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 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-27 10:11:04,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:11:04,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 259 [2023-08-27 10:11:04,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:11:16,104 INFO L124 PetriNetUnfolderBase]: 60478/86092 cut-off events. [2023-08-27 10:11:16,104 INFO L125 PetriNetUnfolderBase]: For 928430/928430 co-relation queries the response was YES. [2023-08-27 10:11:16,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477144 conditions, 86092 events. 60478/86092 cut-off events. For 928430/928430 co-relation queries the response was YES. Maximal size of possible extension queue 3226. Compared 602103 event pairs, 9537 based on Foata normal form. 636/86135 useless extension candidates. Maximal degree in co-relation 477095. Up to 20788 conditions per place. [2023-08-27 10:11:16,928 INFO L140 encePairwiseOnDemand]: 247/259 looper letters, 343 selfloop transitions, 201 changer transitions 12/556 dead transitions. [2023-08-27 10:11:16,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 556 transitions, 8357 flow [2023-08-27 10:11:16,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:11:16,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:11:16,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 875 transitions. [2023-08-27 10:11:16,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4826254826254826 [2023-08-27 10:11:16,930 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 875 transitions. [2023-08-27 10:11:16,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 875 transitions. [2023-08-27 10:11:16,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:11:16,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 875 transitions. [2023-08-27 10:11:16,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 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-27 10:11:16,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 259.0) internal successors, (2072), 8 states have internal predecessors, (2072), 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-27 10:11:16,935 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 259.0) internal successors, (2072), 8 states have internal predecessors, (2072), 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-27 10:11:16,935 INFO L175 Difference]: Start difference. First operand has 106 places, 216 transitions, 3049 flow. Second operand 7 states and 875 transitions. [2023-08-27 10:11:16,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 556 transitions, 8357 flow [2023-08-27 10:11:35,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 556 transitions, 8163 flow, removed 48 selfloop flow, removed 3 redundant places. [2023-08-27 10:11:35,578 INFO L231 Difference]: Finished difference. Result has 115 places, 352 transitions, 6317 flow [2023-08-27 10:11:35,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=3007, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6317, PETRI_PLACES=115, PETRI_TRANSITIONS=352} [2023-08-27 10:11:35,579 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 63 predicate places. [2023-08-27 10:11:35,579 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 352 transitions, 6317 flow [2023-08-27 10:11:35,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 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-27 10:11:35,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:35,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:11:35,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 10:11:35,580 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:11:35,580 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:35,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1995912006, now seen corresponding path program 1 times [2023-08-27 10:11:35,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:35,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470388396] [2023-08-27 10:11:35,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:35,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:35,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:11:35,719 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-27 10:11:35,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:11:35,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470388396] [2023-08-27 10:11:35,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470388396] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:11:35,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:11:35,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:11:35,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023745316] [2023-08-27 10:11:35,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:11:35,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:11:35,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:11:35,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:11:35,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:11:35,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 259 [2023-08-27 10:11:35,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 352 transitions, 6317 flow. Second operand has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 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-27 10:11:35,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:11:35,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 259 [2023-08-27 10:11:35,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:11:40,489 INFO L124 PetriNetUnfolderBase]: 21232/32795 cut-off events. [2023-08-27 10:11:40,489 INFO L125 PetriNetUnfolderBase]: For 315100/320318 co-relation queries the response was YES. [2023-08-27 10:11:40,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163876 conditions, 32795 events. 21232/32795 cut-off events. For 315100/320318 co-relation queries the response was YES. Maximal size of possible extension queue 1330. Compared 244945 event pairs, 2043 based on Foata normal form. 2820/34506 useless extension candidates. Maximal degree in co-relation 163821. Up to 13084 conditions per place. [2023-08-27 10:11:40,799 INFO L140 encePairwiseOnDemand]: 252/259 looper letters, 308 selfloop transitions, 19 changer transitions 4/408 dead transitions. [2023-08-27 10:11:40,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 408 transitions, 6839 flow [2023-08-27 10:11:40,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:11:40,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:11:40,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 890 transitions. [2023-08-27 10:11:40,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49089906232763375 [2023-08-27 10:11:40,802 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 890 transitions. [2023-08-27 10:11:40,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 890 transitions. [2023-08-27 10:11:40,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:11:40,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 890 transitions. [2023-08-27 10:11:40,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.14285714285714) internal successors, (890), 7 states have internal predecessors, (890), 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-27 10:11:40,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 259.0) internal successors, (2072), 8 states have internal predecessors, (2072), 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-27 10:11:40,806 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 259.0) internal successors, (2072), 8 states have internal predecessors, (2072), 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-27 10:11:40,807 INFO L175 Difference]: Start difference. First operand has 115 places, 352 transitions, 6317 flow. Second operand 7 states and 890 transitions. [2023-08-27 10:11:40,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 408 transitions, 6839 flow [2023-08-27 10:11:43,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 408 transitions, 6761 flow, removed 39 selfloop flow, removed 0 redundant places. [2023-08-27 10:11:43,901 INFO L231 Difference]: Finished difference. Result has 124 places, 248 transitions, 4231 flow [2023-08-27 10:11:43,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=4137, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4231, PETRI_PLACES=124, PETRI_TRANSITIONS=248} [2023-08-27 10:11:43,901 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 72 predicate places. [2023-08-27 10:11:43,902 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 248 transitions, 4231 flow [2023-08-27 10:11:43,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 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-27 10:11:43,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:43,902 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] [2023-08-27 10:11:43,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 10:11:43,902 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:11:43,902 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:43,902 INFO L85 PathProgramCache]: Analyzing trace with hash 183081354, now seen corresponding path program 1 times [2023-08-27 10:11:43,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:43,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298729842] [2023-08-27 10:11:43,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:43,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:43,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:11:44,052 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-27 10:11:44,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:11:44,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298729842] [2023-08-27 10:11:44,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298729842] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:11:44,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:11:44,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:11:44,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541878179] [2023-08-27 10:11:44,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:11:44,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:11:44,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:11:44,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:11:44,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:11:44,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 259 [2023-08-27 10:11:44,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 248 transitions, 4231 flow. Second operand has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 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-27 10:11:44,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:11:44,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 259 [2023-08-27 10:11:44,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:11:51,359 INFO L124 PetriNetUnfolderBase]: 32698/50880 cut-off events. [2023-08-27 10:11:51,359 INFO L125 PetriNetUnfolderBase]: For 525137/528652 co-relation queries the response was YES. [2023-08-27 10:11:51,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272240 conditions, 50880 events. 32698/50880 cut-off events. For 525137/528652 co-relation queries the response was YES. Maximal size of possible extension queue 2051. Compared 404159 event pairs, 8271 based on Foata normal form. 1405/50361 useless extension candidates. Maximal degree in co-relation 272180. Up to 21629 conditions per place. [2023-08-27 10:11:51,963 INFO L140 encePairwiseOnDemand]: 254/259 looper letters, 260 selfloop transitions, 108 changer transitions 8/438 dead transitions. [2023-08-27 10:11:51,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 438 transitions, 7613 flow [2023-08-27 10:11:51,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:11:51,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:11:51,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 646 transitions. [2023-08-27 10:11:51,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4988416988416988 [2023-08-27 10:11:51,965 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 646 transitions. [2023-08-27 10:11:51,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 646 transitions. [2023-08-27 10:11:51,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:11:51,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 646 transitions. [2023-08-27 10:11:51,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 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-27 10:11:51,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 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-27 10:11:51,969 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 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-27 10:11:51,969 INFO L175 Difference]: Start difference. First operand has 124 places, 248 transitions, 4231 flow. Second operand 5 states and 646 transitions. [2023-08-27 10:11:51,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 438 transitions, 7613 flow [2023-08-27 10:12:00,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 438 transitions, 7547 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-27 10:12:00,616 INFO L231 Difference]: Finished difference. Result has 127 places, 315 transitions, 6032 flow [2023-08-27 10:12:00,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=4197, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6032, PETRI_PLACES=127, PETRI_TRANSITIONS=315} [2023-08-27 10:12:00,617 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 75 predicate places. [2023-08-27 10:12:00,617 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 315 transitions, 6032 flow [2023-08-27 10:12:00,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 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-27 10:12:00,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:12:00,617 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] [2023-08-27 10:12:00,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 10:12:00,618 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:12:00,618 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:12:00,618 INFO L85 PathProgramCache]: Analyzing trace with hash 868770768, now seen corresponding path program 2 times [2023-08-27 10:12:00,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:12:00,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45113047] [2023-08-27 10:12:00,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:12:00,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:12:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:12:00,766 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-27 10:12:00,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:12:00,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45113047] [2023-08-27 10:12:00,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45113047] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:12:00,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:12:00,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:12:00,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977989827] [2023-08-27 10:12:00,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:12:00,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:12:00,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:12:00,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:12:00,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:12:00,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 259 [2023-08-27 10:12:00,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 315 transitions, 6032 flow. Second operand has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 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-27 10:12:00,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:12:00,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 259 [2023-08-27 10:12:00,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:12:06,059 INFO L124 PetriNetUnfolderBase]: 21625/33772 cut-off events. [2023-08-27 10:12:06,060 INFO L125 PetriNetUnfolderBase]: For 224460/229113 co-relation queries the response was YES. [2023-08-27 10:12:06,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158811 conditions, 33772 events. 21625/33772 cut-off events. For 224460/229113 co-relation queries the response was YES. Maximal size of possible extension queue 1892. Compared 263077 event pairs, 1644 based on Foata normal form. 1974/34633 useless extension candidates. Maximal degree in co-relation 158750. Up to 7899 conditions per place. [2023-08-27 10:12:06,412 INFO L140 encePairwiseOnDemand]: 252/259 looper letters, 319 selfloop transitions, 28 changer transitions 4/395 dead transitions. [2023-08-27 10:12:06,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 395 transitions, 6419 flow [2023-08-27 10:12:06,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 10:12:06,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 10:12:06,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1141 transitions. [2023-08-27 10:12:06,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4894894894894895 [2023-08-27 10:12:06,415 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1141 transitions. [2023-08-27 10:12:06,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1141 transitions. [2023-08-27 10:12:06,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:12:06,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1141 transitions. [2023-08-27 10:12:06,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 126.77777777777777) internal successors, (1141), 9 states have internal predecessors, (1141), 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-27 10:12:06,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 259.0) internal successors, (2590), 10 states have internal predecessors, (2590), 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-27 10:12:06,420 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 259.0) internal successors, (2590), 10 states have internal predecessors, (2590), 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-27 10:12:06,421 INFO L175 Difference]: Start difference. First operand has 127 places, 315 transitions, 6032 flow. Second operand 9 states and 1141 transitions. [2023-08-27 10:12:06,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 395 transitions, 6419 flow [2023-08-27 10:12:13,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 395 transitions, 6135 flow, removed 34 selfloop flow, removed 5 redundant places. [2023-08-27 10:12:13,259 INFO L231 Difference]: Finished difference. Result has 131 places, 192 transitions, 3055 flow [2023-08-27 10:12:13,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=2949, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3055, PETRI_PLACES=131, PETRI_TRANSITIONS=192} [2023-08-27 10:12:13,260 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 79 predicate places. [2023-08-27 10:12:13,260 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 192 transitions, 3055 flow [2023-08-27 10:12:13,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 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-27 10:12:13,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:12:13,260 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] [2023-08-27 10:12:13,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 10:12:13,260 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:12:13,261 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:12:13,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1988744110, now seen corresponding path program 1 times [2023-08-27 10:12:13,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:12:13,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958221077] [2023-08-27 10:12:13,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:12:13,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:12:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:12:13,351 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-27 10:12:13,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:12:13,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958221077] [2023-08-27 10:12:13,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958221077] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:12:13,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:12:13,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:12:13,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358685314] [2023-08-27 10:12:13,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:12:13,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:12:13,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:12:13,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:12:13,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:12:13,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 259 [2023-08-27 10:12:13,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 192 transitions, 3055 flow. Second operand has 6 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 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-27 10:12:13,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:12:13,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 259 [2023-08-27 10:12:13,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:12:18,206 INFO L124 PetriNetUnfolderBase]: 21429/33358 cut-off events. [2023-08-27 10:12:18,206 INFO L125 PetriNetUnfolderBase]: For 232561/236691 co-relation queries the response was YES. [2023-08-27 10:12:18,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171135 conditions, 33358 events. 21429/33358 cut-off events. For 232561/236691 co-relation queries the response was YES. Maximal size of possible extension queue 1899. Compared 257936 event pairs, 3246 based on Foata normal form. 901/33509 useless extension candidates. Maximal degree in co-relation 171072. Up to 12503 conditions per place. [2023-08-27 10:12:18,561 INFO L140 encePairwiseOnDemand]: 250/259 looper letters, 116 selfloop transitions, 23 changer transitions 162/324 dead transitions. [2023-08-27 10:12:18,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 324 transitions, 5619 flow [2023-08-27 10:12:18,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:12:18,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:12:18,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 767 transitions. [2023-08-27 10:12:18,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49356499356499356 [2023-08-27 10:12:18,563 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 767 transitions. [2023-08-27 10:12:18,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 767 transitions. [2023-08-27 10:12:18,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:12:18,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 767 transitions. [2023-08-27 10:12:18,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.83333333333333) internal successors, (767), 6 states have internal predecessors, (767), 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-27 10:12:18,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 259.0) internal successors, (1813), 7 states have internal predecessors, (1813), 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-27 10:12:18,567 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 259.0) internal successors, (1813), 7 states have internal predecessors, (1813), 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-27 10:12:18,567 INFO L175 Difference]: Start difference. First operand has 131 places, 192 transitions, 3055 flow. Second operand 6 states and 767 transitions. [2023-08-27 10:12:18,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 324 transitions, 5619 flow [2023-08-27 10:12:27,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 324 transitions, 5559 flow, removed 5 selfloop flow, removed 7 redundant places. [2023-08-27 10:12:27,479 INFO L231 Difference]: Finished difference. Result has 125 places, 89 transitions, 1148 flow [2023-08-27 10:12:27,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=2965, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1148, PETRI_PLACES=125, PETRI_TRANSITIONS=89} [2023-08-27 10:12:27,479 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 73 predicate places. [2023-08-27 10:12:27,479 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 89 transitions, 1148 flow [2023-08-27 10:12:27,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 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-27 10:12:27,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:12:27,480 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] [2023-08-27 10:12:27,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 10:12:27,480 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:12:27,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:12:27,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1081602903, now seen corresponding path program 1 times [2023-08-27 10:12:27,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:12:27,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183788718] [2023-08-27 10:12:27,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:12:27,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:12:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:12:27,721 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-27 10:12:27,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:12:27,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183788718] [2023-08-27 10:12:27,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183788718] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:12:27,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:12:27,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 10:12:27,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572115234] [2023-08-27 10:12:27,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:12:27,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 10:12:27,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:12:27,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 10:12:27,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-27 10:12:27,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 259 [2023-08-27 10:12:27,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 89 transitions, 1148 flow. Second operand has 7 states, 7 states have (on average 114.14285714285714) internal successors, (799), 7 states have internal predecessors, (799), 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-27 10:12:27,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:12:27,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 259 [2023-08-27 10:12:27,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:12:30,962 INFO L124 PetriNetUnfolderBase]: 17060/26633 cut-off events. [2023-08-27 10:12:30,963 INFO L125 PetriNetUnfolderBase]: For 166979/170829 co-relation queries the response was YES. [2023-08-27 10:12:31,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125265 conditions, 26633 events. 17060/26633 cut-off events. For 166979/170829 co-relation queries the response was YES. Maximal size of possible extension queue 1785. Compared 209615 event pairs, 1296 based on Foata normal form. 983/27048 useless extension candidates. Maximal degree in co-relation 125204. Up to 6958 conditions per place. [2023-08-27 10:12:31,220 INFO L140 encePairwiseOnDemand]: 252/259 looper letters, 53 selfloop transitions, 17 changer transitions 185/259 dead transitions. [2023-08-27 10:12:31,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 259 transitions, 3582 flow [2023-08-27 10:12:31,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 10:12:31,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 10:12:31,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1349 transitions. [2023-08-27 10:12:31,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4734994734994735 [2023-08-27 10:12:31,222 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1349 transitions. [2023-08-27 10:12:31,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1349 transitions. [2023-08-27 10:12:31,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:12:31,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1349 transitions. [2023-08-27 10:12:31,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 122.63636363636364) internal successors, (1349), 11 states have internal predecessors, (1349), 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-27 10:12:31,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 259.0) internal successors, (3108), 12 states have internal predecessors, (3108), 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-27 10:12:31,422 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 259.0) internal successors, (3108), 12 states have internal predecessors, (3108), 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-27 10:12:31,422 INFO L175 Difference]: Start difference. First operand has 125 places, 89 transitions, 1148 flow. Second operand 11 states and 1349 transitions. [2023-08-27 10:12:31,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 259 transitions, 3582 flow [2023-08-27 10:12:37,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 259 transitions, 2912 flow, removed 126 selfloop flow, removed 29 redundant places. [2023-08-27 10:12:37,185 INFO L231 Difference]: Finished difference. Result has 94 places, 41 transitions, 312 flow [2023-08-27 10:12:37,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=312, PETRI_PLACES=94, PETRI_TRANSITIONS=41} [2023-08-27 10:12:37,185 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 42 predicate places. [2023-08-27 10:12:37,185 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 41 transitions, 312 flow [2023-08-27 10:12:37,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.14285714285714) internal successors, (799), 7 states have internal predecessors, (799), 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-27 10:12:37,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:12:37,186 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, 1, 1] [2023-08-27 10:12:37,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-27 10:12:37,186 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:12:37,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:12:37,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1311953697, now seen corresponding path program 1 times [2023-08-27 10:12:37,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:12:37,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044570317] [2023-08-27 10:12:37,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:12:37,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:12:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:12:38,091 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-27 10:12:38,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:12:38,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044570317] [2023-08-27 10:12:38,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044570317] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:12:38,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:12:38,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-27 10:12:38,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248717053] [2023-08-27 10:12:38,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:12:38,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-27 10:12:38,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:12:38,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-27 10:12:38,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-27 10:12:38,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 259 [2023-08-27 10:12:38,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 41 transitions, 312 flow. Second operand has 9 states, 9 states have (on average 105.77777777777777) internal successors, (952), 9 states have internal predecessors, (952), 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-27 10:12:38,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:12:38,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 259 [2023-08-27 10:12:38,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:12:38,461 INFO L124 PetriNetUnfolderBase]: 543/923 cut-off events. [2023-08-27 10:12:38,462 INFO L125 PetriNetUnfolderBase]: For 2659/2663 co-relation queries the response was YES. [2023-08-27 10:12:38,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3877 conditions, 923 events. 543/923 cut-off events. For 2659/2663 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3684 event pairs, 137 based on Foata normal form. 1/918 useless extension candidates. Maximal degree in co-relation 3835. Up to 513 conditions per place. [2023-08-27 10:12:38,465 INFO L140 encePairwiseOnDemand]: 252/259 looper letters, 51 selfloop transitions, 4 changer transitions 32/91 dead transitions. [2023-08-27 10:12:38,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 91 transitions, 816 flow [2023-08-27 10:12:38,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 10:12:38,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 10:12:38,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 882 transitions. [2023-08-27 10:12:38,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42567567567567566 [2023-08-27 10:12:38,468 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 882 transitions. [2023-08-27 10:12:38,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 882 transitions. [2023-08-27 10:12:38,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:12:38,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 882 transitions. [2023-08-27 10:12:38,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 110.25) internal successors, (882), 8 states have internal predecessors, (882), 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-27 10:12:38,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 259.0) internal successors, (2331), 9 states have internal predecessors, (2331), 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-27 10:12:38,472 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 259.0) internal successors, (2331), 9 states have internal predecessors, (2331), 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-27 10:12:38,472 INFO L175 Difference]: Start difference. First operand has 94 places, 41 transitions, 312 flow. Second operand 8 states and 882 transitions. [2023-08-27 10:12:38,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 91 transitions, 816 flow [2023-08-27 10:12:38,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 91 transitions, 562 flow, removed 35 selfloop flow, removed 33 redundant places. [2023-08-27 10:12:38,478 INFO L231 Difference]: Finished difference. Result has 60 places, 41 transitions, 182 flow [2023-08-27 10:12:38,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=182, PETRI_PLACES=60, PETRI_TRANSITIONS=41} [2023-08-27 10:12:38,478 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 8 predicate places. [2023-08-27 10:12:38,478 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 41 transitions, 182 flow [2023-08-27 10:12:38,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 105.77777777777777) internal successors, (952), 9 states have internal predecessors, (952), 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-27 10:12:38,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:12:38,479 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, 1, 1] [2023-08-27 10:12:38,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-27 10:12:38,479 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:12:38,479 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:12:38,479 INFO L85 PathProgramCache]: Analyzing trace with hash -2061844545, now seen corresponding path program 2 times [2023-08-27 10:12:38,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:12:38,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16107061] [2023-08-27 10:12:38,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:12:38,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:12:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:12:38,544 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 10:12:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:12:38,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 10:12:38,663 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 10:12:38,664 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (22 of 23 remaining) [2023-08-27 10:12:38,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (21 of 23 remaining) [2023-08-27 10:12:38,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2023-08-27 10:12:38,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2023-08-27 10:12:38,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2023-08-27 10:12:38,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2023-08-27 10:12:38,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2023-08-27 10:12:38,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 23 remaining) [2023-08-27 10:12:38,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2023-08-27 10:12:38,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2023-08-27 10:12:38,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2023-08-27 10:12:38,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2023-08-27 10:12:38,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2023-08-27 10:12:38,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2023-08-27 10:12:38,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (8 of 23 remaining) [2023-08-27 10:12:38,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2023-08-27 10:12:38,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 23 remaining) [2023-08-27 10:12:38,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2023-08-27 10:12:38,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2023-08-27 10:12:38,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2023-08-27 10:12:38,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 23 remaining) [2023-08-27 10:12:38,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2023-08-27 10:12:38,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2023-08-27 10:12:38,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-27 10:12:38,670 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:12:38,675 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 10:12:38,676 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 10:12:38,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 10:12:38 BasicIcfg [2023-08-27 10:12:38,763 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 10:12:38,763 INFO L158 Benchmark]: Toolchain (without parser) took 185123.80ms. Allocated memory was 402.7MB in the beginning and 14.8GB in the end (delta: 14.4GB). Free memory was 377.6MB in the beginning and 8.9GB in the end (delta: -8.5GB). Peak memory consumption was 5.9GB. Max. memory is 16.0GB. [2023-08-27 10:12:38,763 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 402.7MB. Free memory was 380.6MB in the beginning and 380.4MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 10:12:38,764 INFO L158 Benchmark]: CACSL2BoogieTranslator took 483.89ms. Allocated memory is still 402.7MB. Free memory was 377.6MB in the beginning and 353.2MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 10:12:38,764 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.34ms. Allocated memory is still 402.7MB. Free memory was 353.2MB in the beginning and 351.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:12:38,764 INFO L158 Benchmark]: Boogie Preprocessor took 51.61ms. Allocated memory is still 402.7MB. Free memory was 351.0MB in the beginning and 348.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:12:38,764 INFO L158 Benchmark]: RCFGBuilder took 681.49ms. Allocated memory is still 402.7MB. Free memory was 348.9MB in the beginning and 305.0MB in the end (delta: 43.9MB). Peak memory consumption was 44.0MB. Max. memory is 16.0GB. [2023-08-27 10:12:38,773 INFO L158 Benchmark]: TraceAbstraction took 183805.19ms. Allocated memory was 520.1MB in the beginning and 14.8GB in the end (delta: 14.3GB). Free memory was 495.5MB in the beginning and 8.9GB in the end (delta: -8.4GB). Peak memory consumption was 5.9GB. Max. memory is 16.0GB. [2023-08-27 10:12:38,774 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.22ms. Allocated memory is still 402.7MB. Free memory was 380.6MB in the beginning and 380.4MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 483.89ms. Allocated memory is still 402.7MB. Free memory was 377.6MB in the beginning and 353.2MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 75.34ms. Allocated memory is still 402.7MB. Free memory was 353.2MB in the beginning and 351.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 51.61ms. Allocated memory is still 402.7MB. Free memory was 351.0MB in the beginning and 348.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 681.49ms. Allocated memory is still 402.7MB. Free memory was 348.9MB in the beginning and 305.0MB in the end (delta: 43.9MB). Peak memory consumption was 44.0MB. Max. memory is 16.0GB. * TraceAbstraction took 183805.19ms. Allocated memory was 520.1MB in the beginning and 14.8GB in the end (delta: 14.3GB). Free memory was 495.5MB in the beginning and 8.9GB in the end (delta: -8.4GB). Peak memory consumption was 5.9GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 149 PlacesBefore, 52 PlacesAfterwards, 139 TransitionsBefore, 40 TransitionsAfterwards, 4666 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 2 ChoiceCompositions, 116 TotalNumberOfCompositions, 17466 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5563, independent: 5195, independent conditional: 0, independent unconditional: 5195, dependent: 368, dependent conditional: 0, dependent unconditional: 368, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2511, independent: 2441, independent conditional: 0, independent unconditional: 2441, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5563, independent: 2754, independent conditional: 0, independent unconditional: 2754, dependent: 298, dependent conditional: 0, dependent unconditional: 298, unknown: 2511, unknown conditional: 0, unknown unconditional: 2511] , Statistics on independence cache: Total cache size (in pairs): 271, Positive cache size: 243, Positive conditional cache size: 0, Positive unconditional cache size: 243, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 0; [L719] 0 _Bool b$flush_delayed; [L720] 0 int b$mem_tmp; [L721] 0 _Bool b$r_buff0_thd0; [L722] 0 _Bool b$r_buff0_thd1; [L723] 0 _Bool b$r_buff0_thd2; [L724] 0 _Bool b$r_buff0_thd3; [L725] 0 _Bool b$r_buff0_thd4; [L726] 0 _Bool b$r_buff1_thd0; [L727] 0 _Bool b$r_buff1_thd1; [L728] 0 _Bool b$r_buff1_thd2; [L729] 0 _Bool b$r_buff1_thd3; [L730] 0 _Bool b$r_buff1_thd4; [L731] 0 _Bool b$read_delayed; [L732] 0 int *b$read_delayed_var; [L733] 0 int b$w_buff0; [L734] 0 _Bool b$w_buff0_used; [L735] 0 int b$w_buff1; [L736] 0 _Bool b$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L867] 0 pthread_t t1249; [L868] FCALL, FORK 0 pthread_create(&t1249, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1249, ((void *)0), P0, ((void *)0))=-3, t1249={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L869] 0 pthread_t t1250; [L870] FCALL, FORK 0 pthread_create(&t1250, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1250, ((void *)0), P1, ((void *)0))=-2, t1249={5:0}, t1250={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t1251; [L872] FCALL, FORK 0 pthread_create(&t1251, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1251, ((void *)0), P2, ((void *)0))=-1, t1249={5:0}, t1250={6:0}, t1251={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1252; [L874] FCALL, FORK 0 pthread_create(&t1252, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1252, ((void *)0), P3, ((void *)0))=0, t1249={5:0}, t1250={6:0}, t1251={7:0}, t1252={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 b$w_buff1 = b$w_buff0 [L751] 1 b$w_buff0 = 1 [L752] 1 b$w_buff1_used = b$w_buff0_used [L753] 1 b$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L755] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L756] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L757] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L758] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L759] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L760] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L800] 3 y = 2 VAL [__unbuffered_cnt=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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L803] 3 z = 1 VAL [__unbuffered_cnt=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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L806] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L807] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L808] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L809] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L810] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L820] 4 z = 2 [L823] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L826] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L829] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 4 b$flush_delayed = weak$$choice2 [L832] 4 b$mem_tmp = b [L833] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L834] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L835] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L836] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L837] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L839] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 __unbuffered_p3_EBX = b [L841] 4 b = b$flush_delayed ? b$mem_tmp : b [L842] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=2] [L845] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L846] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L847] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L848] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L849] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=2] [L766] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L767] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L768] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L769] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L770] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=2] [L773] EXPR 1 __unbuffered_cnt + 1 [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L786] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L787] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L788] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L789] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L790] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=2] [L793] EXPR 2 __unbuffered_cnt + 1 [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L813] EXPR 3 __unbuffered_cnt + 1 [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L852] EXPR 4 __unbuffered_cnt + 1 [L852] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L854] 4 return 0; [L876] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L878] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L878] RET 0 assume_abort_if_not(main$tmp_guard0) [L880] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L881] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L882] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L883] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L884] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1249={5:0}, t1250={6:0}, t1251={7:0}, t1252={3:0}, weak$$choice2=1, x=2, y=2, z=2] [L887] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L889] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix047_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=2] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 773]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 773]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 872]: 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: 868]: 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: 870]: 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: 874]: 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, 188 locations, 23 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: 183.6s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 175.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1006 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1006 mSDsluCounter, 111 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57 mSDsCounter, 109 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2674 IncrementalHoareTripleChecker+Invalid, 2783 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 109 mSolverCounterUnsat, 54 mSDtfsCounter, 2674 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6317occurred in iteration=12, InterpolantAutomatonStates: 106, 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, 2.9s InterpolantComputationTime, 326 NumberOfCodeBlocks, 326 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 279 ConstructedInterpolants, 0 QuantifiedInterpolants, 1339 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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-27 10:12:38,793 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...