/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 21:14:20,124 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 21:14:20,188 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-26 21:14:20,192 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 21:14:20,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 21:14:20,215 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 21:14:20,215 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 21:14:20,215 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 21:14:20,216 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 21:14:20,218 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 21:14:20,219 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 21:14:20,219 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 21:14:20,219 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 21:14:20,220 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 21:14:20,220 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 21:14:20,220 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 21:14:20,220 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 21:14:20,221 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 21:14:20,221 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 21:14:20,221 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 21:14:20,221 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 21:14:20,222 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 21:14:20,222 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 21:14:20,222 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 21:14:20,222 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 21:14:20,222 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 21:14:20,223 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 21:14:20,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:14:20,223 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 21:14:20,223 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 21:14:20,224 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 21:14:20,224 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 21:14:20,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 21:14:20,224 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 21:14:20,224 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 21:14:20,224 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.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-26 21:14:20,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 21:14:20,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 21:14:20,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 21:14:20,470 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 21:14:20,470 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 21:14:20,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 21:14:21,322 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 21:14:21,531 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 21:14:21,531 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 21:14:21,543 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/358a5d4fd/eb4bcb6a47b34ea28ea3b811832f7bfb/FLAG84542b2e5 [2023-08-26 21:14:21,553 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/358a5d4fd/eb4bcb6a47b34ea28ea3b811832f7bfb [2023-08-26 21:14:21,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 21:14:21,555 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 21:14:21,556 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 21:14:21,556 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 21:14:21,558 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 21:14:21,558 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:14:21" (1/1) ... [2023-08-26 21:14:21,559 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@180198c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:14:21, skipping insertion in model container [2023-08-26 21:14:21,559 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:14:21" (1/1) ... [2023-08-26 21:14:21,611 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 21:14:21,902 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:14:21,913 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 21:14:21,938 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:14:21,939 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:14:21,973 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:14:22,008 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:14:22,008 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:14:22,013 INFO L206 MainTranslator]: Completed translation [2023-08-26 21:14:22,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:14:22 WrapperNode [2023-08-26 21:14:22,013 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 21:14:22,014 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 21:14:22,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 21:14:22,014 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 21:14:22,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:14:22" (1/1) ... [2023-08-26 21:14:22,043 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:14:22" (1/1) ... [2023-08-26 21:14:22,060 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 153 [2023-08-26 21:14:22,061 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 21:14:22,061 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 21:14:22,061 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 21:14:22,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 21:14:22,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:14:22" (1/1) ... [2023-08-26 21:14:22,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:14:22" (1/1) ... [2023-08-26 21:14:22,079 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:14:22" (1/1) ... [2023-08-26 21:14:22,079 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:14:22" (1/1) ... [2023-08-26 21:14:22,084 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:14:22" (1/1) ... [2023-08-26 21:14:22,085 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:14:22" (1/1) ... [2023-08-26 21:14:22,087 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:14:22" (1/1) ... [2023-08-26 21:14:22,088 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:14:22" (1/1) ... [2023-08-26 21:14:22,105 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 21:14:22,106 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 21:14:22,106 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 21:14:22,106 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 21:14:22,106 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:14:22" (1/1) ... [2023-08-26 21:14:22,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:14:22,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 21:14:22,137 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-26 21:14:22,152 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-26 21:14:22,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 21:14:22,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 21:14:22,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 21:14:22,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 21:14:22,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 21:14:22,169 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 21:14:22,169 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 21:14:22,169 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 21:14:22,169 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 21:14:22,169 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 21:14:22,169 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 21:14:22,169 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 21:14:22,170 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 21:14:22,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 21:14:22,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 21:14:22,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 21:14:22,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 21:14:22,172 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 21:14:22,271 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 21:14:22,272 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 21:14:22,530 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 21:14:22,620 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 21:14:22,620 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 21:14:22,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:14:22 BoogieIcfgContainer [2023-08-26 21:14:22,622 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 21:14:22,624 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 21:14:22,624 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 21:14:22,626 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 21:14:22,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:14:21" (1/3) ... [2023-08-26 21:14:22,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a18da6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:14:22, skipping insertion in model container [2023-08-26 21:14:22,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:14:22" (2/3) ... [2023-08-26 21:14:22,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a18da6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:14:22, skipping insertion in model container [2023-08-26 21:14:22,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:14:22" (3/3) ... [2023-08-26 21:14:22,629 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 21:14:22,640 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 21:14:22,641 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 21:14:22,641 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 21:14:22,690 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 21:14:22,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 144 transitions, 308 flow [2023-08-26 21:14:22,775 INFO L124 PetriNetUnfolderBase]: 3/140 cut-off events. [2023-08-26 21:14:22,775 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:14:22,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 3/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-26 21:14:22,781 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 144 transitions, 308 flow [2023-08-26 21:14:22,786 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 140 transitions, 292 flow [2023-08-26 21:14:22,788 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 21:14:22,798 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 140 transitions, 292 flow [2023-08-26 21:14:22,801 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 140 transitions, 292 flow [2023-08-26 21:14:22,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 140 transitions, 292 flow [2023-08-26 21:14:22,843 INFO L124 PetriNetUnfolderBase]: 3/140 cut-off events. [2023-08-26 21:14:22,843 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:14:22,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 3/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-26 21:14:22,847 INFO L119 LiptonReduction]: Number of co-enabled transitions 4696 [2023-08-26 21:14:26,243 INFO L134 LiptonReduction]: Checked pairs total: 16931 [2023-08-26 21:14:26,243 INFO L136 LiptonReduction]: Total number of compositions: 122 [2023-08-26 21:14:26,251 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 21:14:26,255 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;@59396ec1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 21:14:26,255 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-26 21:14:26,257 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 21:14:26,257 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-08-26 21:14:26,257 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:14:26,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:14:26,257 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 21:14:26,258 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:14:26,261 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:14:26,261 INFO L85 PathProgramCache]: Analyzing trace with hash 631696, now seen corresponding path program 1 times [2023-08-26 21:14:26,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:14:26,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776438390] [2023-08-26 21:14:26,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:14:26,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:14:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:14:26,508 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-26 21:14:26,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:14:26,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776438390] [2023-08-26 21:14:26,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776438390] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:14:26,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:14:26,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:14:26,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175205593] [2023-08-26 21:14:26,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:14:26,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:14:26,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:14:26,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:14:26,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:14:26,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 266 [2023-08-26 21:14:26,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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-26 21:14:26,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:14:26,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 266 [2023-08-26 21:14:26,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:14:27,957 INFO L124 PetriNetUnfolderBase]: 12064/17142 cut-off events. [2023-08-26 21:14:27,958 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2023-08-26 21:14:27,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33585 conditions, 17142 events. 12064/17142 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 803. Compared 102523 event pairs, 6870 based on Foata normal form. 0/13317 useless extension candidates. Maximal degree in co-relation 33573. Up to 13549 conditions per place. [2023-08-26 21:14:28,051 INFO L140 encePairwiseOnDemand]: 262/266 looper letters, 50 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-08-26 21:14:28,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 61 transitions, 247 flow [2023-08-26 21:14:28,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:14:28,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:14:28,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-08-26 21:14:28,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5162907268170426 [2023-08-26 21:14:28,065 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-08-26 21:14:28,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-08-26 21:14:28,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:14:28,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-08-26 21:14:28,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 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-26 21:14:28,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 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-26 21:14:28,076 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 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-26 21:14:28,078 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 3 states and 412 transitions. [2023-08-26 21:14:28,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 61 transitions, 247 flow [2023-08-26 21:14:28,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 240 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 21:14:28,083 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 88 flow [2023-08-26 21:14:28,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, 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-26 21:14:28,086 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2023-08-26 21:14:28,087 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 88 flow [2023-08-26 21:14:28,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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-26 21:14:28,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:14:28,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 21:14:28,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 21:14:28,088 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-26 21:14:28,094 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:14:28,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1639459054, now seen corresponding path program 1 times [2023-08-26 21:14:28,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:14:28,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253179375] [2023-08-26 21:14:28,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:14:28,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:14:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:14:28,170 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-26 21:14:28,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:14:28,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253179375] [2023-08-26 21:14:28,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253179375] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:14:28,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:14:28,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:14:28,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769996240] [2023-08-26 21:14:28,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:14:28,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:14:28,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:14:28,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:14:28,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:14:28,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 266 [2023-08-26 21:14:28,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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-26 21:14:28,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:14:28,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 266 [2023-08-26 21:14:28,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:14:29,450 INFO L124 PetriNetUnfolderBase]: 12225/16946 cut-off events. [2023-08-26 21:14:29,450 INFO L125 PetriNetUnfolderBase]: For 739/739 co-relation queries the response was YES. [2023-08-26 21:14:29,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34836 conditions, 16946 events. 12225/16946 cut-off events. For 739/739 co-relation queries the response was YES. Maximal size of possible extension queue 729. Compared 96898 event pairs, 3437 based on Foata normal form. 0/11913 useless extension candidates. Maximal degree in co-relation 34826. Up to 14728 conditions per place. [2023-08-26 21:14:29,504 INFO L140 encePairwiseOnDemand]: 253/266 looper letters, 51 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2023-08-26 21:14:29,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 61 transitions, 254 flow [2023-08-26 21:14:29,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:14:29,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:14:29,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2023-08-26 21:14:29,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5087719298245614 [2023-08-26 21:14:29,506 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2023-08-26 21:14:29,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2023-08-26 21:14:29,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:14:29,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2023-08-26 21:14:29,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 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-26 21:14:29,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 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-26 21:14:29,508 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 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-26 21:14:29,509 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 88 flow. Second operand 3 states and 406 transitions. [2023-08-26 21:14:29,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 61 transitions, 254 flow [2023-08-26 21:14:29,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 248 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:14:29,510 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 131 flow [2023-08-26 21:14:29,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, 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-26 21:14:29,511 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2023-08-26 21:14:29,511 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 131 flow [2023-08-26 21:14:29,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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-26 21:14:29,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:14:29,511 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:14:29,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 21:14:29,511 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:14:29,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:14:29,512 INFO L85 PathProgramCache]: Analyzing trace with hash -805959574, now seen corresponding path program 1 times [2023-08-26 21:14:29,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:14:29,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244448368] [2023-08-26 21:14:29,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:14:29,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:14:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:14:29,654 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-26 21:14:29,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:14:29,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244448368] [2023-08-26 21:14:29,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244448368] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:14:29,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:14:29,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:14:29,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197831302] [2023-08-26 21:14:29,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:14:29,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:14:29,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:14:29,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:14:29,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:14:29,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 266 [2023-08-26 21:14:29,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 131 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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-26 21:14:29,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:14:29,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 266 [2023-08-26 21:14:29,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:14:33,101 INFO L124 PetriNetUnfolderBase]: 39390/55851 cut-off events. [2023-08-26 21:14:33,101 INFO L125 PetriNetUnfolderBase]: For 5429/6482 co-relation queries the response was YES. [2023-08-26 21:14:33,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131875 conditions, 55851 events. 39390/55851 cut-off events. For 5429/6482 co-relation queries the response was YES. Maximal size of possible extension queue 1847. Compared 368505 event pairs, 14698 based on Foata normal form. 6/47604 useless extension candidates. Maximal degree in co-relation 131864. Up to 28962 conditions per place. [2023-08-26 21:14:33,363 INFO L140 encePairwiseOnDemand]: 255/266 looper letters, 61 selfloop transitions, 10 changer transitions 0/75 dead transitions. [2023-08-26 21:14:33,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 75 transitions, 371 flow [2023-08-26 21:14:33,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:14:33,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:14:33,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-08-26 21:14:33,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47869674185463656 [2023-08-26 21:14:33,365 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-08-26 21:14:33,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-08-26 21:14:33,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:14:33,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-08-26 21:14:33,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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-26 21:14:33,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 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-26 21:14:33,367 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 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-26 21:14:33,367 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 131 flow. Second operand 3 states and 382 transitions. [2023-08-26 21:14:33,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 75 transitions, 371 flow [2023-08-26 21:14:33,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 75 transitions, 362 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:14:33,392 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 204 flow [2023-08-26 21:14:33,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2023-08-26 21:14:33,393 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2023-08-26 21:14:33,393 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 204 flow [2023-08-26 21:14:33,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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-26 21:14:33,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:14:33,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:14:33,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 21:14:33,396 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:14:33,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:14:33,397 INFO L85 PathProgramCache]: Analyzing trace with hash 785054782, now seen corresponding path program 1 times [2023-08-26 21:14:33,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:14:33,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719392067] [2023-08-26 21:14:33,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:14:33,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:14:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:14:33,538 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-26 21:14:33,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:14:33,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719392067] [2023-08-26 21:14:33,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719392067] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:14:33,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:14:33,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:14:33,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966203520] [2023-08-26 21:14:33,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:14:33,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:14:33,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:14:33,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:14:33,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:14:33,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 266 [2023-08-26 21:14:33,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 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-26 21:14:33,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:14:33,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 266 [2023-08-26 21:14:33,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:14:37,135 INFO L124 PetriNetUnfolderBase]: 37670/53529 cut-off events. [2023-08-26 21:14:37,135 INFO L125 PetriNetUnfolderBase]: For 26462/27446 co-relation queries the response was YES. [2023-08-26 21:14:37,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148053 conditions, 53529 events. 37670/53529 cut-off events. For 26462/27446 co-relation queries the response was YES. Maximal size of possible extension queue 1778. Compared 350503 event pairs, 9009 based on Foata normal form. 349/47016 useless extension candidates. Maximal degree in co-relation 148039. Up to 20858 conditions per place. [2023-08-26 21:14:37,748 INFO L140 encePairwiseOnDemand]: 256/266 looper letters, 85 selfloop transitions, 10 changer transitions 0/99 dead transitions. [2023-08-26 21:14:37,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 99 transitions, 568 flow [2023-08-26 21:14:37,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:14:37,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:14:37,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 501 transitions. [2023-08-26 21:14:37,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4708646616541353 [2023-08-26 21:14:37,751 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 501 transitions. [2023-08-26 21:14:37,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 501 transitions. [2023-08-26 21:14:37,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:14:37,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 501 transitions. [2023-08-26 21:14:37,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 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-26 21:14:37,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 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-26 21:14:37,756 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 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-26 21:14:37,756 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 204 flow. Second operand 4 states and 501 transitions. [2023-08-26 21:14:37,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 99 transitions, 568 flow [2023-08-26 21:14:37,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 99 transitions, 536 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:14:37,851 INFO L231 Difference]: Finished difference. Result has 57 places, 57 transitions, 262 flow [2023-08-26 21:14:37,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=262, PETRI_PLACES=57, PETRI_TRANSITIONS=57} [2023-08-26 21:14:37,852 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2023-08-26 21:14:37,852 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 57 transitions, 262 flow [2023-08-26 21:14:37,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 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-26 21:14:37,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:14:37,852 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:14:37,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 21:14:37,852 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:14:37,853 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:14:37,853 INFO L85 PathProgramCache]: Analyzing trace with hash -818137746, now seen corresponding path program 1 times [2023-08-26 21:14:37,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:14:37,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128308430] [2023-08-26 21:14:37,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:14:37,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:14:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:14:37,899 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-26 21:14:37,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:14:37,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128308430] [2023-08-26 21:14:37,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128308430] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:14:37,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:14:37,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:14:37,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798133636] [2023-08-26 21:14:37,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:14:37,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:14:37,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:14:37,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:14:37,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:14:37,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 266 [2023-08-26 21:14:37,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 262 flow. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:37,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:14:37,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 266 [2023-08-26 21:14:37,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:14:39,268 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([607] L887-->ULTIMATE.startEXIT: Formula: (and (= (store (store (store (store |v_#valid_160| |v_ULTIMATE.start_main_~#t601~0#1.base_55| 0) |v_ULTIMATE.start_main_~#t602~0#1.base_45| 0) |v_ULTIMATE.start_main_~#t603~0#1.base_47| 0) |v_ULTIMATE.start_main_~#t604~0#1.base_47| 0) |v_#valid_158|) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_24) (= v_~__unbuffered_p1_EBX~0_24 0) (= 0 v_~__unbuffered_p3_EBX~0_30) (= 2 v_~__unbuffered_p1_EAX~0_24) (= v_~x~0_28 2) (= v_~z~0_26 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_30) (= |v_ULTIMATE.start_main_#res#1_42| |v_ULTIMATE.start_#t~ret13#1_14|) (= (mod v_~main$tmp_guard1~0_30 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_31|) (= |v_ULTIMATE.start_main_#res#1_42| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_31| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0))) InVars {ULTIMATE.start_main_~#t601~0#1.base=|v_ULTIMATE.start_main_~#t601~0#1.base_55|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, #valid=|v_#valid_160|, ULTIMATE.start_main_~#t604~0#1.base=|v_ULTIMATE.start_main_~#t604~0#1.base_47|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_30, ~z~0=v_~z~0_26, ULTIMATE.start_main_~#t603~0#1.base=|v_ULTIMATE.start_main_~#t603~0#1.base_47|, ULTIMATE.start_main_~#t602~0#1.base=|v_ULTIMATE.start_main_~#t602~0#1.base_45|, ~x~0=v_~x~0_28} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_42|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_30, ULTIMATE.start_main_~#t603~0#1.offset=|v_ULTIMATE.start_main_~#t603~0#1.offset_34|, ULTIMATE.start_main_~#t601~0#1.offset=|v_ULTIMATE.start_main_~#t601~0#1.offset_40|, ULTIMATE.start_main_~#t602~0#1.offset=|v_ULTIMATE.start_main_~#t602~0#1.offset_34|, ULTIMATE.start_main_~#t604~0#1.offset=|v_ULTIMATE.start_main_~#t604~0#1.offset_34|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, #valid=|v_#valid_158|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ~z~0=v_~z~0_26, ~x~0=v_~x~0_28, ULTIMATE.start_#t~ret13#1=|v_ULTIMATE.start_#t~ret13#1_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t601~0#1.base, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t604~0#1.base, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t602~0#1.base, ULTIMATE.start_main_~#t603~0#1.offset, ULTIMATE.start_main_~#t601~0#1.offset, ULTIMATE.start_main_~#t602~0#1.offset, ULTIMATE.start_main_~#t604~0#1.offset, ULTIMATE.start___VERIFIER_assert_#in~expression#1, #valid, ULTIMATE.start_main_~#t603~0#1.base, ULTIMATE.start_#t~ret13#1][68], [99#L766true, Black: 163#(= ~__unbuffered_cnt~0 0), 104#L789true, 3#ULTIMATE.startEXITtrue, 50#P2EXITtrue, Black: 166#true, 174#(= ~__unbuffered_p3_EAX~0 0), 183#(<= 1 ~__unbuffered_cnt~0), Black: 172#true, Black: 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, 126#L826true]) [2023-08-26 21:14:39,268 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:14:39,269 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:39,269 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:39,269 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:39,269 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([447] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][40], [Black: 163#(= ~__unbuffered_cnt~0 0), 104#L789true, 50#P2EXITtrue, 133#L887true, Black: 166#true, 174#(= ~__unbuffered_p3_EAX~0 0), 5#L773true, 183#(<= 1 ~__unbuffered_cnt~0), Black: 172#true, Black: 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, 126#L826true]) [2023-08-26 21:14:39,269 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:14:39,269 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:39,269 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:39,269 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:39,538 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([607] L887-->ULTIMATE.startEXIT: Formula: (and (= (store (store (store (store |v_#valid_160| |v_ULTIMATE.start_main_~#t601~0#1.base_55| 0) |v_ULTIMATE.start_main_~#t602~0#1.base_45| 0) |v_ULTIMATE.start_main_~#t603~0#1.base_47| 0) |v_ULTIMATE.start_main_~#t604~0#1.base_47| 0) |v_#valid_158|) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_24) (= v_~__unbuffered_p1_EBX~0_24 0) (= 0 v_~__unbuffered_p3_EBX~0_30) (= 2 v_~__unbuffered_p1_EAX~0_24) (= v_~x~0_28 2) (= v_~z~0_26 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_30) (= |v_ULTIMATE.start_main_#res#1_42| |v_ULTIMATE.start_#t~ret13#1_14|) (= (mod v_~main$tmp_guard1~0_30 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_31|) (= |v_ULTIMATE.start_main_#res#1_42| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_31| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0))) InVars {ULTIMATE.start_main_~#t601~0#1.base=|v_ULTIMATE.start_main_~#t601~0#1.base_55|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, #valid=|v_#valid_160|, ULTIMATE.start_main_~#t604~0#1.base=|v_ULTIMATE.start_main_~#t604~0#1.base_47|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_30, ~z~0=v_~z~0_26, ULTIMATE.start_main_~#t603~0#1.base=|v_ULTIMATE.start_main_~#t603~0#1.base_47|, ULTIMATE.start_main_~#t602~0#1.base=|v_ULTIMATE.start_main_~#t602~0#1.base_45|, ~x~0=v_~x~0_28} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_42|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_30, ULTIMATE.start_main_~#t603~0#1.offset=|v_ULTIMATE.start_main_~#t603~0#1.offset_34|, ULTIMATE.start_main_~#t601~0#1.offset=|v_ULTIMATE.start_main_~#t601~0#1.offset_40|, ULTIMATE.start_main_~#t602~0#1.offset=|v_ULTIMATE.start_main_~#t602~0#1.offset_34|, ULTIMATE.start_main_~#t604~0#1.offset=|v_ULTIMATE.start_main_~#t604~0#1.offset_34|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, #valid=|v_#valid_158|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ~z~0=v_~z~0_26, ~x~0=v_~x~0_28, ULTIMATE.start_#t~ret13#1=|v_ULTIMATE.start_#t~ret13#1_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t601~0#1.base, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t604~0#1.base, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t602~0#1.base, ULTIMATE.start_main_~#t603~0#1.offset, ULTIMATE.start_main_~#t601~0#1.offset, ULTIMATE.start_main_~#t602~0#1.offset, ULTIMATE.start_main_~#t604~0#1.offset, ULTIMATE.start___VERIFIER_assert_#in~expression#1, #valid, ULTIMATE.start_main_~#t603~0#1.base, ULTIMATE.start_#t~ret13#1][68], [99#L766true, Black: 163#(= ~__unbuffered_cnt~0 0), 104#L789true, 3#ULTIMATE.startEXITtrue, 50#P2EXITtrue, Black: 166#true, 183#(<= 1 ~__unbuffered_cnt~0), Black: 172#true, Black: 174#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P2Thread1of1ForFork2InUse, 13#L829true, P3Thread1of1ForFork0InUse]) [2023-08-26 21:14:39,539 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 21:14:39,539 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:14:39,539 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:14:39,539 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:14:39,539 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([447] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][40], [Black: 163#(= ~__unbuffered_cnt~0 0), 104#L789true, 50#P2EXITtrue, 133#L887true, Black: 166#true, 5#L773true, 183#(<= 1 ~__unbuffered_cnt~0), Black: 172#true, Black: 174#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P2Thread1of1ForFork2InUse, 13#L829true, P3Thread1of1ForFork0InUse]) [2023-08-26 21:14:39,539 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 21:14:39,539 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:14:39,539 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:14:39,539 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:14:39,539 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([475] L829-->L845: Formula: (let ((.cse3 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse10 (not .cse8)) (.cse11 (and .cse8 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse9 (and .cse3 .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse5 (or .cse11 .cse9 .cse12)) (.cse6 (and (not .cse12) .cse10))) (let ((.cse2 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse7 (ite .cse5 v_~a~0_85 (ite .cse6 v_~a$w_buff0~0_65 v_~a$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse4 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~a$flush_delayed~0_23 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse1 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse1 .cse2) (and .cse1 .cse3) .cse4)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$w_buff0~0_65 v_~a$w_buff0~0_64) (= (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse5 v_~a$w_buff0_used~0_148 (ite .cse6 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_85 v_~a$mem_tmp~0_14) (= .cse7 v_~__unbuffered_p3_EBX~0_10) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse8 .cse2) .cse9 .cse4) v_~a$r_buff0_thd4~0_60 (ite (and (not .cse4) .cse10) 0 v_~a$r_buff0_thd4~0_60)))) (= v_~a~0_84 (ite .cse0 v_~a$mem_tmp~0_14 .cse7)) (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse11 .cse9 .cse4) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134)))))) InVars {~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_65, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_147, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][70], [172#true, 99#L766true, Black: 163#(= ~__unbuffered_cnt~0 0), 104#L789true, 50#P2EXITtrue, 133#L887true, Black: 168#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 94#L845true, 183#(<= 1 ~__unbuffered_cnt~0), Black: 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse]) [2023-08-26 21:14:39,540 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 21:14:39,540 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:14:39,540 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:14:39,540 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:14:40,485 INFO L124 PetriNetUnfolderBase]: 25076/35506 cut-off events. [2023-08-26 21:14:40,485 INFO L125 PetriNetUnfolderBase]: For 24747/26685 co-relation queries the response was YES. [2023-08-26 21:14:40,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99628 conditions, 35506 events. 25076/35506 cut-off events. For 24747/26685 co-relation queries the response was YES. Maximal size of possible extension queue 1430. Compared 231186 event pairs, 6206 based on Foata normal form. 189/30237 useless extension candidates. Maximal degree in co-relation 99611. Up to 25661 conditions per place. [2023-08-26 21:14:40,639 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 59 selfloop transitions, 5 changer transitions 0/78 dead transitions. [2023-08-26 21:14:40,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 78 transitions, 470 flow [2023-08-26 21:14:40,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:14:40,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:14:40,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 512 transitions. [2023-08-26 21:14:40,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48120300751879697 [2023-08-26 21:14:40,641 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 512 transitions. [2023-08-26 21:14:40,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 512 transitions. [2023-08-26 21:14:40,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:14:40,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 512 transitions. [2023-08-26 21:14:40,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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-26 21:14:40,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 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-26 21:14:40,644 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 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-26 21:14:40,644 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 262 flow. Second operand 4 states and 512 transitions. [2023-08-26 21:14:40,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 78 transitions, 470 flow [2023-08-26 21:14:40,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 78 transitions, 467 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:14:40,676 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 253 flow [2023-08-26 21:14:40,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2023-08-26 21:14:40,677 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2023-08-26 21:14:40,677 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 253 flow [2023-08-26 21:14:40,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:40,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:14:40,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:14:40,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 21:14:40,677 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:14:40,678 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:14:40,678 INFO L85 PathProgramCache]: Analyzing trace with hash 114965235, now seen corresponding path program 1 times [2023-08-26 21:14:40,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:14:40,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316693416] [2023-08-26 21:14:40,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:14:40,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:14:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:14:40,713 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-26 21:14:40,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:14:40,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316693416] [2023-08-26 21:14:40,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316693416] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:14:40,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:14:40,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:14:40,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920226774] [2023-08-26 21:14:40,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:14:40,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:14:40,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:14:40,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:14:40,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:14:40,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 266 [2023-08-26 21:14:40,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 253 flow. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:40,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:14:40,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 266 [2023-08-26 21:14:40,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:14:42,213 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([607] L887-->ULTIMATE.startEXIT: Formula: (and (= (store (store (store (store |v_#valid_160| |v_ULTIMATE.start_main_~#t601~0#1.base_55| 0) |v_ULTIMATE.start_main_~#t602~0#1.base_45| 0) |v_ULTIMATE.start_main_~#t603~0#1.base_47| 0) |v_ULTIMATE.start_main_~#t604~0#1.base_47| 0) |v_#valid_158|) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_24) (= v_~__unbuffered_p1_EBX~0_24 0) (= 0 v_~__unbuffered_p3_EBX~0_30) (= 2 v_~__unbuffered_p1_EAX~0_24) (= v_~x~0_28 2) (= v_~z~0_26 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_30) (= |v_ULTIMATE.start_main_#res#1_42| |v_ULTIMATE.start_#t~ret13#1_14|) (= (mod v_~main$tmp_guard1~0_30 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_31|) (= |v_ULTIMATE.start_main_#res#1_42| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_31| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0))) InVars {ULTIMATE.start_main_~#t601~0#1.base=|v_ULTIMATE.start_main_~#t601~0#1.base_55|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, #valid=|v_#valid_160|, ULTIMATE.start_main_~#t604~0#1.base=|v_ULTIMATE.start_main_~#t604~0#1.base_47|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_30, ~z~0=v_~z~0_26, ULTIMATE.start_main_~#t603~0#1.base=|v_ULTIMATE.start_main_~#t603~0#1.base_47|, ULTIMATE.start_main_~#t602~0#1.base=|v_ULTIMATE.start_main_~#t602~0#1.base_45|, ~x~0=v_~x~0_28} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_42|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_30, ULTIMATE.start_main_~#t603~0#1.offset=|v_ULTIMATE.start_main_~#t603~0#1.offset_34|, ULTIMATE.start_main_~#t601~0#1.offset=|v_ULTIMATE.start_main_~#t601~0#1.offset_40|, ULTIMATE.start_main_~#t602~0#1.offset=|v_ULTIMATE.start_main_~#t602~0#1.offset_34|, ULTIMATE.start_main_~#t604~0#1.offset=|v_ULTIMATE.start_main_~#t604~0#1.offset_34|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, #valid=|v_#valid_158|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ~z~0=v_~z~0_26, ~x~0=v_~x~0_28, ULTIMATE.start_#t~ret13#1=|v_ULTIMATE.start_#t~ret13#1_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t601~0#1.base, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t604~0#1.base, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t602~0#1.base, ULTIMATE.start_main_~#t603~0#1.offset, ULTIMATE.start_main_~#t601~0#1.offset, ULTIMATE.start_main_~#t602~0#1.offset, ULTIMATE.start_main_~#t604~0#1.offset, ULTIMATE.start___VERIFIER_assert_#in~expression#1, #valid, ULTIMATE.start_main_~#t603~0#1.base, ULTIMATE.start_#t~ret13#1][67], [99#L766true, Black: 163#(= ~__unbuffered_cnt~0 0), 104#L789true, 3#ULTIMATE.startEXITtrue, 50#P2EXITtrue, Black: 166#true, 183#(<= 1 ~__unbuffered_cnt~0), Black: 172#true, Black: 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, 126#L826true, 188#(<= ~__unbuffered_cnt~0 1)]) [2023-08-26 21:14:42,214 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:14:42,214 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:42,214 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:42,214 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:42,214 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([447] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][40], [Black: 163#(= ~__unbuffered_cnt~0 0), 104#L789true, 133#L887true, 50#P2EXITtrue, Black: 166#true, 5#L773true, 183#(<= 1 ~__unbuffered_cnt~0), Black: 172#true, Black: 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, 126#L826true, 188#(<= ~__unbuffered_cnt~0 1)]) [2023-08-26 21:14:42,214 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:14:42,214 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:42,214 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:42,214 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:42,499 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([607] L887-->ULTIMATE.startEXIT: Formula: (and (= (store (store (store (store |v_#valid_160| |v_ULTIMATE.start_main_~#t601~0#1.base_55| 0) |v_ULTIMATE.start_main_~#t602~0#1.base_45| 0) |v_ULTIMATE.start_main_~#t603~0#1.base_47| 0) |v_ULTIMATE.start_main_~#t604~0#1.base_47| 0) |v_#valid_158|) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_24) (= v_~__unbuffered_p1_EBX~0_24 0) (= 0 v_~__unbuffered_p3_EBX~0_30) (= 2 v_~__unbuffered_p1_EAX~0_24) (= v_~x~0_28 2) (= v_~z~0_26 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_30) (= |v_ULTIMATE.start_main_#res#1_42| |v_ULTIMATE.start_#t~ret13#1_14|) (= (mod v_~main$tmp_guard1~0_30 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_31|) (= |v_ULTIMATE.start_main_#res#1_42| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_31| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0))) InVars {ULTIMATE.start_main_~#t601~0#1.base=|v_ULTIMATE.start_main_~#t601~0#1.base_55|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, #valid=|v_#valid_160|, ULTIMATE.start_main_~#t604~0#1.base=|v_ULTIMATE.start_main_~#t604~0#1.base_47|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_30, ~z~0=v_~z~0_26, ULTIMATE.start_main_~#t603~0#1.base=|v_ULTIMATE.start_main_~#t603~0#1.base_47|, ULTIMATE.start_main_~#t602~0#1.base=|v_ULTIMATE.start_main_~#t602~0#1.base_45|, ~x~0=v_~x~0_28} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_42|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_30, ULTIMATE.start_main_~#t603~0#1.offset=|v_ULTIMATE.start_main_~#t603~0#1.offset_34|, ULTIMATE.start_main_~#t601~0#1.offset=|v_ULTIMATE.start_main_~#t601~0#1.offset_40|, ULTIMATE.start_main_~#t602~0#1.offset=|v_ULTIMATE.start_main_~#t602~0#1.offset_34|, ULTIMATE.start_main_~#t604~0#1.offset=|v_ULTIMATE.start_main_~#t604~0#1.offset_34|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, #valid=|v_#valid_158|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ~z~0=v_~z~0_26, ~x~0=v_~x~0_28, ULTIMATE.start_#t~ret13#1=|v_ULTIMATE.start_#t~ret13#1_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t601~0#1.base, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t604~0#1.base, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t602~0#1.base, ULTIMATE.start_main_~#t603~0#1.offset, ULTIMATE.start_main_~#t601~0#1.offset, ULTIMATE.start_main_~#t602~0#1.offset, ULTIMATE.start_main_~#t604~0#1.offset, ULTIMATE.start___VERIFIER_assert_#in~expression#1, #valid, ULTIMATE.start_main_~#t603~0#1.base, ULTIMATE.start_#t~ret13#1][67], [99#L766true, Black: 163#(= ~__unbuffered_cnt~0 0), 104#L789true, 3#ULTIMATE.startEXITtrue, 50#P2EXITtrue, Black: 166#true, 183#(<= 1 ~__unbuffered_cnt~0), Black: 172#true, Black: 174#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P2Thread1of1ForFork2InUse, 13#L829true, P3Thread1of1ForFork0InUse, 188#(<= ~__unbuffered_cnt~0 1)]) [2023-08-26 21:14:42,499 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 21:14:42,499 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:14:42,499 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:14:42,499 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:14:42,500 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([447] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][40], [Black: 163#(= ~__unbuffered_cnt~0 0), 104#L789true, 133#L887true, 50#P2EXITtrue, Black: 166#true, 5#L773true, 183#(<= 1 ~__unbuffered_cnt~0), Black: 172#true, Black: 174#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P2Thread1of1ForFork2InUse, 13#L829true, P3Thread1of1ForFork0InUse, 188#(<= ~__unbuffered_cnt~0 1)]) [2023-08-26 21:14:42,500 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 21:14:42,500 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:14:42,500 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:14:42,500 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:14:42,500 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([475] L829-->L845: Formula: (let ((.cse3 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse10 (not .cse8)) (.cse11 (and .cse8 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse9 (and .cse3 .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse5 (or .cse11 .cse9 .cse12)) (.cse6 (and (not .cse12) .cse10))) (let ((.cse2 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse7 (ite .cse5 v_~a~0_85 (ite .cse6 v_~a$w_buff0~0_65 v_~a$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse4 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~a$flush_delayed~0_23 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse1 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse1 .cse2) (and .cse1 .cse3) .cse4)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$w_buff0~0_65 v_~a$w_buff0~0_64) (= (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse5 v_~a$w_buff0_used~0_148 (ite .cse6 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_85 v_~a$mem_tmp~0_14) (= .cse7 v_~__unbuffered_p3_EBX~0_10) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse8 .cse2) .cse9 .cse4) v_~a$r_buff0_thd4~0_60 (ite (and (not .cse4) .cse10) 0 v_~a$r_buff0_thd4~0_60)))) (= v_~a~0_84 (ite .cse0 v_~a$mem_tmp~0_14 .cse7)) (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse11 .cse9 .cse4) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134)))))) InVars {~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_65, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_147, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][71], [99#L766true, 172#true, Black: 163#(= ~__unbuffered_cnt~0 0), 104#L789true, 133#L887true, 50#P2EXITtrue, Black: 168#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 94#L845true, 183#(<= 1 ~__unbuffered_cnt~0), Black: 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, 188#(<= ~__unbuffered_cnt~0 1)]) [2023-08-26 21:14:42,500 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 21:14:42,500 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:14:42,500 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:14:42,500 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:14:43,142 INFO L124 PetriNetUnfolderBase]: 18573/26303 cut-off events. [2023-08-26 21:14:43,143 INFO L125 PetriNetUnfolderBase]: For 23257/24797 co-relation queries the response was YES. [2023-08-26 21:14:43,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76206 conditions, 26303 events. 18573/26303 cut-off events. For 23257/24797 co-relation queries the response was YES. Maximal size of possible extension queue 1219. Compared 167312 event pairs, 4768 based on Foata normal form. 158/24454 useless extension candidates. Maximal degree in co-relation 76188. Up to 9998 conditions per place. [2023-08-26 21:14:43,308 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 82 selfloop transitions, 9 changer transitions 0/105 dead transitions. [2023-08-26 21:14:43,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 105 transitions, 637 flow [2023-08-26 21:14:43,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:14:43,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:14:43,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 533 transitions. [2023-08-26 21:14:43,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5009398496240601 [2023-08-26 21:14:43,310 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 533 transitions. [2023-08-26 21:14:43,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 533 transitions. [2023-08-26 21:14:43,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:14:43,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 533 transitions. [2023-08-26 21:14:43,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 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-26 21:14:43,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 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-26 21:14:43,313 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 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-26 21:14:43,313 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 253 flow. Second operand 4 states and 533 transitions. [2023-08-26 21:14:43,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 105 transitions, 637 flow [2023-08-26 21:14:43,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 105 transitions, 631 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:14:43,344 INFO L231 Difference]: Finished difference. Result has 57 places, 57 transitions, 305 flow [2023-08-26 21:14:43,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=305, PETRI_PLACES=57, PETRI_TRANSITIONS=57} [2023-08-26 21:14:43,345 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2023-08-26 21:14:43,345 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 57 transitions, 305 flow [2023-08-26 21:14:43,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:43,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:14:43,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:14:43,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 21:14:43,345 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-26 21:14:43,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:14:43,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1082581425, now seen corresponding path program 1 times [2023-08-26 21:14:43,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:14:43,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153429684] [2023-08-26 21:14:43,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:14:43,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:14:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:14:43,450 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-26 21:14:43,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:14:43,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153429684] [2023-08-26 21:14:43,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153429684] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:14:43,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:14:43,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:14:43,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547333088] [2023-08-26 21:14:43,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:14:43,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:14:43,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:14:43,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:14:43,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:14:43,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 266 [2023-08-26 21:14:43,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 305 flow. Second operand has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 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-26 21:14:43,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:14:43,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 266 [2023-08-26 21:14:43,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:14:45,575 INFO L124 PetriNetUnfolderBase]: 24162/32817 cut-off events. [2023-08-26 21:14:45,575 INFO L125 PetriNetUnfolderBase]: For 44640/44640 co-relation queries the response was YES. [2023-08-26 21:14:45,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109775 conditions, 32817 events. 24162/32817 cut-off events. For 44640/44640 co-relation queries the response was YES. Maximal size of possible extension queue 909. Compared 179868 event pairs, 4304 based on Foata normal form. 206/32335 useless extension candidates. Maximal degree in co-relation 109756. Up to 13857 conditions per place. [2023-08-26 21:14:45,749 INFO L140 encePairwiseOnDemand]: 256/266 looper letters, 108 selfloop transitions, 15 changer transitions 0/123 dead transitions. [2023-08-26 21:14:45,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 123 transitions, 882 flow [2023-08-26 21:14:45,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:14:45,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:14:45,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 509 transitions. [2023-08-26 21:14:45,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4783834586466165 [2023-08-26 21:14:45,751 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 509 transitions. [2023-08-26 21:14:45,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 509 transitions. [2023-08-26 21:14:45,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:14:45,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 509 transitions. [2023-08-26 21:14:45,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 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-26 21:14:45,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 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-26 21:14:45,753 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 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-26 21:14:45,753 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 305 flow. Second operand 4 states and 509 transitions. [2023-08-26 21:14:45,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 123 transitions, 882 flow [2023-08-26 21:14:45,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 123 transitions, 836 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-08-26 21:14:45,802 INFO L231 Difference]: Finished difference. Result has 61 places, 66 transitions, 428 flow [2023-08-26 21:14:45,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=428, PETRI_PLACES=61, PETRI_TRANSITIONS=66} [2023-08-26 21:14:45,802 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2023-08-26 21:14:45,802 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 66 transitions, 428 flow [2023-08-26 21:14:45,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 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-26 21:14:45,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:14:45,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:14:45,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 21:14:45,803 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-26 21:14:45,803 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:14:45,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1754427678, now seen corresponding path program 1 times [2023-08-26 21:14:45,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:14:45,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281129655] [2023-08-26 21:14:45,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:14:45,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:14:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:14:45,902 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-26 21:14:45,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:14:45,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281129655] [2023-08-26 21:14:45,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281129655] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:14:45,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:14:45,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:14:45,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087015836] [2023-08-26 21:14:45,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:14:45,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:14:45,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:14:45,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:14:45,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:14:45,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 266 [2023-08-26 21:14:45,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 66 transitions, 428 flow. Second operand has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 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-26 21:14:45,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:14:45,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 266 [2023-08-26 21:14:45,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:14:46,803 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([447] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][99], [Black: 193#(= ~__unbuffered_p1_EAX~0 0), Black: 163#(= ~__unbuffered_cnt~0 0), Black: 191#true, 104#L789true, Black: 166#true, 50#P2EXITtrue, 69#L3true, 5#L773true, Black: 172#true, 183#(<= 1 ~__unbuffered_cnt~0), Black: 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 194#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, 126#L826true, 202#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 188#(<= ~__unbuffered_cnt~0 1)]) [2023-08-26 21:14:46,803 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-26 21:14:46,803 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:14:46,803 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:14:46,803 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:14:46,961 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([607] L887-->ULTIMATE.startEXIT: Formula: (and (= (store (store (store (store |v_#valid_160| |v_ULTIMATE.start_main_~#t601~0#1.base_55| 0) |v_ULTIMATE.start_main_~#t602~0#1.base_45| 0) |v_ULTIMATE.start_main_~#t603~0#1.base_47| 0) |v_ULTIMATE.start_main_~#t604~0#1.base_47| 0) |v_#valid_158|) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_24) (= v_~__unbuffered_p1_EBX~0_24 0) (= 0 v_~__unbuffered_p3_EBX~0_30) (= 2 v_~__unbuffered_p1_EAX~0_24) (= v_~x~0_28 2) (= v_~z~0_26 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_30) (= |v_ULTIMATE.start_main_#res#1_42| |v_ULTIMATE.start_#t~ret13#1_14|) (= (mod v_~main$tmp_guard1~0_30 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_31|) (= |v_ULTIMATE.start_main_#res#1_42| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_31| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0))) InVars {ULTIMATE.start_main_~#t601~0#1.base=|v_ULTIMATE.start_main_~#t601~0#1.base_55|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, #valid=|v_#valid_160|, ULTIMATE.start_main_~#t604~0#1.base=|v_ULTIMATE.start_main_~#t604~0#1.base_47|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_30, ~z~0=v_~z~0_26, ULTIMATE.start_main_~#t603~0#1.base=|v_ULTIMATE.start_main_~#t603~0#1.base_47|, ULTIMATE.start_main_~#t602~0#1.base=|v_ULTIMATE.start_main_~#t602~0#1.base_45|, ~x~0=v_~x~0_28} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_42|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_30, ULTIMATE.start_main_~#t603~0#1.offset=|v_ULTIMATE.start_main_~#t603~0#1.offset_34|, ULTIMATE.start_main_~#t601~0#1.offset=|v_ULTIMATE.start_main_~#t601~0#1.offset_40|, ULTIMATE.start_main_~#t602~0#1.offset=|v_ULTIMATE.start_main_~#t602~0#1.offset_34|, ULTIMATE.start_main_~#t604~0#1.offset=|v_ULTIMATE.start_main_~#t604~0#1.offset_34|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, #valid=|v_#valid_158|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ~z~0=v_~z~0_26, ~x~0=v_~x~0_28, ULTIMATE.start_#t~ret13#1=|v_ULTIMATE.start_#t~ret13#1_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t601~0#1.base, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t604~0#1.base, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t602~0#1.base, ULTIMATE.start_main_~#t603~0#1.offset, ULTIMATE.start_main_~#t601~0#1.offset, ULTIMATE.start_main_~#t602~0#1.offset, ULTIMATE.start_main_~#t604~0#1.offset, ULTIMATE.start___VERIFIER_assert_#in~expression#1, #valid, ULTIMATE.start_main_~#t603~0#1.base, ULTIMATE.start_#t~ret13#1][90], [99#L766true, Black: 163#(= ~__unbuffered_cnt~0 0), Black: 193#(= ~__unbuffered_p1_EAX~0 0), Black: 191#true, 104#L789true, 3#ULTIMATE.startEXITtrue, Black: 166#true, 50#P2EXITtrue, 183#(<= 1 ~__unbuffered_cnt~0), Black: 172#true, Black: 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 194#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork3InUse, 199#true, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, 126#L826true, 188#(<= ~__unbuffered_cnt~0 1)]) [2023-08-26 21:14:46,961 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:14:46,961 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:46,962 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:46,962 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:46,962 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([447] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][46], [Black: 163#(= ~__unbuffered_cnt~0 0), Black: 193#(= ~__unbuffered_p1_EAX~0 0), Black: 191#true, 104#L789true, 50#P2EXITtrue, 133#L887true, Black: 166#true, 5#L773true, 183#(<= 1 ~__unbuffered_cnt~0), Black: 172#true, Black: 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 194#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, 199#true, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, 126#L826true, 188#(<= ~__unbuffered_cnt~0 1)]) [2023-08-26 21:14:46,962 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:14:46,962 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:46,962 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:46,962 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:46,974 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([475] L829-->L845: Formula: (let ((.cse3 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse10 (not .cse8)) (.cse11 (and .cse8 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse9 (and .cse3 .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse5 (or .cse11 .cse9 .cse12)) (.cse6 (and (not .cse12) .cse10))) (let ((.cse2 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse7 (ite .cse5 v_~a~0_85 (ite .cse6 v_~a$w_buff0~0_65 v_~a$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse4 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~a$flush_delayed~0_23 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse1 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse1 .cse2) (and .cse1 .cse3) .cse4)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$w_buff0~0_65 v_~a$w_buff0~0_64) (= (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse5 v_~a$w_buff0_used~0_148 (ite .cse6 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_85 v_~a$mem_tmp~0_14) (= .cse7 v_~__unbuffered_p3_EBX~0_10) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse8 .cse2) .cse9 .cse4) v_~a$r_buff0_thd4~0_60 (ite (and (not .cse4) .cse10) 0 v_~a$r_buff0_thd4~0_60)))) (= v_~a~0_84 (ite .cse0 v_~a$mem_tmp~0_14 .cse7)) (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse11 .cse9 .cse4) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134)))))) InVars {~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_65, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_147, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][115], [99#L766true, Black: 194#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 172#true, Black: 163#(= ~__unbuffered_cnt~0 0), Black: 193#(= ~__unbuffered_p1_EAX~0 0), 104#L789true, 50#P2EXITtrue, 191#true, Black: 168#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 94#L845true, 69#L3true, 183#(<= 1 ~__unbuffered_cnt~0), Black: 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, 188#(<= ~__unbuffered_cnt~0 1), 202#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)))]) [2023-08-26 21:14:46,974 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:14:46,974 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:46,974 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:46,974 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:46,974 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([447] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][99], [Black: 163#(= ~__unbuffered_cnt~0 0), Black: 193#(= ~__unbuffered_p1_EAX~0 0), Black: 191#true, 104#L789true, 50#P2EXITtrue, Black: 166#true, 69#L3true, 5#L773true, 183#(<= 1 ~__unbuffered_cnt~0), Black: 172#true, Black: 174#(= ~__unbuffered_p3_EAX~0 0), 194#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P2Thread1of1ForFork2InUse, 13#L829true, P3Thread1of1ForFork0InUse, 188#(<= ~__unbuffered_cnt~0 1), 202#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)))]) [2023-08-26 21:14:46,974 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:14:46,975 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:46,975 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:46,975 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:47,134 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([607] L887-->ULTIMATE.startEXIT: Formula: (and (= (store (store (store (store |v_#valid_160| |v_ULTIMATE.start_main_~#t601~0#1.base_55| 0) |v_ULTIMATE.start_main_~#t602~0#1.base_45| 0) |v_ULTIMATE.start_main_~#t603~0#1.base_47| 0) |v_ULTIMATE.start_main_~#t604~0#1.base_47| 0) |v_#valid_158|) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_24) (= v_~__unbuffered_p1_EBX~0_24 0) (= 0 v_~__unbuffered_p3_EBX~0_30) (= 2 v_~__unbuffered_p1_EAX~0_24) (= v_~x~0_28 2) (= v_~z~0_26 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_30) (= |v_ULTIMATE.start_main_#res#1_42| |v_ULTIMATE.start_#t~ret13#1_14|) (= (mod v_~main$tmp_guard1~0_30 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_31|) (= |v_ULTIMATE.start_main_#res#1_42| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_31| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0))) InVars {ULTIMATE.start_main_~#t601~0#1.base=|v_ULTIMATE.start_main_~#t601~0#1.base_55|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, #valid=|v_#valid_160|, ULTIMATE.start_main_~#t604~0#1.base=|v_ULTIMATE.start_main_~#t604~0#1.base_47|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_30, ~z~0=v_~z~0_26, ULTIMATE.start_main_~#t603~0#1.base=|v_ULTIMATE.start_main_~#t603~0#1.base_47|, ULTIMATE.start_main_~#t602~0#1.base=|v_ULTIMATE.start_main_~#t602~0#1.base_45|, ~x~0=v_~x~0_28} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_42|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_30, ULTIMATE.start_main_~#t603~0#1.offset=|v_ULTIMATE.start_main_~#t603~0#1.offset_34|, ULTIMATE.start_main_~#t601~0#1.offset=|v_ULTIMATE.start_main_~#t601~0#1.offset_40|, ULTIMATE.start_main_~#t602~0#1.offset=|v_ULTIMATE.start_main_~#t602~0#1.offset_34|, ULTIMATE.start_main_~#t604~0#1.offset=|v_ULTIMATE.start_main_~#t604~0#1.offset_34|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, #valid=|v_#valid_158|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ~z~0=v_~z~0_26, ~x~0=v_~x~0_28, ULTIMATE.start_#t~ret13#1=|v_ULTIMATE.start_#t~ret13#1_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t601~0#1.base, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t604~0#1.base, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t602~0#1.base, ULTIMATE.start_main_~#t603~0#1.offset, ULTIMATE.start_main_~#t601~0#1.offset, ULTIMATE.start_main_~#t602~0#1.offset, ULTIMATE.start_main_~#t604~0#1.offset, ULTIMATE.start___VERIFIER_assert_#in~expression#1, #valid, ULTIMATE.start_main_~#t603~0#1.base, ULTIMATE.start_#t~ret13#1][90], [99#L766true, Black: 163#(= ~__unbuffered_cnt~0 0), Black: 193#(= ~__unbuffered_p1_EAX~0 0), Black: 191#true, 104#L789true, 3#ULTIMATE.startEXITtrue, 50#P2EXITtrue, Black: 166#true, 183#(<= 1 ~__unbuffered_cnt~0), Black: 172#true, Black: 174#(= ~__unbuffered_p3_EAX~0 0), 194#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, 199#true, 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P2Thread1of1ForFork2InUse, 13#L829true, P3Thread1of1ForFork0InUse, 188#(<= ~__unbuffered_cnt~0 1)]) [2023-08-26 21:14:47,134 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 21:14:47,134 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:14:47,134 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:14:47,134 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:14:47,135 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([475] L829-->L845: Formula: (let ((.cse3 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse10 (not .cse8)) (.cse11 (and .cse8 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse9 (and .cse3 .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse5 (or .cse11 .cse9 .cse12)) (.cse6 (and (not .cse12) .cse10))) (let ((.cse2 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse7 (ite .cse5 v_~a~0_85 (ite .cse6 v_~a$w_buff0~0_65 v_~a$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse4 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~a$flush_delayed~0_23 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse1 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse1 .cse2) (and .cse1 .cse3) .cse4)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$w_buff0~0_65 v_~a$w_buff0~0_64) (= (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse5 v_~a$w_buff0_used~0_148 (ite .cse6 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_85 v_~a$mem_tmp~0_14) (= .cse7 v_~__unbuffered_p3_EBX~0_10) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse8 .cse2) .cse9 .cse4) v_~a$r_buff0_thd4~0_60 (ite (and (not .cse4) .cse10) 0 v_~a$r_buff0_thd4~0_60)))) (= v_~a~0_84 (ite .cse0 v_~a$mem_tmp~0_14 .cse7)) (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse11 .cse9 .cse4) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134)))))) InVars {~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_65, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_147, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][108], [99#L766true, Black: 194#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 172#true, Black: 163#(= ~__unbuffered_cnt~0 0), Black: 193#(= ~__unbuffered_p1_EAX~0 0), 104#L789true, 133#L887true, 50#P2EXITtrue, 191#true, Black: 168#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 94#L845true, 183#(<= 1 ~__unbuffered_cnt~0), Black: 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, 199#true, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, 188#(<= ~__unbuffered_cnt~0 1)]) [2023-08-26 21:14:47,135 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 21:14:47,135 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:14:47,135 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:14:47,135 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:14:47,135 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([447] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][46], [Black: 163#(= ~__unbuffered_cnt~0 0), Black: 193#(= ~__unbuffered_p1_EAX~0 0), Black: 191#true, 104#L789true, 133#L887true, 50#P2EXITtrue, Black: 166#true, 5#L773true, 183#(<= 1 ~__unbuffered_cnt~0), Black: 172#true, Black: 174#(= ~__unbuffered_p3_EAX~0 0), 194#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, 199#true, 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P2Thread1of1ForFork2InUse, 13#L829true, P3Thread1of1ForFork0InUse, 188#(<= ~__unbuffered_cnt~0 1)]) [2023-08-26 21:14:47,135 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 21:14:47,135 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:14:47,135 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:14:47,135 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:14:47,619 INFO L124 PetriNetUnfolderBase]: 13790/20541 cut-off events. [2023-08-26 21:14:47,619 INFO L125 PetriNetUnfolderBase]: For 27679/29810 co-relation queries the response was YES. [2023-08-26 21:14:47,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65312 conditions, 20541 events. 13790/20541 cut-off events. For 27679/29810 co-relation queries the response was YES. Maximal size of possible extension queue 945. Compared 136674 event pairs, 2407 based on Foata normal form. 1576/20543 useless extension candidates. Maximal degree in co-relation 65290. Up to 13311 conditions per place. [2023-08-26 21:14:47,725 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 105 selfloop transitions, 10 changer transitions 0/134 dead transitions. [2023-08-26 21:14:47,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 134 transitions, 992 flow [2023-08-26 21:14:47,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:14:47,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:14:47,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 631 transitions. [2023-08-26 21:14:47,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47443609022556393 [2023-08-26 21:14:47,727 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 631 transitions. [2023-08-26 21:14:47,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 631 transitions. [2023-08-26 21:14:47,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:14:47,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 631 transitions. [2023-08-26 21:14:47,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 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-26 21:14:47,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 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-26 21:14:47,730 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 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-26 21:14:47,730 INFO L175 Difference]: Start difference. First operand has 61 places, 66 transitions, 428 flow. Second operand 5 states and 631 transitions. [2023-08-26 21:14:47,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 134 transitions, 992 flow [2023-08-26 21:14:47,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 134 transitions, 988 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:14:47,805 INFO L231 Difference]: Finished difference. Result has 67 places, 71 transitions, 495 flow [2023-08-26 21:14:47,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=495, PETRI_PLACES=67, PETRI_TRANSITIONS=71} [2023-08-26 21:14:47,805 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 15 predicate places. [2023-08-26 21:14:47,805 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 71 transitions, 495 flow [2023-08-26 21:14:47,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 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-26 21:14:47,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:14:47,806 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-26 21:14:47,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 21:14:47,806 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-26 21:14:47,806 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:14:47,806 INFO L85 PathProgramCache]: Analyzing trace with hash 10425211, now seen corresponding path program 1 times [2023-08-26 21:14:47,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:14:47,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600968256] [2023-08-26 21:14:47,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:14:47,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:14:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:14:47,904 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-26 21:14:47,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:14:47,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600968256] [2023-08-26 21:14:47,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600968256] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:14:47,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:14:47,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:14:47,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421824264] [2023-08-26 21:14:47,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:14:47,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:14:47,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:14:47,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:14:47,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:14:47,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 266 [2023-08-26 21:14:47,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 71 transitions, 495 flow. Second operand has 5 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 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-26 21:14:47,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:14:47,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 266 [2023-08-26 21:14:47,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:14:48,573 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([447] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][101], [Black: 163#(= ~__unbuffered_cnt~0 0), Black: 193#(= ~__unbuffered_p1_EAX~0 0), Black: 191#true, 104#L789true, 50#P2EXITtrue, Black: 166#true, 217#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 201#(= ~__unbuffered_cnt~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 5#L773true, 69#L3true, 183#(<= 1 ~__unbuffered_cnt~0), Black: 172#true, Black: 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 194#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, 126#L826true, 202#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 188#(<= ~__unbuffered_cnt~0 1)]) [2023-08-26 21:14:48,574 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-26 21:14:48,574 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:14:48,574 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:14:48,574 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:14:48,574 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([447] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][101], [Black: 193#(= ~__unbuffered_p1_EAX~0 0), Black: 163#(= ~__unbuffered_cnt~0 0), Black: 191#true, 104#L789true, 50#P2EXITtrue, Black: 166#true, 217#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 201#(= ~__unbuffered_cnt~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 202#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 5#L773true, 69#L3true, 183#(<= 1 ~__unbuffered_cnt~0), Black: 172#true, Black: 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 194#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, 199#true, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, 126#L826true, 188#(<= ~__unbuffered_cnt~0 1)]) [2023-08-26 21:14:48,574 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-26 21:14:48,574 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:14:48,574 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:14:48,574 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:14:48,696 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([475] L829-->L845: Formula: (let ((.cse3 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse10 (not .cse8)) (.cse11 (and .cse8 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse9 (and .cse3 .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse5 (or .cse11 .cse9 .cse12)) (.cse6 (and (not .cse12) .cse10))) (let ((.cse2 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse7 (ite .cse5 v_~a~0_85 (ite .cse6 v_~a$w_buff0~0_65 v_~a$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse4 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~a$flush_delayed~0_23 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse1 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse1 .cse2) (and .cse1 .cse3) .cse4)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$w_buff0~0_65 v_~a$w_buff0~0_64) (= (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse5 v_~a$w_buff0_used~0_148 (ite .cse6 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_85 v_~a$mem_tmp~0_14) (= .cse7 v_~__unbuffered_p3_EBX~0_10) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse8 .cse2) .cse9 .cse4) v_~a$r_buff0_thd4~0_60 (ite (and (not .cse4) .cse10) 0 v_~a$r_buff0_thd4~0_60)))) (= v_~a~0_84 (ite .cse0 v_~a$mem_tmp~0_14 .cse7)) (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse11 .cse9 .cse4) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134)))))) InVars {~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_65, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_147, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][118], [Black: 194#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 172#true, 99#L766true, Black: 163#(= ~__unbuffered_cnt~0 0), Black: 193#(= ~__unbuffered_p1_EAX~0 0), 104#L789true, 191#true, 50#P2EXITtrue, Black: 168#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 217#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 201#(= ~__unbuffered_cnt~0 0), 94#L845true, Black: 204#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 69#L3true, 183#(<= 1 ~__unbuffered_cnt~0), Black: 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, 202#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 188#(<= ~__unbuffered_cnt~0 1)]) [2023-08-26 21:14:48,696 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:14:48,696 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:48,696 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:48,696 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:48,696 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([447] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][101], [Black: 163#(= ~__unbuffered_cnt~0 0), Black: 193#(= ~__unbuffered_p1_EAX~0 0), Black: 191#true, 104#L789true, 50#P2EXITtrue, Black: 166#true, 217#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 201#(= ~__unbuffered_cnt~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 5#L773true, 69#L3true, 183#(<= 1 ~__unbuffered_cnt~0), Black: 172#true, Black: 174#(= ~__unbuffered_p3_EAX~0 0), 194#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P2Thread1of1ForFork2InUse, 13#L829true, P3Thread1of1ForFork0InUse, 202#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 188#(<= ~__unbuffered_cnt~0 1)]) [2023-08-26 21:14:48,696 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:14:48,697 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:48,697 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:48,697 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:48,698 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([475] L829-->L845: Formula: (let ((.cse3 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse10 (not .cse8)) (.cse11 (and .cse8 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse9 (and .cse3 .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse5 (or .cse11 .cse9 .cse12)) (.cse6 (and (not .cse12) .cse10))) (let ((.cse2 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse7 (ite .cse5 v_~a~0_85 (ite .cse6 v_~a$w_buff0~0_65 v_~a$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse4 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~a$flush_delayed~0_23 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse1 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse1 .cse2) (and .cse1 .cse3) .cse4)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$w_buff0~0_65 v_~a$w_buff0~0_64) (= (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse5 v_~a$w_buff0_used~0_148 (ite .cse6 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_85 v_~a$mem_tmp~0_14) (= .cse7 v_~__unbuffered_p3_EBX~0_10) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse8 .cse2) .cse9 .cse4) v_~a$r_buff0_thd4~0_60 (ite (and (not .cse4) .cse10) 0 v_~a$r_buff0_thd4~0_60)))) (= v_~a~0_84 (ite .cse0 v_~a$mem_tmp~0_14 .cse7)) (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse11 .cse9 .cse4) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134)))))) InVars {~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_65, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_147, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][118], [Black: 194#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 99#L766true, 172#true, Black: 193#(= ~__unbuffered_p1_EAX~0 0), Black: 163#(= ~__unbuffered_cnt~0 0), 104#L789true, 191#true, 50#P2EXITtrue, Black: 168#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 217#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 201#(= ~__unbuffered_cnt~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 94#L845true, Black: 202#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 69#L3true, 183#(<= 1 ~__unbuffered_cnt~0), Black: 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, 199#true, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, 188#(<= ~__unbuffered_cnt~0 1)]) [2023-08-26 21:14:48,698 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:14:48,698 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:48,698 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:48,698 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:48,698 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([447] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][101], [Black: 193#(= ~__unbuffered_p1_EAX~0 0), Black: 163#(= ~__unbuffered_cnt~0 0), Black: 191#true, 104#L789true, Black: 166#true, 50#P2EXITtrue, 217#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 201#(= ~__unbuffered_cnt~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 202#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 5#L773true, 69#L3true, Black: 172#true, 183#(<= 1 ~__unbuffered_cnt~0), Black: 174#(= ~__unbuffered_p3_EAX~0 0), 194#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, 199#true, 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P2Thread1of1ForFork2InUse, 13#L829true, P3Thread1of1ForFork0InUse, 188#(<= ~__unbuffered_cnt~0 1)]) [2023-08-26 21:14:48,698 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:14:48,698 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:48,698 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:48,698 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:49,306 INFO L124 PetriNetUnfolderBase]: 10065/15626 cut-off events. [2023-08-26 21:14:49,307 INFO L125 PetriNetUnfolderBase]: For 26286/27308 co-relation queries the response was YES. [2023-08-26 21:14:49,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54148 conditions, 15626 events. 10065/15626 cut-off events. For 26286/27308 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 106884 event pairs, 1586 based on Foata normal form. 993/15158 useless extension candidates. Maximal degree in co-relation 54122. Up to 4510 conditions per place. [2023-08-26 21:14:49,369 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 131 selfloop transitions, 19 changer transitions 0/169 dead transitions. [2023-08-26 21:14:49,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 169 transitions, 1263 flow [2023-08-26 21:14:49,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:14:49,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:14:49,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 882 transitions. [2023-08-26 21:14:49,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2023-08-26 21:14:49,371 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 882 transitions. [2023-08-26 21:14:49,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 882 transitions. [2023-08-26 21:14:49,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:14:49,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 882 transitions. [2023-08-26 21:14:49,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.0) internal successors, (882), 7 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-26 21:14:49,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 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-26 21:14:49,375 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 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-26 21:14:49,375 INFO L175 Difference]: Start difference. First operand has 67 places, 71 transitions, 495 flow. Second operand 7 states and 882 transitions. [2023-08-26 21:14:49,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 169 transitions, 1263 flow [2023-08-26 21:14:49,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 169 transitions, 1249 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:14:49,612 INFO L231 Difference]: Finished difference. Result has 74 places, 76 transitions, 567 flow [2023-08-26 21:14:49,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=567, PETRI_PLACES=74, PETRI_TRANSITIONS=76} [2023-08-26 21:14:49,613 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 22 predicate places. [2023-08-26 21:14:49,613 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 76 transitions, 567 flow [2023-08-26 21:14:49,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 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-26 21:14:49,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:14:49,613 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-26 21:14:49,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 21:14:49,613 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:14:49,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:14:49,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1925902796, now seen corresponding path program 1 times [2023-08-26 21:14:49,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:14:49,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126657578] [2023-08-26 21:14:49,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:14:49,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:14:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:14:49,666 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-26 21:14:49,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:14:49,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126657578] [2023-08-26 21:14:49,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126657578] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:14:49,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:14:49,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:14:49,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223821092] [2023-08-26 21:14:49,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:14:49,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:14:49,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:14:49,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:14:49,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:14:49,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 266 [2023-08-26 21:14:49,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 76 transitions, 567 flow. Second operand has 5 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 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-26 21:14:49,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:14:49,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 266 [2023-08-26 21:14:49,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:14:50,791 INFO L124 PetriNetUnfolderBase]: 9019/13908 cut-off events. [2023-08-26 21:14:50,791 INFO L125 PetriNetUnfolderBase]: For 32183/33004 co-relation queries the response was YES. [2023-08-26 21:14:50,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53237 conditions, 13908 events. 9019/13908 cut-off events. For 32183/33004 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 93129 event pairs, 1889 based on Foata normal form. 93/13349 useless extension candidates. Maximal degree in co-relation 53208. Up to 4975 conditions per place. [2023-08-26 21:14:50,866 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 101 selfloop transitions, 21 changer transitions 0/141 dead transitions. [2023-08-26 21:14:50,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 141 transitions, 1131 flow [2023-08-26 21:14:50,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:14:50,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:14:50,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 660 transitions. [2023-08-26 21:14:50,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49624060150375937 [2023-08-26 21:14:50,868 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 660 transitions. [2023-08-26 21:14:50,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 660 transitions. [2023-08-26 21:14:50,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:14:50,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 660 transitions. [2023-08-26 21:14:50,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 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-26 21:14:50,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 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-26 21:14:50,871 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 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-26 21:14:50,871 INFO L175 Difference]: Start difference. First operand has 74 places, 76 transitions, 567 flow. Second operand 5 states and 660 transitions. [2023-08-26 21:14:50,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 141 transitions, 1131 flow [2023-08-26 21:14:51,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 141 transitions, 1097 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-26 21:14:51,187 INFO L231 Difference]: Finished difference. Result has 75 places, 80 transitions, 627 flow [2023-08-26 21:14:51,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=627, PETRI_PLACES=75, PETRI_TRANSITIONS=80} [2023-08-26 21:14:51,188 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2023-08-26 21:14:51,188 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 80 transitions, 627 flow [2023-08-26 21:14:51,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 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-26 21:14:51,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:14:51,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:14:51,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 21:14:51,188 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:14:51,189 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:14:51,189 INFO L85 PathProgramCache]: Analyzing trace with hash 546458995, now seen corresponding path program 1 times [2023-08-26 21:14:51,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:14:51,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336380172] [2023-08-26 21:14:51,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:14:51,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:14:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:14:51,311 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-26 21:14:51,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:14:51,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336380172] [2023-08-26 21:14:51,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336380172] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:14:51,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:14:51,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:14:51,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482056270] [2023-08-26 21:14:51,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:14:51,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:14:51,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:14:51,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:14:51,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:14:51,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 266 [2023-08-26 21:14:51,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 80 transitions, 627 flow. Second operand has 6 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 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-26 21:14:51,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:14:51,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 266 [2023-08-26 21:14:51,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:14:52,160 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([447] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][101], [Black: 193#(= ~__unbuffered_p1_EAX~0 0), Black: 191#true, 104#L789true, 50#P2EXITtrue, Black: 201#(= ~__unbuffered_cnt~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 69#L3true, 225#(<= ~__unbuffered_cnt~0 1), 183#(<= 1 ~__unbuffered_cnt~0), 194#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 213#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), P3Thread1of1ForFork0InUse, Black: 212#(<= ~__unbuffered_cnt~0 1), 126#L826true, 202#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 226#(<= ~__unbuffered_cnt~0 2), Black: 163#(= ~__unbuffered_cnt~0 0), Black: 166#true, 217#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 5#L773true, Black: 172#true, Black: 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 238#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)))]) [2023-08-26 21:14:52,160 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-26 21:14:52,160 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:14:52,160 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:14:52,160 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:14:52,160 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([447] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][101], [Black: 193#(= ~__unbuffered_p1_EAX~0 0), Black: 191#true, 104#L789true, 50#P2EXITtrue, Black: 201#(= ~__unbuffered_cnt~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 202#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 69#L3true, 225#(<= ~__unbuffered_cnt~0 1), 183#(<= 1 ~__unbuffered_cnt~0), 194#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 213#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), P3Thread1of1ForFork0InUse, Black: 212#(<= ~__unbuffered_cnt~0 1), 126#L826true, Black: 226#(<= ~__unbuffered_cnt~0 2), Black: 163#(= ~__unbuffered_cnt~0 0), Black: 166#true, 217#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 5#L773true, Black: 172#true, Black: 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 238#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)))]) [2023-08-26 21:14:52,160 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-26 21:14:52,160 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:14:52,160 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:14:52,160 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:14:52,277 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([475] L829-->L845: Formula: (let ((.cse3 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse10 (not .cse8)) (.cse11 (and .cse8 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse9 (and .cse3 .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse5 (or .cse11 .cse9 .cse12)) (.cse6 (and (not .cse12) .cse10))) (let ((.cse2 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse7 (ite .cse5 v_~a~0_85 (ite .cse6 v_~a$w_buff0~0_65 v_~a$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse4 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~a$flush_delayed~0_23 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse1 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse1 .cse2) (and .cse1 .cse3) .cse4)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$w_buff0~0_65 v_~a$w_buff0~0_64) (= (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse5 v_~a$w_buff0_used~0_148 (ite .cse6 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_85 v_~a$mem_tmp~0_14) (= .cse7 v_~__unbuffered_p3_EBX~0_10) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse8 .cse2) .cse9 .cse4) v_~a$r_buff0_thd4~0_60 (ite (and (not .cse4) .cse10) 0 v_~a$r_buff0_thd4~0_60)))) (= v_~a~0_84 (ite .cse0 v_~a$mem_tmp~0_14 .cse7)) (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse11 .cse9 .cse4) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134)))))) InVars {~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_65, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_147, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][118], [Black: 194#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 193#(= ~__unbuffered_p1_EAX~0 0), 104#L789true, 50#P2EXITtrue, Black: 201#(= ~__unbuffered_cnt~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 94#L845true, 69#L3true, 225#(<= ~__unbuffered_cnt~0 1), 183#(<= 1 ~__unbuffered_cnt~0), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 213#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), P3Thread1of1ForFork0InUse, Black: 212#(<= ~__unbuffered_cnt~0 1), 202#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 226#(<= ~__unbuffered_cnt~0 2), 99#L766true, 172#true, Black: 163#(= ~__unbuffered_cnt~0 0), 191#true, Black: 168#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 217#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), 238#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)))]) [2023-08-26 21:14:52,277 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:14:52,277 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:52,277 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:52,277 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:52,278 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([447] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][101], [Black: 193#(= ~__unbuffered_p1_EAX~0 0), Black: 191#true, 104#L789true, 50#P2EXITtrue, Black: 201#(= ~__unbuffered_cnt~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 69#L3true, 225#(<= ~__unbuffered_cnt~0 1), 183#(<= 1 ~__unbuffered_cnt~0), 194#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 213#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), P3Thread1of1ForFork0InUse, Black: 212#(<= ~__unbuffered_cnt~0 1), 202#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 226#(<= ~__unbuffered_cnt~0 2), Black: 163#(= ~__unbuffered_cnt~0 0), Black: 166#true, 217#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 5#L773true, Black: 172#true, Black: 174#(= ~__unbuffered_p3_EAX~0 0), 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 13#L829true, 238#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)))]) [2023-08-26 21:14:52,278 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:14:52,278 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:52,278 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:52,278 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:52,279 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([475] L829-->L845: Formula: (let ((.cse3 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse10 (not .cse8)) (.cse11 (and .cse8 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse9 (and .cse3 .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse5 (or .cse11 .cse9 .cse12)) (.cse6 (and (not .cse12) .cse10))) (let ((.cse2 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse7 (ite .cse5 v_~a~0_85 (ite .cse6 v_~a$w_buff0~0_65 v_~a$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse4 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~a$flush_delayed~0_23 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse1 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse1 .cse2) (and .cse1 .cse3) .cse4)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$w_buff0~0_65 v_~a$w_buff0~0_64) (= (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse5 v_~a$w_buff0_used~0_148 (ite .cse6 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_85 v_~a$mem_tmp~0_14) (= .cse7 v_~__unbuffered_p3_EBX~0_10) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse8 .cse2) .cse9 .cse4) v_~a$r_buff0_thd4~0_60 (ite (and (not .cse4) .cse10) 0 v_~a$r_buff0_thd4~0_60)))) (= v_~a~0_84 (ite .cse0 v_~a$mem_tmp~0_14 .cse7)) (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse11 .cse9 .cse4) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134)))))) InVars {~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_65, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_147, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][118], [Black: 194#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 193#(= ~__unbuffered_p1_EAX~0 0), 104#L789true, 50#P2EXITtrue, Black: 201#(= ~__unbuffered_cnt~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 94#L845true, Black: 202#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 69#L3true, 225#(<= ~__unbuffered_cnt~0 1), 183#(<= 1 ~__unbuffered_cnt~0), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 213#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), P3Thread1of1ForFork0InUse, Black: 212#(<= ~__unbuffered_cnt~0 1), Black: 226#(<= ~__unbuffered_cnt~0 2), 99#L766true, 172#true, Black: 163#(= ~__unbuffered_cnt~0 0), 191#true, Black: 168#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 217#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), 238#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)))]) [2023-08-26 21:14:52,279 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:14:52,279 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:52,279 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:52,279 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:52,279 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([447] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][101], [Black: 193#(= ~__unbuffered_p1_EAX~0 0), Black: 191#true, 104#L789true, 50#P2EXITtrue, Black: 201#(= ~__unbuffered_cnt~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 202#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 69#L3true, 225#(<= ~__unbuffered_cnt~0 1), 183#(<= 1 ~__unbuffered_cnt~0), 194#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 213#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), P3Thread1of1ForFork0InUse, Black: 212#(<= ~__unbuffered_cnt~0 1), Black: 226#(<= ~__unbuffered_cnt~0 2), Black: 163#(= ~__unbuffered_cnt~0 0), Black: 166#true, 217#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 5#L773true, Black: 172#true, Black: 174#(= ~__unbuffered_p3_EAX~0 0), 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 13#L829true, 238#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)))]) [2023-08-26 21:14:52,279 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:14:52,279 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:52,280 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:52,280 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:52,567 INFO L124 PetriNetUnfolderBase]: 8076/12369 cut-off events. [2023-08-26 21:14:52,567 INFO L125 PetriNetUnfolderBase]: For 30510/31319 co-relation queries the response was YES. [2023-08-26 21:14:52,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47776 conditions, 12369 events. 8076/12369 cut-off events. For 30510/31319 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 82363 event pairs, 931 based on Foata normal form. 311/12088 useless extension candidates. Maximal degree in co-relation 47746. Up to 3040 conditions per place. [2023-08-26 21:14:52,630 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 152 selfloop transitions, 28 changer transitions 4/203 dead transitions. [2023-08-26 21:14:52,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 203 transitions, 1603 flow [2023-08-26 21:14:52,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 21:14:52,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 21:14:52,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1131 transitions. [2023-08-26 21:14:52,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4724310776942356 [2023-08-26 21:14:52,634 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1131 transitions. [2023-08-26 21:14:52,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1131 transitions. [2023-08-26 21:14:52,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:14:52,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1131 transitions. [2023-08-26 21:14:52,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 125.66666666666667) internal successors, (1131), 9 states have internal predecessors, (1131), 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-26 21:14:52,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 266.0) internal successors, (2660), 10 states have internal predecessors, (2660), 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-26 21:14:52,638 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 266.0) internal successors, (2660), 10 states have internal predecessors, (2660), 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-26 21:14:52,638 INFO L175 Difference]: Start difference. First operand has 75 places, 80 transitions, 627 flow. Second operand 9 states and 1131 transitions. [2023-08-26 21:14:52,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 203 transitions, 1603 flow [2023-08-26 21:14:53,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 203 transitions, 1537 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-08-26 21:14:53,610 INFO L231 Difference]: Finished difference. Result has 83 places, 84 transitions, 679 flow [2023-08-26 21:14:53,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=679, PETRI_PLACES=83, PETRI_TRANSITIONS=84} [2023-08-26 21:14:53,611 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 31 predicate places. [2023-08-26 21:14:53,611 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 84 transitions, 679 flow [2023-08-26 21:14:53,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 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-26 21:14:53,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:14:53,611 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-26 21:14:53,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 21:14:53,611 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-26 21:14:53,611 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:14:53,613 INFO L85 PathProgramCache]: Analyzing trace with hash -930043560, now seen corresponding path program 1 times [2023-08-26 21:14:53,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:14:53,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299948988] [2023-08-26 21:14:53,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:14:53,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:14:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:14:54,025 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-26 21:14:54,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:14:54,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299948988] [2023-08-26 21:14:54,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299948988] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:14:54,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:14:54,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:14:54,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857633515] [2023-08-26 21:14:54,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:14:54,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:14:54,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:14:54,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:14:54,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:14:54,026 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 266 [2023-08-26 21:14:54,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 84 transitions, 679 flow. Second operand has 6 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 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-26 21:14:54,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:14:54,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 266 [2023-08-26 21:14:54,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:14:55,003 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([447] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][46], [247#(= ~a$r_buff0_thd4~0 0), Black: 193#(= ~__unbuffered_p1_EAX~0 0), Black: 191#true, 104#L789true, 50#P2EXITtrue, Black: 201#(= ~__unbuffered_cnt~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 202#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 69#L3true, 183#(<= 1 ~__unbuffered_cnt~0), 194#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 213#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), P3Thread1of1ForFork0InUse, 126#L826true, Black: 212#(<= ~__unbuffered_cnt~0 1), Black: 226#(<= ~__unbuffered_cnt~0 2), Black: 163#(= ~__unbuffered_cnt~0 0), Black: 166#true, 217#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 5#L773true, Black: 172#true, Black: 240#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 233#(<= ~__unbuffered_cnt~0 2), Black: 234#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 238#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)))]) [2023-08-26 21:14:55,003 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-26 21:14:55,003 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:14:55,003 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:14:55,003 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:14:55,171 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([475] L829-->L845: Formula: (let ((.cse3 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse10 (not .cse8)) (.cse11 (and .cse8 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse9 (and .cse3 .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse5 (or .cse11 .cse9 .cse12)) (.cse6 (and (not .cse12) .cse10))) (let ((.cse2 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse7 (ite .cse5 v_~a~0_85 (ite .cse6 v_~a$w_buff0~0_65 v_~a$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse4 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~a$flush_delayed~0_23 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse1 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse1 .cse2) (and .cse1 .cse3) .cse4)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$w_buff0~0_65 v_~a$w_buff0~0_64) (= (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse5 v_~a$w_buff0_used~0_148 (ite .cse6 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_85 v_~a$mem_tmp~0_14) (= .cse7 v_~__unbuffered_p3_EBX~0_10) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse8 .cse2) .cse9 .cse4) v_~a$r_buff0_thd4~0_60 (ite (and (not .cse4) .cse10) 0 v_~a$r_buff0_thd4~0_60)))) (= v_~a~0_84 (ite .cse0 v_~a$mem_tmp~0_14 .cse7)) (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse11 .cse9 .cse4) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134)))))) InVars {~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_65, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_147, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][60], [Black: 194#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 247#(= ~a$r_buff0_thd4~0 0), Black: 193#(= ~__unbuffered_p1_EAX~0 0), 104#L789true, 50#P2EXITtrue, Black: 201#(= ~__unbuffered_cnt~0 0), 94#L845true, Black: 204#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 69#L3true, Black: 202#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 183#(<= 1 ~__unbuffered_cnt~0), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 213#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), P3Thread1of1ForFork0InUse, Black: 212#(<= ~__unbuffered_cnt~0 1), Black: 226#(<= ~__unbuffered_cnt~0 2), 172#true, 99#L766true, Black: 163#(= ~__unbuffered_cnt~0 0), 191#true, Black: 168#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 217#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 240#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 233#(<= ~__unbuffered_cnt~0 2), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 234#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 238#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)))]) [2023-08-26 21:14:55,171 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:14:55,171 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:55,171 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:55,171 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:55,228 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([475] L829-->L845: Formula: (let ((.cse3 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse10 (not .cse8)) (.cse11 (and .cse8 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse9 (and .cse3 .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse5 (or .cse11 .cse9 .cse12)) (.cse6 (and (not .cse12) .cse10))) (let ((.cse2 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse7 (ite .cse5 v_~a~0_85 (ite .cse6 v_~a$w_buff0~0_65 v_~a$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse4 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~a$flush_delayed~0_23 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse1 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse1 .cse2) (and .cse1 .cse3) .cse4)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$w_buff0~0_65 v_~a$w_buff0~0_64) (= (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse5 v_~a$w_buff0_used~0_148 (ite .cse6 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_85 v_~a$mem_tmp~0_14) (= .cse7 v_~__unbuffered_p3_EBX~0_10) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse8 .cse2) .cse9 .cse4) v_~a$r_buff0_thd4~0_60 (ite (and (not .cse4) .cse10) 0 v_~a$r_buff0_thd4~0_60)))) (= v_~a~0_84 (ite .cse0 v_~a$mem_tmp~0_14 .cse7)) (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse11 .cse9 .cse4) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134)))))) InVars {~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_65, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_147, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][113], [Black: 194#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 247#(= ~a$r_buff0_thd4~0 0), Black: 193#(= ~__unbuffered_p1_EAX~0 0), 104#L789true, 50#P2EXITtrue, Black: 201#(= ~__unbuffered_cnt~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 94#L845true, Black: 202#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 69#L3true, 183#(<= 1 ~__unbuffered_cnt~0), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 213#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), P3Thread1of1ForFork0InUse, Black: 212#(<= ~__unbuffered_cnt~0 1), Black: 226#(<= ~__unbuffered_cnt~0 2), 172#true, 99#L766true, Black: 163#(= ~__unbuffered_cnt~0 0), 191#true, Black: 168#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 217#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 240#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 233#(<= ~__unbuffered_cnt~0 2), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 234#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 238#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)))]) [2023-08-26 21:14:55,229 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:14:55,229 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:55,229 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:55,229 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:55,229 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([447] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][46], [247#(= ~a$r_buff0_thd4~0 0), Black: 193#(= ~__unbuffered_p1_EAX~0 0), Black: 191#true, 104#L789true, 50#P2EXITtrue, Black: 201#(= ~__unbuffered_cnt~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 202#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 69#L3true, 183#(<= 1 ~__unbuffered_cnt~0), 194#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 213#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), P3Thread1of1ForFork0InUse, Black: 212#(<= ~__unbuffered_cnt~0 1), Black: 226#(<= ~__unbuffered_cnt~0 2), Black: 163#(= ~__unbuffered_cnt~0 0), Black: 166#true, 217#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 5#L773true, Black: 172#true, Black: 240#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 233#(<= ~__unbuffered_cnt~0 2), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 234#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 13#L829true, 238#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)))]) [2023-08-26 21:14:55,229 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:14:55,229 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:55,229 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:55,229 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:14:55,296 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([475] L829-->L845: Formula: (let ((.cse3 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse10 (not .cse8)) (.cse11 (and .cse8 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse9 (and .cse3 .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse5 (or .cse11 .cse9 .cse12)) (.cse6 (and (not .cse12) .cse10))) (let ((.cse2 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse7 (ite .cse5 v_~a~0_85 (ite .cse6 v_~a$w_buff0~0_65 v_~a$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse4 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~a$flush_delayed~0_23 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse1 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse1 .cse2) (and .cse1 .cse3) .cse4)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$w_buff0~0_65 v_~a$w_buff0~0_64) (= (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse5 v_~a$w_buff0_used~0_148 (ite .cse6 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_85 v_~a$mem_tmp~0_14) (= .cse7 v_~__unbuffered_p3_EBX~0_10) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse8 .cse2) .cse9 .cse4) v_~a$r_buff0_thd4~0_60 (ite (and (not .cse4) .cse10) 0 v_~a$r_buff0_thd4~0_60)))) (= v_~a~0_84 (ite .cse0 v_~a$mem_tmp~0_14 .cse7)) (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse11 .cse9 .cse4) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134)))))) InVars {~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_65, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_147, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][60], [Black: 194#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 247#(= ~a$r_buff0_thd4~0 0), Black: 193#(= ~__unbuffered_p1_EAX~0 0), 104#L789true, 50#P2EXITtrue, Black: 201#(= ~__unbuffered_cnt~0 0), 94#L845true, Black: 204#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 202#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 69#L3true, 183#(<= 1 ~__unbuffered_cnt~0), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 213#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), P3Thread1of1ForFork0InUse, Black: 212#(<= ~__unbuffered_cnt~0 1), Black: 226#(<= ~__unbuffered_cnt~0 2), 172#true, Black: 163#(= ~__unbuffered_cnt~0 0), 191#true, Black: 168#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 217#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 5#L773true, Black: 240#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 233#(<= ~__unbuffered_cnt~0 2), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 234#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 238#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)))]) [2023-08-26 21:14:55,296 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 21:14:55,296 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:14:55,296 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:14:55,296 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:14:55,445 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([475] L829-->L845: Formula: (let ((.cse3 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse10 (not .cse8)) (.cse11 (and .cse8 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse9 (and .cse3 .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse5 (or .cse11 .cse9 .cse12)) (.cse6 (and (not .cse12) .cse10))) (let ((.cse2 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse7 (ite .cse5 v_~a~0_85 (ite .cse6 v_~a$w_buff0~0_65 v_~a$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse4 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~a$flush_delayed~0_23 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse1 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse1 .cse2) (and .cse1 .cse3) .cse4)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$w_buff0~0_65 v_~a$w_buff0~0_64) (= (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse5 v_~a$w_buff0_used~0_148 (ite .cse6 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_85 v_~a$mem_tmp~0_14) (= .cse7 v_~__unbuffered_p3_EBX~0_10) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse8 .cse2) .cse9 .cse4) v_~a$r_buff0_thd4~0_60 (ite (and (not .cse4) .cse10) 0 v_~a$r_buff0_thd4~0_60)))) (= v_~a~0_84 (ite .cse0 v_~a$mem_tmp~0_14 .cse7)) (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse11 .cse9 .cse4) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134)))))) InVars {~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_65, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_147, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][60], [Black: 194#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 247#(= ~a$r_buff0_thd4~0 0), 240#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 193#(= ~__unbuffered_p1_EAX~0 0), 104#L789true, 50#P2EXITtrue, Black: 201#(= ~__unbuffered_cnt~0 0), 94#L845true, Black: 204#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 202#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 69#L3true, 183#(<= 1 ~__unbuffered_cnt~0), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, Black: 213#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 217#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 226#(<= ~__unbuffered_cnt~0 2), Black: 212#(<= ~__unbuffered_cnt~0 1), 172#true, Black: 163#(= ~__unbuffered_cnt~0 0), 122#P0EXITtrue, 191#true, Black: 168#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 233#(<= ~__unbuffered_cnt~0 2), Black: 234#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 188#(<= ~__unbuffered_cnt~0 1)]) [2023-08-26 21:14:55,446 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-26 21:14:55,446 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:14:55,446 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:14:55,446 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:14:55,938 INFO L124 PetriNetUnfolderBase]: 13930/22253 cut-off events. [2023-08-26 21:14:55,938 INFO L125 PetriNetUnfolderBase]: For 77494/78327 co-relation queries the response was YES. [2023-08-26 21:14:56,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94866 conditions, 22253 events. 13930/22253 cut-off events. For 77494/78327 co-relation queries the response was YES. Maximal size of possible extension queue 1119. Compared 168331 event pairs, 2313 based on Foata normal form. 126/21622 useless extension candidates. Maximal degree in co-relation 94833. Up to 9145 conditions per place. [2023-08-26 21:14:56,086 INFO L140 encePairwiseOnDemand]: 258/266 looper letters, 234 selfloop transitions, 15 changer transitions 8/276 dead transitions. [2023-08-26 21:14:56,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 276 transitions, 2764 flow [2023-08-26 21:14:56,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:14:56,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:14:56,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 890 transitions. [2023-08-26 21:14:56,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47798066595059074 [2023-08-26 21:14:56,088 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 890 transitions. [2023-08-26 21:14:56,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 890 transitions. [2023-08-26 21:14:56,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:14:56,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 890 transitions. [2023-08-26 21:14:56,090 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-26 21:14:56,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 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-26 21:14:56,092 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 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-26 21:14:56,092 INFO L175 Difference]: Start difference. First operand has 83 places, 84 transitions, 679 flow. Second operand 7 states and 890 transitions. [2023-08-26 21:14:56,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 276 transitions, 2764 flow [2023-08-26 21:14:59,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 276 transitions, 2513 flow, removed 10 selfloop flow, removed 6 redundant places. [2023-08-26 21:14:59,392 INFO L231 Difference]: Finished difference. Result has 86 places, 100 transitions, 792 flow [2023-08-26 21:14:59,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=792, PETRI_PLACES=86, PETRI_TRANSITIONS=100} [2023-08-26 21:14:59,393 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 34 predicate places. [2023-08-26 21:14:59,393 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 100 transitions, 792 flow [2023-08-26 21:14:59,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 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-26 21:14:59,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:14:59,393 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] [2023-08-26 21:14:59,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 21:14:59,393 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-26 21:14:59,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:14:59,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1609591893, now seen corresponding path program 1 times [2023-08-26 21:14:59,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:14:59,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595663817] [2023-08-26 21:14:59,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:14:59,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:14:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:14:59,520 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-26 21:14:59,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:14:59,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595663817] [2023-08-26 21:14:59,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595663817] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:14:59,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:14:59,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:14:59,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684438431] [2023-08-26 21:14:59,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:14:59,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:14:59,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:14:59,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:14:59,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:14:59,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 266 [2023-08-26 21:14:59,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 100 transitions, 792 flow. Second operand has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 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-26 21:14:59,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:14:59,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 266 [2023-08-26 21:14:59,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:15:02,740 INFO L124 PetriNetUnfolderBase]: 28776/42657 cut-off events. [2023-08-26 21:15:02,740 INFO L125 PetriNetUnfolderBase]: For 155786/155786 co-relation queries the response was YES. [2023-08-26 21:15:02,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195198 conditions, 42657 events. 28776/42657 cut-off events. For 155786/155786 co-relation queries the response was YES. Maximal size of possible extension queue 1630. Compared 294447 event pairs, 6251 based on Foata normal form. 18/42354 useless extension candidates. Maximal degree in co-relation 195162. Up to 21022 conditions per place. [2023-08-26 21:15:03,084 INFO L140 encePairwiseOnDemand]: 255/266 looper letters, 207 selfloop transitions, 30 changer transitions 6/243 dead transitions. [2023-08-26 21:15:03,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 243 transitions, 2390 flow [2023-08-26 21:15:03,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:15:03,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:15:03,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 513 transitions. [2023-08-26 21:15:03,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2023-08-26 21:15:03,086 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 513 transitions. [2023-08-26 21:15:03,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 513 transitions. [2023-08-26 21:15:03,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:15:03,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 513 transitions. [2023-08-26 21:15:03,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 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-26 21:15:03,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 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-26 21:15:03,088 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 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-26 21:15:03,088 INFO L175 Difference]: Start difference. First operand has 86 places, 100 transitions, 792 flow. Second operand 4 states and 513 transitions. [2023-08-26 21:15:03,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 243 transitions, 2390 flow [2023-08-26 21:15:11,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 243 transitions, 2389 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:15:11,895 INFO L231 Difference]: Finished difference. Result has 91 places, 122 transitions, 1173 flow [2023-08-26 21:15:11,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1173, PETRI_PLACES=91, PETRI_TRANSITIONS=122} [2023-08-26 21:15:11,896 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 39 predicate places. [2023-08-26 21:15:11,896 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 122 transitions, 1173 flow [2023-08-26 21:15:11,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 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-26 21:15:11,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:15:11,896 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-26 21:15:11,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 21:15:11,896 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-26 21:15:11,896 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:15:11,896 INFO L85 PathProgramCache]: Analyzing trace with hash -2004329928, now seen corresponding path program 2 times [2023-08-26 21:15:11,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:15:11,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128737728] [2023-08-26 21:15:11,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:15:11,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:15:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:15:12,365 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-26 21:15:12,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:15:12,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128737728] [2023-08-26 21:15:12,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128737728] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:15:12,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:15:12,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:15:12,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105219976] [2023-08-26 21:15:12,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:15:12,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:15:12,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:15:12,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:15:12,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:15:12,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 266 [2023-08-26 21:15:12,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 122 transitions, 1173 flow. Second operand has 7 states, 7 states have (on average 101.57142857142857) internal successors, (711), 7 states have internal predecessors, (711), 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-26 21:15:12,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:15:12,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 266 [2023-08-26 21:15:12,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:15:17,807 INFO L124 PetriNetUnfolderBase]: 33975/51308 cut-off events. [2023-08-26 21:15:17,807 INFO L125 PetriNetUnfolderBase]: For 247758/247758 co-relation queries the response was YES. [2023-08-26 21:15:17,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249384 conditions, 51308 events. 33975/51308 cut-off events. For 247758/247758 co-relation queries the response was YES. Maximal size of possible extension queue 2105. Compared 381380 event pairs, 3557 based on Foata normal form. 13/50704 useless extension candidates. Maximal degree in co-relation 249344. Up to 11182 conditions per place. [2023-08-26 21:15:18,176 INFO L140 encePairwiseOnDemand]: 251/266 looper letters, 289 selfloop transitions, 142 changer transitions 5/436 dead transitions. [2023-08-26 21:15:18,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 436 transitions, 4707 flow [2023-08-26 21:15:18,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 21:15:18,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 21:15:18,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 950 transitions. [2023-08-26 21:15:18,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2023-08-26 21:15:18,179 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 950 transitions. [2023-08-26 21:15:18,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 950 transitions. [2023-08-26 21:15:18,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:15:18,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 950 transitions. [2023-08-26 21:15:18,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 118.75) internal successors, (950), 8 states have internal predecessors, (950), 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-26 21:15:18,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 266.0) internal successors, (2394), 9 states have internal predecessors, (2394), 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-26 21:15:18,183 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 266.0) internal successors, (2394), 9 states have internal predecessors, (2394), 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-26 21:15:18,183 INFO L175 Difference]: Start difference. First operand has 91 places, 122 transitions, 1173 flow. Second operand 8 states and 950 transitions. [2023-08-26 21:15:18,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 436 transitions, 4707 flow [2023-08-26 21:15:28,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 436 transitions, 4707 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 21:15:28,660 INFO L231 Difference]: Finished difference. Result has 104 places, 223 transitions, 2977 flow [2023-08-26 21:15:28,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=1173, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2977, PETRI_PLACES=104, PETRI_TRANSITIONS=223} [2023-08-26 21:15:28,661 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 52 predicate places. [2023-08-26 21:15:28,661 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 223 transitions, 2977 flow [2023-08-26 21:15:28,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 101.57142857142857) internal successors, (711), 7 states have internal predecessors, (711), 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-26 21:15:28,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:15:28,661 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-26 21:15:28,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 21:15:28,661 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-26 21:15:28,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:15:28,662 INFO L85 PathProgramCache]: Analyzing trace with hash 95609422, now seen corresponding path program 3 times [2023-08-26 21:15:28,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:15:28,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434672259] [2023-08-26 21:15:28,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:15:28,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:15:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:15:28,822 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-26 21:15:28,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:15:28,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434672259] [2023-08-26 21:15:28,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434672259] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:15:28,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:15:28,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:15:28,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566562602] [2023-08-26 21:15:28,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:15:28,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:15:28,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:15:28,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:15:28,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:15:28,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 266 [2023-08-26 21:15:28,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 223 transitions, 2977 flow. Second operand has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:28,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:15:28,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 266 [2023-08-26 21:15:28,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:15:33,579 INFO L124 PetriNetUnfolderBase]: 24945/39384 cut-off events. [2023-08-26 21:15:33,580 INFO L125 PetriNetUnfolderBase]: For 248851/253284 co-relation queries the response was YES. [2023-08-26 21:15:33,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203281 conditions, 39384 events. 24945/39384 cut-off events. For 248851/253284 co-relation queries the response was YES. Maximal size of possible extension queue 2183. Compared 323092 event pairs, 836 based on Foata normal form. 2037/40428 useless extension candidates. Maximal degree in co-relation 203233. Up to 9252 conditions per place. [2023-08-26 21:15:33,770 INFO L140 encePairwiseOnDemand]: 255/266 looper letters, 268 selfloop transitions, 33 changer transitions 294/642 dead transitions. [2023-08-26 21:15:33,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 642 transitions, 8726 flow [2023-08-26 21:15:33,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 21:15:33,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 21:15:33,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1352 transitions. [2023-08-26 21:15:33,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46206425153793573 [2023-08-26 21:15:33,773 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1352 transitions. [2023-08-26 21:15:33,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1352 transitions. [2023-08-26 21:15:33,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:15:33,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1352 transitions. [2023-08-26 21:15:33,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 122.9090909090909) internal successors, (1352), 11 states have internal predecessors, (1352), 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-26 21:15:33,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 266.0) internal successors, (3192), 12 states have internal predecessors, (3192), 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-26 21:15:33,778 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 266.0) internal successors, (3192), 12 states have internal predecessors, (3192), 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-26 21:15:33,778 INFO L175 Difference]: Start difference. First operand has 104 places, 223 transitions, 2977 flow. Second operand 11 states and 1352 transitions. [2023-08-26 21:15:33,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 642 transitions, 8726 flow [2023-08-26 21:15:48,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 642 transitions, 8434 flow, removed 50 selfloop flow, removed 4 redundant places. [2023-08-26 21:15:48,024 INFO L231 Difference]: Finished difference. Result has 109 places, 136 transitions, 1665 flow [2023-08-26 21:15:48,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=2579, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1665, PETRI_PLACES=109, PETRI_TRANSITIONS=136} [2023-08-26 21:15:48,024 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 57 predicate places. [2023-08-26 21:15:48,025 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 136 transitions, 1665 flow [2023-08-26 21:15:48,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:48,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:15:48,025 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-26 21:15:48,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 21:15:48,025 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:15:48,025 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:15:48,025 INFO L85 PathProgramCache]: Analyzing trace with hash -419140900, now seen corresponding path program 1 times [2023-08-26 21:15:48,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:15:48,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395496159] [2023-08-26 21:15:48,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:15:48,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:15:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:15:48,173 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-26 21:15:48,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:15:48,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395496159] [2023-08-26 21:15:48,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395496159] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:15:48,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:15:48,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:15:48,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568357561] [2023-08-26 21:15:48,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:15:48,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:15:48,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:15:48,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:15:48,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:15:48,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 266 [2023-08-26 21:15:48,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 136 transitions, 1665 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 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-26 21:15:48,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:15:48,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 266 [2023-08-26 21:15:48,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:15:50,716 INFO L124 PetriNetUnfolderBase]: 17817/26998 cut-off events. [2023-08-26 21:15:50,716 INFO L125 PetriNetUnfolderBase]: For 211048/211048 co-relation queries the response was YES. [2023-08-26 21:15:50,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158998 conditions, 26998 events. 17817/26998 cut-off events. For 211048/211048 co-relation queries the response was YES. Maximal size of possible extension queue 1055. Compared 183834 event pairs, 1904 based on Foata normal form. 1/26999 useless extension candidates. Maximal degree in co-relation 158958. Up to 10647 conditions per place. [2023-08-26 21:15:50,842 INFO L140 encePairwiseOnDemand]: 255/266 looper letters, 96 selfloop transitions, 27 changer transitions 186/309 dead transitions. [2023-08-26 21:15:50,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 309 transitions, 4058 flow [2023-08-26 21:15:50,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:15:50,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:15:50,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 718 transitions. [2023-08-26 21:15:50,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.449874686716792 [2023-08-26 21:15:50,843 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 718 transitions. [2023-08-26 21:15:50,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 718 transitions. [2023-08-26 21:15:50,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:15:50,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 718 transitions. [2023-08-26 21:15:50,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.66666666666667) internal successors, (718), 6 states have internal predecessors, (718), 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-26 21:15:50,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 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-26 21:15:50,847 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 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-26 21:15:50,847 INFO L175 Difference]: Start difference. First operand has 109 places, 136 transitions, 1665 flow. Second operand 6 states and 718 transitions. [2023-08-26 21:15:50,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 309 transitions, 4058 flow [2023-08-26 21:15:54,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 309 transitions, 3429 flow, removed 86 selfloop flow, removed 16 redundant places. [2023-08-26 21:15:54,166 INFO L231 Difference]: Finished difference. Result has 96 places, 82 transitions, 846 flow [2023-08-26 21:15:54,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=846, PETRI_PLACES=96, PETRI_TRANSITIONS=82} [2023-08-26 21:15:54,167 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 44 predicate places. [2023-08-26 21:15:54,167 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 82 transitions, 846 flow [2023-08-26 21:15:54,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 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-26 21:15:54,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:15:54,167 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-26 21:15:54,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 21:15:54,168 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-26 21:15:54,168 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:15:54,168 INFO L85 PathProgramCache]: Analyzing trace with hash 2031730524, now seen corresponding path program 2 times [2023-08-26 21:15:54,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:15:54,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657248938] [2023-08-26 21:15:54,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:15:54,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:15:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:15:54,671 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-26 21:15:54,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:15:54,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657248938] [2023-08-26 21:15:54,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657248938] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:15:54,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:15:54,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:15:54,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928255100] [2023-08-26 21:15:54,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:15:54,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 21:15:54,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:15:54,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 21:15:54,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-26 21:15:54,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 266 [2023-08-26 21:15:54,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 82 transitions, 846 flow. Second operand has 8 states, 8 states have (on average 111.0) internal successors, (888), 8 states have internal predecessors, (888), 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-26 21:15:54,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:15:54,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 266 [2023-08-26 21:15:54,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:15:55,297 INFO L124 PetriNetUnfolderBase]: 2359/4123 cut-off events. [2023-08-26 21:15:55,297 INFO L125 PetriNetUnfolderBase]: For 18555/18681 co-relation queries the response was YES. [2023-08-26 21:15:55,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19091 conditions, 4123 events. 2359/4123 cut-off events. For 18555/18681 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 25677 event pairs, 348 based on Foata normal form. 97/4187 useless extension candidates. Maximal degree in co-relation 19061. Up to 2274 conditions per place. [2023-08-26 21:15:55,313 INFO L140 encePairwiseOnDemand]: 260/266 looper letters, 75 selfloop transitions, 11 changer transitions 42/145 dead transitions. [2023-08-26 21:15:55,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 145 transitions, 1469 flow [2023-08-26 21:15:55,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:15:55,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:15:55,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 821 transitions. [2023-08-26 21:15:55,315 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44092373791621914 [2023-08-26 21:15:55,315 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 821 transitions. [2023-08-26 21:15:55,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 821 transitions. [2023-08-26 21:15:55,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:15:55,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 821 transitions. [2023-08-26 21:15:55,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 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-26 21:15:55,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 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-26 21:15:55,318 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 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-26 21:15:55,319 INFO L175 Difference]: Start difference. First operand has 96 places, 82 transitions, 846 flow. Second operand 7 states and 821 transitions. [2023-08-26 21:15:55,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 145 transitions, 1469 flow [2023-08-26 21:15:55,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 145 transitions, 1300 flow, removed 33 selfloop flow, removed 12 redundant places. [2023-08-26 21:15:55,386 INFO L231 Difference]: Finished difference. Result has 84 places, 74 transitions, 642 flow [2023-08-26 21:15:55,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=642, PETRI_PLACES=84, PETRI_TRANSITIONS=74} [2023-08-26 21:15:55,386 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 32 predicate places. [2023-08-26 21:15:55,386 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 74 transitions, 642 flow [2023-08-26 21:15:55,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 111.0) internal successors, (888), 8 states have internal predecessors, (888), 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-26 21:15:55,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:15:55,387 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-26 21:15:55,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 21:15:55,387 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-26 21:15:55,387 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:15:55,387 INFO L85 PathProgramCache]: Analyzing trace with hash 586563820, now seen corresponding path program 3 times [2023-08-26 21:15:55,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:15:55,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660139327] [2023-08-26 21:15:55,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:15:55,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:15:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:15:55,549 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-26 21:15:55,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:15:55,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660139327] [2023-08-26 21:15:55,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660139327] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:15:55,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:15:55,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:15:55,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718044231] [2023-08-26 21:15:55,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:15:55,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:15:55,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:15:55,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:15:55,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:15:55,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 266 [2023-08-26 21:15:55,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 74 transitions, 642 flow. Second operand has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 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-26 21:15:55,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:15:55,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 266 [2023-08-26 21:15:55,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:15:56,035 INFO L124 PetriNetUnfolderBase]: 3415/5658 cut-off events. [2023-08-26 21:15:56,036 INFO L125 PetriNetUnfolderBase]: For 22319/22319 co-relation queries the response was YES. [2023-08-26 21:15:56,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26313 conditions, 5658 events. 3415/5658 cut-off events. For 22319/22319 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 34057 event pairs, 822 based on Foata normal form. 1/5659 useless extension candidates. Maximal degree in co-relation 26291. Up to 3572 conditions per place. [2023-08-26 21:15:56,051 INFO L140 encePairwiseOnDemand]: 260/266 looper letters, 61 selfloop transitions, 6 changer transitions 73/140 dead transitions. [2023-08-26 21:15:56,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 140 transitions, 1356 flow [2023-08-26 21:15:56,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:15:56,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:15:56,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2023-08-26 21:15:56,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.462406015037594 [2023-08-26 21:15:56,053 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 492 transitions. [2023-08-26 21:15:56,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 492 transitions. [2023-08-26 21:15:56,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:15:56,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 492 transitions. [2023-08-26 21:15:56,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 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-26 21:15:56,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 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-26 21:15:56,054 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 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-26 21:15:56,055 INFO L175 Difference]: Start difference. First operand has 84 places, 74 transitions, 642 flow. Second operand 4 states and 492 transitions. [2023-08-26 21:15:56,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 140 transitions, 1356 flow [2023-08-26 21:15:56,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 140 transitions, 1290 flow, removed 5 selfloop flow, removed 7 redundant places. [2023-08-26 21:15:56,165 INFO L231 Difference]: Finished difference. Result has 79 places, 51 transitions, 344 flow [2023-08-26 21:15:56,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=344, PETRI_PLACES=79, PETRI_TRANSITIONS=51} [2023-08-26 21:15:56,166 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 27 predicate places. [2023-08-26 21:15:56,166 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 51 transitions, 344 flow [2023-08-26 21:15:56,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 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-26 21:15:56,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:15:56,166 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-26 21:15:56,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 21:15:56,166 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-26 21:15:56,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:15:56,167 INFO L85 PathProgramCache]: Analyzing trace with hash -642081374, now seen corresponding path program 4 times [2023-08-26 21:15:56,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:15:56,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187688882] [2023-08-26 21:15:56,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:15:56,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:15:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:15:56,224 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 21:15:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:15:56,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 21:15:56,293 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 21:15:56,294 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (22 of 23 remaining) [2023-08-26 21:15:56,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (21 of 23 remaining) [2023-08-26 21:15:56,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2023-08-26 21:15:56,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2023-08-26 21:15:56,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2023-08-26 21:15:56,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2023-08-26 21:15:56,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2023-08-26 21:15:56,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 23 remaining) [2023-08-26 21:15:56,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2023-08-26 21:15:56,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2023-08-26 21:15:56,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2023-08-26 21:15:56,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2023-08-26 21:15:56,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2023-08-26 21:15:56,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2023-08-26 21:15:56,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (8 of 23 remaining) [2023-08-26 21:15:56,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2023-08-26 21:15:56,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 23 remaining) [2023-08-26 21:15:56,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2023-08-26 21:15:56,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2023-08-26 21:15:56,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2023-08-26 21:15:56,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 23 remaining) [2023-08-26 21:15:56,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2023-08-26 21:15:56,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2023-08-26 21:15:56,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 21:15:56,299 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:15:56,303 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 21:15:56,303 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 21:15:56,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:15:56 BasicIcfg [2023-08-26 21:15:56,376 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 21:15:56,377 INFO L158 Benchmark]: Toolchain (without parser) took 94821.16ms. Allocated memory was 379.6MB in the beginning and 8.5GB in the end (delta: 8.1GB). Free memory was 354.6MB in the beginning and 5.5GB in the end (delta: -5.2GB). Peak memory consumption was 2.9GB. Max. memory is 16.0GB. [2023-08-26 21:15:56,377 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 379.6MB. Free memory is still 356.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 21:15:56,377 INFO L158 Benchmark]: CACSL2BoogieTranslator took 457.57ms. Allocated memory is still 379.6MB. Free memory was 354.2MB in the beginning and 329.7MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-26 21:15:56,377 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.71ms. Allocated memory is still 379.6MB. Free memory was 329.7MB in the beginning and 327.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:15:56,377 INFO L158 Benchmark]: Boogie Preprocessor took 43.93ms. Allocated memory is still 379.6MB. Free memory was 327.0MB in the beginning and 324.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:15:56,377 INFO L158 Benchmark]: RCFGBuilder took 516.57ms. Allocated memory is still 379.6MB. Free memory was 324.9MB in the beginning and 336.7MB in the end (delta: -11.8MB). Peak memory consumption was 29.5MB. Max. memory is 16.0GB. [2023-08-26 21:15:56,377 INFO L158 Benchmark]: TraceAbstraction took 93752.29ms. Allocated memory was 379.6MB in the beginning and 8.5GB in the end (delta: 8.1GB). Free memory was 335.5MB in the beginning and 5.5GB in the end (delta: -5.2GB). Peak memory consumption was 2.9GB. Max. memory is 16.0GB. [2023-08-26 21:15:56,378 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.09ms. Allocated memory is still 379.6MB. Free memory is still 356.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 457.57ms. Allocated memory is still 379.6MB. Free memory was 354.2MB in the beginning and 329.7MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 46.71ms. Allocated memory is still 379.6MB. Free memory was 329.7MB in the beginning and 327.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 43.93ms. Allocated memory is still 379.6MB. Free memory was 327.0MB in the beginning and 324.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 516.57ms. Allocated memory is still 379.6MB. Free memory was 324.9MB in the beginning and 336.7MB in the end (delta: -11.8MB). Peak memory consumption was 29.5MB. Max. memory is 16.0GB. * TraceAbstraction took 93752.29ms. Allocated memory was 379.6MB in the beginning and 8.5GB in the end (delta: 8.1GB). Free memory was 335.5MB in the beginning and 5.5GB in the end (delta: -5.2GB). Peak memory consumption was 2.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.4s, 150 PlacesBefore, 52 PlacesAfterwards, 140 TransitionsBefore, 40 TransitionsAfterwards, 4696 CoEnabledTransitionPairs, 6 FixpointIterations, 43 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 2 ChoiceCompositions, 122 TotalNumberOfCompositions, 16931 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6223, independent: 5876, independent conditional: 0, independent unconditional: 5876, dependent: 347, dependent conditional: 0, dependent unconditional: 347, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2637, independent: 2559, independent conditional: 0, independent unconditional: 2559, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6223, independent: 3317, independent conditional: 0, independent unconditional: 3317, dependent: 269, dependent conditional: 0, dependent unconditional: 269, unknown: 2637, unknown conditional: 0, unknown unconditional: 2637] , Statistics on independence cache: Total cache size (in pairs): 262, Positive cache size: 234, Positive conditional cache size: 0, Positive unconditional cache size: 234, 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_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t601; [L870] FCALL, FORK 0 pthread_create(&t601, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t601, ((void *)0), P0, ((void *)0))=-3, t601={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t602; [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L872] FCALL, FORK 0 pthread_create(&t602, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t602, ((void *)0), P1, ((void *)0))=-2, t601={5:0}, t602={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t603; [L874] FCALL, FORK 0 pthread_create(&t603, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t603, ((void *)0), P2, ((void *)0))=-1, t601={5:0}, t602={6:0}, t603={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L788] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L805] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L808] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L875] 0 pthread_t t604; [L876] FCALL, FORK 0 pthread_create(&t604, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t604, ((void *)0), P3, ((void *)0))=0, t601={5:0}, t602={6:0}, t603={7:0}, t604={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L825] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L828] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 a$flush_delayed = weak$$choice2 [L834] 4 a$mem_tmp = a [L835] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L836] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L837] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L838] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L839] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L841] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = a [L843] 4 a = a$flush_delayed ? a$mem_tmp : a [L844] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L775] EXPR 1 __unbuffered_cnt + 1 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L847] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L848] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L849] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L850] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L851] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L811] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L812] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L813] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L814] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L815] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L798] EXPR 2 __unbuffered_cnt + 1 [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L818] EXPR 3 __unbuffered_cnt + 1 [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L854] EXPR 4 __unbuffered_cnt + 1 [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L883] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L884] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L885] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L886] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t601={5:0}, t602={6:0}, t603={7:0}, t604={3:0}, weak$$choice2=1, x=2, y=1, z=2] [L889] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L891] 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", "mix023_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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 775]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 775]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 798]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 798]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur 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: 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: 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. - UnprovableResult [Line: 876]: 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, 189 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: 93.6s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 86.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 961 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 961 mSDsluCounter, 109 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 128 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2478 IncrementalHoareTripleChecker+Invalid, 2606 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 128 mSolverCounterUnsat, 64 mSDtfsCounter, 2478 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2977occurred in iteration=14, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 365 NumberOfCodeBlocks, 365 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 2436 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-26 21:15:56,398 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...