/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 10:04:15,996 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 10:04:16,053 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-27 10:04:16,061 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 10:04:16,062 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 10:04:16,096 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 10:04:16,097 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 10:04:16,102 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 10:04:16,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 10:04:16,106 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 10:04:16,106 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 10:04:16,107 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 10:04:16,107 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 10:04:16,108 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 10:04:16,108 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 10:04:16,108 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 10:04:16,109 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 10:04:16,109 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 10:04:16,109 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 10:04:16,109 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 10:04:16,109 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 10:04:16,110 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 10:04:16,110 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 10:04:16,111 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 10:04:16,111 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 10:04:16,111 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 10:04:16,111 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 10:04:16,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:04:16,112 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 10:04:16,112 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 10:04:16,113 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 10:04:16,113 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 10:04:16,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 10:04:16,114 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 10:04:16,114 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 10:04:16,114 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 10:04:16,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 10:04:16,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 10:04:16,450 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 10:04:16,450 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 10:04:16,451 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 10:04:16,452 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-27 10:04:17,533 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 10:04:17,848 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 10:04:17,848 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i [2023-08-27 10:04:17,861 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17a381a67/aa0dae51d356488fba00f5f6868a50d9/FLAG63c520da7 [2023-08-27 10:04:17,874 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17a381a67/aa0dae51d356488fba00f5f6868a50d9 [2023-08-27 10:04:17,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 10:04:17,877 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 10:04:17,878 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 10:04:17,878 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 10:04:17,881 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 10:04:17,881 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:04:17" (1/1) ... [2023-08-27 10:04:17,882 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44fd39d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:04:17, skipping insertion in model container [2023-08-27 10:04:17,882 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:04:17" (1/1) ... [2023-08-27 10:04:17,939 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 10:04:18,331 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:04:18,341 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 10:04:18,367 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 10:04:18,369 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 10:04:18,413 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:04:18,451 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:04:18,451 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:04:18,457 INFO L206 MainTranslator]: Completed translation [2023-08-27 10:04:18,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:04:18 WrapperNode [2023-08-27 10:04:18,458 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 10:04:18,459 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 10:04:18,459 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 10:04:18,459 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 10:04:18,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:04:18" (1/1) ... [2023-08-27 10:04:18,494 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:04:18" (1/1) ... [2023-08-27 10:04:18,524 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 153 [2023-08-27 10:04:18,525 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 10:04:18,525 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 10:04:18,526 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 10:04:18,526 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 10:04:18,536 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:04:18" (1/1) ... [2023-08-27 10:04:18,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:04:18" (1/1) ... [2023-08-27 10:04:18,551 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:04:18" (1/1) ... [2023-08-27 10:04:18,551 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:04:18" (1/1) ... [2023-08-27 10:04:18,559 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:04:18" (1/1) ... [2023-08-27 10:04:18,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:04:18" (1/1) ... [2023-08-27 10:04:18,580 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:04:18" (1/1) ... [2023-08-27 10:04:18,581 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:04:18" (1/1) ... [2023-08-27 10:04:18,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 10:04:18,585 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 10:04:18,586 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 10:04:18,586 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 10:04:18,593 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:04:18" (1/1) ... [2023-08-27 10:04:18,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:04:18,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 10:04:18,628 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-27 10:04:18,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-27 10:04:18,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 10:04:18,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 10:04:18,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 10:04:18,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 10:04:18,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 10:04:18,667 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 10:04:18,668 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 10:04:18,668 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 10:04:18,668 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 10:04:18,668 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 10:04:18,668 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 10:04:18,668 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-27 10:04:18,668 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-27 10:04:18,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 10:04:18,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 10:04:18,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 10:04:18,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 10:04:18,671 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 10:04:18,843 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 10:04:18,845 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 10:04:19,192 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 10:04:19,315 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 10:04:19,315 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 10:04:19,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:04:19 BoogieIcfgContainer [2023-08-27 10:04:19,317 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 10:04:19,319 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 10:04:19,319 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 10:04:19,322 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 10:04:19,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 10:04:17" (1/3) ... [2023-08-27 10:04:19,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee55942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:04:19, skipping insertion in model container [2023-08-27 10:04:19,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:04:18" (2/3) ... [2023-08-27 10:04:19,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee55942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:04:19, skipping insertion in model container [2023-08-27 10:04:19,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:04:19" (3/3) ... [2023-08-27 10:04:19,324 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_power.oepc_pso.oepc_rmo.oepc.i [2023-08-27 10:04:19,338 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 10:04:19,339 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-27 10:04:19,339 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 10:04:19,392 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 10:04:19,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 144 transitions, 308 flow [2023-08-27 10:04:19,482 INFO L124 PetriNetUnfolderBase]: 3/140 cut-off events. [2023-08-27 10:04:19,482 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:04:19,489 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-27 10:04:19,489 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 144 transitions, 308 flow [2023-08-27 10:04:19,497 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 140 transitions, 292 flow [2023-08-27 10:04:19,500 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 10:04:19,512 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 140 transitions, 292 flow [2023-08-27 10:04:19,514 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 140 transitions, 292 flow [2023-08-27 10:04:19,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 140 transitions, 292 flow [2023-08-27 10:04:19,540 INFO L124 PetriNetUnfolderBase]: 3/140 cut-off events. [2023-08-27 10:04:19,540 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:04:19,544 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-27 10:04:19,549 INFO L119 LiptonReduction]: Number of co-enabled transitions 4696 [2023-08-27 10:04:23,571 INFO L134 LiptonReduction]: Checked pairs total: 16931 [2023-08-27 10:04:23,571 INFO L136 LiptonReduction]: Total number of compositions: 122 [2023-08-27 10:04:23,591 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 10:04:23,598 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;@78a5f9de, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 10:04:23,599 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-27 10:04:23,603 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 10:04:23,603 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-08-27 10:04:23,603 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:04:23,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:04:23,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-27 10:04:23,604 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:04:23,611 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:04:23,611 INFO L85 PathProgramCache]: Analyzing trace with hash 631696, now seen corresponding path program 1 times [2023-08-27 10:04:23,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:04:23,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88240404] [2023-08-27 10:04:23,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:04:23,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:04:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:04:23,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:04:23,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:04:23,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88240404] [2023-08-27 10:04:23,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88240404] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:04:23,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:04:23,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:04:23,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97704281] [2023-08-27 10:04:23,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:04:24,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:04:24,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:04:24,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:04:24,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:04:24,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 266 [2023-08-27 10:04:24,028 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-27 10:04:24,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:04:24,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 266 [2023-08-27 10:04:24,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:04:26,038 INFO L124 PetriNetUnfolderBase]: 12064/17142 cut-off events. [2023-08-27 10:04:26,038 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2023-08-27 10:04:26,079 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-27 10:04:26,191 INFO L140 encePairwiseOnDemand]: 262/266 looper letters, 50 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-08-27 10:04:26,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 61 transitions, 247 flow [2023-08-27 10:04:26,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:04:26,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:04:26,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-08-27 10:04:26,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5162907268170426 [2023-08-27 10:04:26,211 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-08-27 10:04:26,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-08-27 10:04:26,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:04:26,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-08-27 10:04:26,221 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-27 10:04:26,226 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-27 10:04:26,227 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-27 10:04:26,229 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 3 states and 412 transitions. [2023-08-27 10:04:26,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 61 transitions, 247 flow [2023-08-27 10:04:26,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 240 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 10:04:26,236 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 88 flow [2023-08-27 10:04:26,238 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-27 10:04:26,242 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2023-08-27 10:04:26,243 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 88 flow [2023-08-27 10:04:26,243 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-27 10:04:26,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:04:26,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 10:04:26,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 10:04:26,244 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:04:26,244 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:04:26,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1639459054, now seen corresponding path program 1 times [2023-08-27 10:04:26,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:04:26,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411675110] [2023-08-27 10:04:26,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:04:26,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:04:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:04:26,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:04:26,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:04:26,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411675110] [2023-08-27 10:04:26,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411675110] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:04:26,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:04:26,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:04:26,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015295325] [2023-08-27 10:04:26,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:04:26,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:04:26,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:04:26,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:04:26,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:04:26,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 266 [2023-08-27 10:04:26,336 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-27 10:04:26,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:04:26,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 266 [2023-08-27 10:04:26,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:04:28,053 INFO L124 PetriNetUnfolderBase]: 12225/16946 cut-off events. [2023-08-27 10:04:28,054 INFO L125 PetriNetUnfolderBase]: For 739/739 co-relation queries the response was YES. [2023-08-27 10:04:28,095 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-27 10:04:28,173 INFO L140 encePairwiseOnDemand]: 253/266 looper letters, 51 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2023-08-27 10:04:28,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 61 transitions, 254 flow [2023-08-27 10:04:28,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:04:28,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:04:28,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2023-08-27 10:04:28,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5087719298245614 [2023-08-27 10:04:28,177 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2023-08-27 10:04:28,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2023-08-27 10:04:28,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:04:28,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2023-08-27 10:04:28,179 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-27 10:04:28,181 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-27 10:04:28,182 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-27 10:04:28,182 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 88 flow. Second operand 3 states and 406 transitions. [2023-08-27 10:04:28,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 61 transitions, 254 flow [2023-08-27 10:04:28,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 248 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:04:28,186 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 131 flow [2023-08-27 10:04:28,186 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-27 10:04:28,298 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2023-08-27 10:04:28,298 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 131 flow [2023-08-27 10:04:28,298 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-27 10:04:28,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:04:28,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:04:28,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 10:04:28,299 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-27 10:04:28,299 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:04:28,299 INFO L85 PathProgramCache]: Analyzing trace with hash -805959574, now seen corresponding path program 1 times [2023-08-27 10:04:28,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:04:28,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345943005] [2023-08-27 10:04:28,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:04:28,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:04:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:04:28,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:04:28,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:04:28,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345943005] [2023-08-27 10:04:28,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345943005] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:04:28,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:04:28,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:04:28,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051789698] [2023-08-27 10:04:28,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:04:28,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:04:28,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:04:28,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:04:28,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:04:28,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 266 [2023-08-27 10:04:28,581 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-27 10:04:28,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:04:28,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 266 [2023-08-27 10:04:28,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:04:32,815 INFO L124 PetriNetUnfolderBase]: 39390/55851 cut-off events. [2023-08-27 10:04:32,815 INFO L125 PetriNetUnfolderBase]: For 5429/6482 co-relation queries the response was YES. [2023-08-27 10:04:32,941 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-27 10:04:33,199 INFO L140 encePairwiseOnDemand]: 255/266 looper letters, 61 selfloop transitions, 10 changer transitions 0/75 dead transitions. [2023-08-27 10:04:33,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 75 transitions, 371 flow [2023-08-27 10:04:33,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:04:33,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:04:33,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-08-27 10:04:33,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47869674185463656 [2023-08-27 10:04:33,201 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-08-27 10:04:33,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-08-27 10:04:33,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:04:33,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-08-27 10:04:33,203 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-27 10:04:33,204 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-27 10:04:33,205 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-27 10:04:33,205 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 131 flow. Second operand 3 states and 382 transitions. [2023-08-27 10:04:33,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 75 transitions, 371 flow [2023-08-27 10:04:33,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 75 transitions, 362 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:04:33,241 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 204 flow [2023-08-27 10:04:33,241 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-27 10:04:33,243 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2023-08-27 10:04:33,243 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 204 flow [2023-08-27 10:04:33,243 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-27 10:04:33,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:04:33,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:04:33,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 10:04:33,247 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-27 10:04:33,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:04:33,248 INFO L85 PathProgramCache]: Analyzing trace with hash 785054782, now seen corresponding path program 1 times [2023-08-27 10:04:33,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:04:33,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272608905] [2023-08-27 10:04:33,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:04:33,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:04:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:04:33,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:04:33,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:04:33,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272608905] [2023-08-27 10:04:33,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272608905] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:04:33,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:04:33,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:04:33,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221244664] [2023-08-27 10:04:33,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:04:33,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:04:33,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:04:33,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:04:33,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:04:33,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 266 [2023-08-27 10:04:33,438 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-27 10:04:33,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:04:33,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 266 [2023-08-27 10:04:33,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:04:37,274 INFO L124 PetriNetUnfolderBase]: 37670/53529 cut-off events. [2023-08-27 10:04:37,274 INFO L125 PetriNetUnfolderBase]: For 26462/27446 co-relation queries the response was YES. [2023-08-27 10:04:37,408 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-27 10:04:37,665 INFO L140 encePairwiseOnDemand]: 256/266 looper letters, 85 selfloop transitions, 10 changer transitions 0/99 dead transitions. [2023-08-27 10:04:37,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 99 transitions, 568 flow [2023-08-27 10:04:37,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:04:37,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:04:37,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 501 transitions. [2023-08-27 10:04:37,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4708646616541353 [2023-08-27 10:04:37,669 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 501 transitions. [2023-08-27 10:04:37,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 501 transitions. [2023-08-27 10:04:37,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:04:37,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 501 transitions. [2023-08-27 10:04:37,671 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-27 10:04:37,673 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-27 10:04:37,673 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-27 10:04:37,674 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 204 flow. Second operand 4 states and 501 transitions. [2023-08-27 10:04:37,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 99 transitions, 568 flow [2023-08-27 10:04:37,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 99 transitions, 536 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:04:37,840 INFO L231 Difference]: Finished difference. Result has 57 places, 57 transitions, 262 flow [2023-08-27 10:04:37,841 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-27 10:04:37,842 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2023-08-27 10:04:37,843 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 57 transitions, 262 flow [2023-08-27 10:04:37,843 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-27 10:04:37,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:04:37,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:04:37,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 10:04:37,844 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-27 10:04:37,844 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:04:37,844 INFO L85 PathProgramCache]: Analyzing trace with hash -818137746, now seen corresponding path program 1 times [2023-08-27 10:04:37,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:04:37,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336124857] [2023-08-27 10:04:37,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:04:37,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:04:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:04:37,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:04:37,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:04:37,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336124857] [2023-08-27 10:04:37,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336124857] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:04:37,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:04:37,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:04:37,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261006464] [2023-08-27 10:04:37,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:04:37,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:04:37,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:04:37,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:04:37,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:04:37,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 266 [2023-08-27 10:04:37,922 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-27 10:04:37,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:04:37,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 266 [2023-08-27 10:04:37,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:04:39,595 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-27 10:04:39,595 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-27 10:04:39,595 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:39,596 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:39,596 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:39,596 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-27 10:04:39,596 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-27 10:04:39,596 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:39,596 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:39,597 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:40,014 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-27 10:04:40,015 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-27 10:04:40,015 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:04:40,015 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:04:40,015 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:04:40,016 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-27 10:04:40,016 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-27 10:04:40,016 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:04:40,016 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:04:40,016 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:04:40,016 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-27 10:04:40,016 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-27 10:04:40,016 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:04:40,017 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:04:40,017 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:04:41,075 INFO L124 PetriNetUnfolderBase]: 25076/35506 cut-off events. [2023-08-27 10:04:41,075 INFO L125 PetriNetUnfolderBase]: For 24747/26685 co-relation queries the response was YES. [2023-08-27 10:04:41,182 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-27 10:04:41,331 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 59 selfloop transitions, 5 changer transitions 0/78 dead transitions. [2023-08-27 10:04:41,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 78 transitions, 470 flow [2023-08-27 10:04:41,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:04:41,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:04:41,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 512 transitions. [2023-08-27 10:04:41,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48120300751879697 [2023-08-27 10:04:41,333 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 512 transitions. [2023-08-27 10:04:41,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 512 transitions. [2023-08-27 10:04:41,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:04:41,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 512 transitions. [2023-08-27 10:04:41,335 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-27 10:04:41,337 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-27 10:04:41,338 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-27 10:04:41,338 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 262 flow. Second operand 4 states and 512 transitions. [2023-08-27 10:04:41,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 78 transitions, 470 flow [2023-08-27 10:04:41,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 78 transitions, 467 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:04:41,382 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 253 flow [2023-08-27 10:04:41,382 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-27 10:04:41,383 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2023-08-27 10:04:41,383 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 253 flow [2023-08-27 10:04:41,383 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-27 10:04:41,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:04:41,383 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:04:41,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 10:04:41,384 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-27 10:04:41,384 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:04:41,384 INFO L85 PathProgramCache]: Analyzing trace with hash 114965235, now seen corresponding path program 1 times [2023-08-27 10:04:41,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:04:41,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875056747] [2023-08-27 10:04:41,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:04:41,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:04:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:04:41,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:04:41,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:04:41,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875056747] [2023-08-27 10:04:41,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875056747] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:04:41,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:04:41,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:04:41,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94143725] [2023-08-27 10:04:41,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:04:41,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:04:41,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:04:41,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:04:41,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:04:41,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 266 [2023-08-27 10:04:41,438 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-27 10:04:41,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:04:41,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 266 [2023-08-27 10:04:41,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:04:43,074 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-27 10:04:43,075 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-27 10:04:43,075 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:43,075 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:43,075 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:43,075 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-27 10:04:43,075 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-27 10:04:43,075 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:43,075 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:43,075 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:43,287 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-27 10:04:43,288 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-27 10:04:43,288 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:04:43,288 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:04:43,288 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:04:43,288 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-27 10:04:43,288 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-27 10:04:43,288 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:04:43,288 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:04:43,288 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:04:43,288 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-27 10:04:43,289 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-27 10:04:43,289 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:04:43,289 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:04:43,289 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:04:43,913 INFO L124 PetriNetUnfolderBase]: 18573/26303 cut-off events. [2023-08-27 10:04:43,913 INFO L125 PetriNetUnfolderBase]: For 23257/24797 co-relation queries the response was YES. [2023-08-27 10:04:43,963 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-27 10:04:44,029 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 82 selfloop transitions, 9 changer transitions 0/105 dead transitions. [2023-08-27 10:04:44,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 105 transitions, 637 flow [2023-08-27 10:04:44,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:04:44,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:04:44,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 533 transitions. [2023-08-27 10:04:44,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5009398496240601 [2023-08-27 10:04:44,031 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 533 transitions. [2023-08-27 10:04:44,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 533 transitions. [2023-08-27 10:04:44,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:04:44,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 533 transitions. [2023-08-27 10:04:44,033 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-27 10:04:44,034 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-27 10:04:44,035 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-27 10:04:44,035 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 253 flow. Second operand 4 states and 533 transitions. [2023-08-27 10:04:44,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 105 transitions, 637 flow [2023-08-27 10:04:44,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 105 transitions, 631 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:04:44,060 INFO L231 Difference]: Finished difference. Result has 57 places, 57 transitions, 305 flow [2023-08-27 10:04:44,060 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-27 10:04:44,062 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2023-08-27 10:04:44,062 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 57 transitions, 305 flow [2023-08-27 10:04:44,063 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-27 10:04:44,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:04:44,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:04:44,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 10:04:44,063 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:04:44,064 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:04:44,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1082581425, now seen corresponding path program 1 times [2023-08-27 10:04:44,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:04:44,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87026964] [2023-08-27 10:04:44,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:04:44,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:04:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:04:44,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:04:44,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:04:44,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87026964] [2023-08-27 10:04:44,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87026964] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:04:44,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:04:44,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:04:44,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402721935] [2023-08-27 10:04:44,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:04:44,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:04:44,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:04:44,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:04:44,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:04:44,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 266 [2023-08-27 10:04:44,194 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-27 10:04:44,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:04:44,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 266 [2023-08-27 10:04:44,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:04:46,875 INFO L124 PetriNetUnfolderBase]: 24162/32817 cut-off events. [2023-08-27 10:04:46,875 INFO L125 PetriNetUnfolderBase]: For 44640/44640 co-relation queries the response was YES. [2023-08-27 10:04:46,948 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-27 10:04:47,032 INFO L140 encePairwiseOnDemand]: 256/266 looper letters, 108 selfloop transitions, 15 changer transitions 0/123 dead transitions. [2023-08-27 10:04:47,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 123 transitions, 882 flow [2023-08-27 10:04:47,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:04:47,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:04:47,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 509 transitions. [2023-08-27 10:04:47,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4783834586466165 [2023-08-27 10:04:47,034 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 509 transitions. [2023-08-27 10:04:47,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 509 transitions. [2023-08-27 10:04:47,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:04:47,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 509 transitions. [2023-08-27 10:04:47,035 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-27 10:04:47,037 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-27 10:04:47,037 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-27 10:04:47,037 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 305 flow. Second operand 4 states and 509 transitions. [2023-08-27 10:04:47,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 123 transitions, 882 flow [2023-08-27 10:04:47,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 123 transitions, 836 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-08-27 10:04:47,074 INFO L231 Difference]: Finished difference. Result has 61 places, 66 transitions, 428 flow [2023-08-27 10:04:47,074 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-27 10:04:47,075 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2023-08-27 10:04:47,075 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 66 transitions, 428 flow [2023-08-27 10:04:47,075 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-27 10:04:47,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:04:47,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:04:47,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 10:04:47,075 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:04:47,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:04:47,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1754427678, now seen corresponding path program 1 times [2023-08-27 10:04:47,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:04:47,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12149602] [2023-08-27 10:04:47,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:04:47,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:04:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:04:47,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:04:47,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:04:47,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12149602] [2023-08-27 10:04:47,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12149602] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:04:47,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:04:47,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:04:47,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696434523] [2023-08-27 10:04:47,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:04:47,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:04:47,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:04:47,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:04:47,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:04:47,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 266 [2023-08-27 10:04:47,189 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-27 10:04:47,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:04:47,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 266 [2023-08-27 10:04:47,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:04:48,303 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-27 10:04:48,304 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 10:04:48,304 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 10:04:48,304 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 10:04:48,304 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 10:04:48,510 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-27 10:04:48,511 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-27 10:04:48,511 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:48,511 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:48,511 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:48,511 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-27 10:04:48,511 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-27 10:04:48,511 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:48,511 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:48,511 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:48,527 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-27 10:04:48,528 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-27 10:04:48,528 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:48,528 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:48,528 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:48,528 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-27 10:04:48,528 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-27 10:04:48,528 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:48,528 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:48,528 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:48,740 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-27 10:04:48,740 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-27 10:04:48,740 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:04:48,741 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:04:48,741 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:04:48,741 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-27 10:04:48,741 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-27 10:04:48,741 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:04:48,741 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:04:48,741 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:04:48,742 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-27 10:04:48,742 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-27 10:04:48,742 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:04:48,742 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:04:48,742 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:04:49,390 INFO L124 PetriNetUnfolderBase]: 13790/20541 cut-off events. [2023-08-27 10:04:49,390 INFO L125 PetriNetUnfolderBase]: For 27679/29810 co-relation queries the response was YES. [2023-08-27 10:04:49,484 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-27 10:04:49,560 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 105 selfloop transitions, 10 changer transitions 0/134 dead transitions. [2023-08-27 10:04:49,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 134 transitions, 992 flow [2023-08-27 10:04:49,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:04:49,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:04:49,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 631 transitions. [2023-08-27 10:04:49,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47443609022556393 [2023-08-27 10:04:49,562 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 631 transitions. [2023-08-27 10:04:49,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 631 transitions. [2023-08-27 10:04:49,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:04:49,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 631 transitions. [2023-08-27 10:04:49,564 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-27 10:04:49,565 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-27 10:04:49,566 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-27 10:04:49,566 INFO L175 Difference]: Start difference. First operand has 61 places, 66 transitions, 428 flow. Second operand 5 states and 631 transitions. [2023-08-27 10:04:49,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 134 transitions, 992 flow [2023-08-27 10:04:49,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 134 transitions, 988 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:04:49,647 INFO L231 Difference]: Finished difference. Result has 67 places, 71 transitions, 495 flow [2023-08-27 10:04:49,648 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-27 10:04:49,648 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 15 predicate places. [2023-08-27 10:04:49,648 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 71 transitions, 495 flow [2023-08-27 10:04:49,649 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-27 10:04:49,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:04:49,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:04:49,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 10:04:49,649 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:04:49,649 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:04:49,649 INFO L85 PathProgramCache]: Analyzing trace with hash 10425211, now seen corresponding path program 1 times [2023-08-27 10:04:49,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:04:49,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632658150] [2023-08-27 10:04:49,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:04:49,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:04:49,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:04:49,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:04:49,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:04:49,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632658150] [2023-08-27 10:04:49,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632658150] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:04:49,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:04:49,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:04:49,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847097384] [2023-08-27 10:04:49,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:04:49,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:04:49,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:04:49,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:04:49,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:04:49,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 266 [2023-08-27 10:04:49,860 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-27 10:04:49,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:04:49,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 266 [2023-08-27 10:04:49,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:04:50,715 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-27 10:04:50,715 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 10:04:50,715 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 10:04:50,715 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 10:04:50,715 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 10:04:50,716 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-27 10:04:50,716 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 10:04:50,716 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 10:04:50,716 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 10:04:50,716 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 10:04:50,840 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-27 10:04:50,840 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-27 10:04:50,840 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:50,840 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:50,840 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:50,840 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-27 10:04:50,840 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-27 10:04:50,840 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:50,840 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:50,840 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:50,842 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-27 10:04:50,842 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-27 10:04:50,842 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:50,842 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:50,842 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:50,842 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-27 10:04:50,842 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-27 10:04:50,842 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:50,842 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:50,842 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:51,290 INFO L124 PetriNetUnfolderBase]: 10065/15626 cut-off events. [2023-08-27 10:04:51,290 INFO L125 PetriNetUnfolderBase]: For 26286/27308 co-relation queries the response was YES. [2023-08-27 10:04:51,342 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-27 10:04:51,389 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 131 selfloop transitions, 19 changer transitions 0/169 dead transitions. [2023-08-27 10:04:51,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 169 transitions, 1263 flow [2023-08-27 10:04:51,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:04:51,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:04:51,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 882 transitions. [2023-08-27 10:04:51,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2023-08-27 10:04:51,392 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 882 transitions. [2023-08-27 10:04:51,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 882 transitions. [2023-08-27 10:04:51,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:04:51,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 882 transitions. [2023-08-27 10:04:51,394 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-27 10:04:51,397 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-27 10:04:51,397 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-27 10:04:51,397 INFO L175 Difference]: Start difference. First operand has 67 places, 71 transitions, 495 flow. Second operand 7 states and 882 transitions. [2023-08-27 10:04:51,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 169 transitions, 1263 flow [2023-08-27 10:04:51,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 169 transitions, 1249 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:04:51,686 INFO L231 Difference]: Finished difference. Result has 74 places, 76 transitions, 567 flow [2023-08-27 10:04:51,686 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-27 10:04:51,687 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 22 predicate places. [2023-08-27 10:04:51,687 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 76 transitions, 567 flow [2023-08-27 10:04:51,687 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-27 10:04:51,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:04:51,687 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:04:51,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 10:04:51,688 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-27 10:04:51,688 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:04:51,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1925902796, now seen corresponding path program 1 times [2023-08-27 10:04:51,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:04:51,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899272553] [2023-08-27 10:04:51,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:04:51,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:04:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:04:51,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:04:51,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:04:51,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899272553] [2023-08-27 10:04:51,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899272553] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:04:51,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:04:51,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:04:51,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352526326] [2023-08-27 10:04:51,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:04:51,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:04:51,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:04:51,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:04:51,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:04:51,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 266 [2023-08-27 10:04:51,765 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-27 10:04:51,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:04:51,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 266 [2023-08-27 10:04:51,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:04:52,953 INFO L124 PetriNetUnfolderBase]: 9019/13908 cut-off events. [2023-08-27 10:04:52,953 INFO L125 PetriNetUnfolderBase]: For 32183/33004 co-relation queries the response was YES. [2023-08-27 10:04:53,004 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-27 10:04:53,050 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 101 selfloop transitions, 21 changer transitions 0/141 dead transitions. [2023-08-27 10:04:53,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 141 transitions, 1131 flow [2023-08-27 10:04:53,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:04:53,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:04:53,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 660 transitions. [2023-08-27 10:04:53,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49624060150375937 [2023-08-27 10:04:53,052 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 660 transitions. [2023-08-27 10:04:53,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 660 transitions. [2023-08-27 10:04:53,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:04:53,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 660 transitions. [2023-08-27 10:04:53,054 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-27 10:04:53,056 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-27 10:04:53,056 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-27 10:04:53,056 INFO L175 Difference]: Start difference. First operand has 74 places, 76 transitions, 567 flow. Second operand 5 states and 660 transitions. [2023-08-27 10:04:53,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 141 transitions, 1131 flow [2023-08-27 10:04:53,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 141 transitions, 1097 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-27 10:04:53,500 INFO L231 Difference]: Finished difference. Result has 75 places, 80 transitions, 627 flow [2023-08-27 10:04:53,500 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-27 10:04:53,500 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2023-08-27 10:04:53,501 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 80 transitions, 627 flow [2023-08-27 10:04:53,501 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-27 10:04:53,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:04:53,501 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-27 10:04:53,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 10:04:53,501 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-27 10:04:53,502 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:04:53,502 INFO L85 PathProgramCache]: Analyzing trace with hash 546458995, now seen corresponding path program 1 times [2023-08-27 10:04:53,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:04:53,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101987475] [2023-08-27 10:04:53,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:04:53,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:04:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:04:53,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:04:53,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:04:53,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101987475] [2023-08-27 10:04:53,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101987475] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:04:53,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:04:53,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:04:53,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980825226] [2023-08-27 10:04:53,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:04:53,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:04:53,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:04:53,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:04:53,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:04:53,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 266 [2023-08-27 10:04:53,775 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-27 10:04:53,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:04:53,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 266 [2023-08-27 10:04:53,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:04:54,537 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-27 10:04:54,537 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 10:04:54,538 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 10:04:54,538 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 10:04:54,538 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 10:04:54,538 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-27 10:04:54,538 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 10:04:54,538 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 10:04:54,538 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 10:04:54,538 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 10:04:54,666 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-27 10:04:54,667 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-27 10:04:54,667 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:54,667 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:54,667 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:54,667 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-27 10:04:54,667 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-27 10:04:54,667 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:54,667 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:54,667 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:54,669 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-27 10:04:54,669 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-27 10:04:54,669 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:54,669 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:54,669 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:54,669 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-27 10:04:54,669 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-27 10:04:54,669 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:54,669 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:54,669 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:54,985 INFO L124 PetriNetUnfolderBase]: 8076/12369 cut-off events. [2023-08-27 10:04:54,985 INFO L125 PetriNetUnfolderBase]: For 30510/31319 co-relation queries the response was YES. [2023-08-27 10:04:55,047 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-27 10:04:55,092 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 152 selfloop transitions, 28 changer transitions 4/203 dead transitions. [2023-08-27 10:04:55,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 203 transitions, 1603 flow [2023-08-27 10:04:55,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 10:04:55,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 10:04:55,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1131 transitions. [2023-08-27 10:04:55,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4724310776942356 [2023-08-27 10:04:55,095 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1131 transitions. [2023-08-27 10:04:55,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1131 transitions. [2023-08-27 10:04:55,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:04:55,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1131 transitions. [2023-08-27 10:04:55,098 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-27 10:04:55,101 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-27 10:04:55,102 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-27 10:04:55,102 INFO L175 Difference]: Start difference. First operand has 75 places, 80 transitions, 627 flow. Second operand 9 states and 1131 transitions. [2023-08-27 10:04:55,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 203 transitions, 1603 flow [2023-08-27 10:04:56,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 203 transitions, 1537 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-08-27 10:04:56,119 INFO L231 Difference]: Finished difference. Result has 83 places, 84 transitions, 679 flow [2023-08-27 10:04:56,119 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-27 10:04:56,120 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 31 predicate places. [2023-08-27 10:04:56,120 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 84 transitions, 679 flow [2023-08-27 10:04:56,120 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-27 10:04:56,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:04:56,120 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:04:56,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 10:04:56,121 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:04:56,121 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:04:56,121 INFO L85 PathProgramCache]: Analyzing trace with hash -930043560, now seen corresponding path program 1 times [2023-08-27 10:04:56,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:04:56,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235409046] [2023-08-27 10:04:56,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:04:56,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:04:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:04:56,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:04:56,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:04:56,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235409046] [2023-08-27 10:04:56,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235409046] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:04:56,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:04:56,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:04:56,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926817572] [2023-08-27 10:04:56,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:04:56,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:04:56,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:04:56,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:04:56,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:04:56,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 266 [2023-08-27 10:04:56,783 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-27 10:04:56,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:04:56,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 266 [2023-08-27 10:04:56,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:04:57,872 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-27 10:04:57,872 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 10:04:57,872 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 10:04:57,872 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 10:04:57,872 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 10:04:58,042 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-27 10:04:58,042 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-27 10:04:58,042 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:58,042 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:58,042 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:58,100 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-27 10:04:58,100 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-27 10:04:58,100 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:58,100 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:58,100 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:58,101 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-27 10:04:58,101 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-27 10:04:58,101 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:58,101 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:58,101 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:04:58,169 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-27 10:04:58,169 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-27 10:04:58,169 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:04:58,169 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:04:58,170 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:04:58,320 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-27 10:04:58,320 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-27 10:04:58,320 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-27 10:04:58,321 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-27 10:04:58,321 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-27 10:04:58,827 INFO L124 PetriNetUnfolderBase]: 13930/22253 cut-off events. [2023-08-27 10:04:58,827 INFO L125 PetriNetUnfolderBase]: For 77494/78327 co-relation queries the response was YES. [2023-08-27 10:04:58,987 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-27 10:04:59,069 INFO L140 encePairwiseOnDemand]: 258/266 looper letters, 234 selfloop transitions, 15 changer transitions 8/276 dead transitions. [2023-08-27 10:04:59,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 276 transitions, 2764 flow [2023-08-27 10:04:59,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:04:59,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:04:59,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 890 transitions. [2023-08-27 10:04:59,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47798066595059074 [2023-08-27 10:04:59,071 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 890 transitions. [2023-08-27 10:04:59,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 890 transitions. [2023-08-27 10:04:59,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:04:59,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 890 transitions. [2023-08-27 10:04:59,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.14285714285714) internal successors, (890), 7 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:04:59,076 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-27 10:04:59,077 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-27 10:04:59,077 INFO L175 Difference]: Start difference. First operand has 83 places, 84 transitions, 679 flow. Second operand 7 states and 890 transitions. [2023-08-27 10:04:59,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 276 transitions, 2764 flow [2023-08-27 10:05:02,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 276 transitions, 2513 flow, removed 10 selfloop flow, removed 6 redundant places. [2023-08-27 10:05:02,382 INFO L231 Difference]: Finished difference. Result has 86 places, 100 transitions, 792 flow [2023-08-27 10:05:02,383 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-27 10:05:02,383 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 34 predicate places. [2023-08-27 10:05:02,383 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 100 transitions, 792 flow [2023-08-27 10:05:02,384 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-27 10:05:02,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:05:02,384 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-27 10:05:02,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 10:05:02,384 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:05:02,384 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:05:02,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1609591893, now seen corresponding path program 1 times [2023-08-27 10:05:02,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:05:02,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793549386] [2023-08-27 10:05:02,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:05:02,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:05:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:05:02,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:05:02,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:05:02,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793549386] [2023-08-27 10:05:02,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793549386] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:05:02,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:05:02,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:05:02,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4501060] [2023-08-27 10:05:02,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:05:02,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:05:02,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:05:02,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:05:02,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:05:02,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 266 [2023-08-27 10:05:02,582 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-27 10:05:02,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:05:02,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 266 [2023-08-27 10:05:02,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:05:06,222 INFO L124 PetriNetUnfolderBase]: 28776/42657 cut-off events. [2023-08-27 10:05:06,222 INFO L125 PetriNetUnfolderBase]: For 155786/155786 co-relation queries the response was YES. [2023-08-27 10:05:06,548 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-27 10:05:06,729 INFO L140 encePairwiseOnDemand]: 255/266 looper letters, 207 selfloop transitions, 30 changer transitions 6/243 dead transitions. [2023-08-27 10:05:06,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 243 transitions, 2390 flow [2023-08-27 10:05:06,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:05:06,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:05:06,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 513 transitions. [2023-08-27 10:05:06,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2023-08-27 10:05:06,731 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 513 transitions. [2023-08-27 10:05:06,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 513 transitions. [2023-08-27 10:05:06,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:05:06,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 513 transitions. [2023-08-27 10:05:06,732 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-27 10:05:06,733 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-27 10:05:06,734 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-27 10:05:06,734 INFO L175 Difference]: Start difference. First operand has 86 places, 100 transitions, 792 flow. Second operand 4 states and 513 transitions. [2023-08-27 10:05:06,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 243 transitions, 2390 flow [2023-08-27 10:05:14,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 243 transitions, 2389 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:05:14,600 INFO L231 Difference]: Finished difference. Result has 91 places, 122 transitions, 1173 flow [2023-08-27 10:05:14,600 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-27 10:05:14,600 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 39 predicate places. [2023-08-27 10:05:14,601 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 122 transitions, 1173 flow [2023-08-27 10:05:14,601 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-27 10:05:14,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:05:14,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:05:14,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 10:05:14,601 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:05:14,601 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:05:14,602 INFO L85 PathProgramCache]: Analyzing trace with hash -2004329928, now seen corresponding path program 2 times [2023-08-27 10:05:14,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:05:14,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035381455] [2023-08-27 10:05:14,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:05:14,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:05:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:05:15,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-27 10:05:15,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:05:15,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035381455] [2023-08-27 10:05:15,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035381455] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:05:15,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:05:15,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:05:15,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981634590] [2023-08-27 10:05:15,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:05:15,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 10:05:15,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:05:15,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 10:05:15,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-27 10:05:15,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 266 [2023-08-27 10:05:15,315 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-27 10:05:15,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:05:15,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 266 [2023-08-27 10:05:15,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:05:20,806 INFO L124 PetriNetUnfolderBase]: 33975/51308 cut-off events. [2023-08-27 10:05:20,807 INFO L125 PetriNetUnfolderBase]: For 247758/247758 co-relation queries the response was YES. [2023-08-27 10:05:21,067 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-27 10:05:21,233 INFO L140 encePairwiseOnDemand]: 251/266 looper letters, 289 selfloop transitions, 142 changer transitions 5/436 dead transitions. [2023-08-27 10:05:21,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 436 transitions, 4707 flow [2023-08-27 10:05:21,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 10:05:21,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 10:05:21,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 950 transitions. [2023-08-27 10:05:21,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2023-08-27 10:05:21,237 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 950 transitions. [2023-08-27 10:05:21,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 950 transitions. [2023-08-27 10:05:21,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:05:21,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 950 transitions. [2023-08-27 10:05:21,239 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-27 10:05:21,241 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-27 10:05:21,241 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-27 10:05:21,241 INFO L175 Difference]: Start difference. First operand has 91 places, 122 transitions, 1173 flow. Second operand 8 states and 950 transitions. [2023-08-27 10:05:21,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 436 transitions, 4707 flow [2023-08-27 10:05:34,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 436 transitions, 4707 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 10:05:34,096 INFO L231 Difference]: Finished difference. Result has 104 places, 223 transitions, 2977 flow [2023-08-27 10:05:34,096 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-27 10:05:34,097 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 52 predicate places. [2023-08-27 10:05:34,097 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 223 transitions, 2977 flow [2023-08-27 10:05:34,097 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-27 10:05:34,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:05:34,097 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:05:34,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 10:05:34,098 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:05:34,098 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:05:34,098 INFO L85 PathProgramCache]: Analyzing trace with hash 95609422, now seen corresponding path program 3 times [2023-08-27 10:05:34,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:05:34,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803645470] [2023-08-27 10:05:34,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:05:34,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:05:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:05:34,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:05:34,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:05:34,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803645470] [2023-08-27 10:05:34,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803645470] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:05:34,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:05:34,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 10:05:34,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318527025] [2023-08-27 10:05:34,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:05:34,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 10:05:34,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:05:34,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 10:05:34,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-27 10:05:34,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 266 [2023-08-27 10:05:34,376 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-27 10:05:34,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:05:34,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 266 [2023-08-27 10:05:34,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:05:39,427 INFO L124 PetriNetUnfolderBase]: 24945/39384 cut-off events. [2023-08-27 10:05:39,427 INFO L125 PetriNetUnfolderBase]: For 248851/253284 co-relation queries the response was YES. [2023-08-27 10:05:39,721 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-27 10:05:39,778 INFO L140 encePairwiseOnDemand]: 255/266 looper letters, 268 selfloop transitions, 33 changer transitions 294/642 dead transitions. [2023-08-27 10:05:39,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 642 transitions, 8726 flow [2023-08-27 10:05:39,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 10:05:39,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 10:05:39,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1352 transitions. [2023-08-27 10:05:39,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46206425153793573 [2023-08-27 10:05:39,781 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1352 transitions. [2023-08-27 10:05:39,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1352 transitions. [2023-08-27 10:05:39,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:05:39,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1352 transitions. [2023-08-27 10:05:39,784 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-27 10:05:39,788 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-27 10:05:39,789 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-27 10:05:39,789 INFO L175 Difference]: Start difference. First operand has 104 places, 223 transitions, 2977 flow. Second operand 11 states and 1352 transitions. [2023-08-27 10:05:39,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 642 transitions, 8726 flow [2023-08-27 10:05:54,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 642 transitions, 8434 flow, removed 50 selfloop flow, removed 4 redundant places. [2023-08-27 10:05:54,704 INFO L231 Difference]: Finished difference. Result has 109 places, 136 transitions, 1665 flow [2023-08-27 10:05:54,705 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-27 10:05:54,705 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 57 predicate places. [2023-08-27 10:05:54,705 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 136 transitions, 1665 flow [2023-08-27 10:05:54,706 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-27 10:05:54,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:05:54,706 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:05:54,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 10:05:54,706 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-27 10:05:54,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:05:54,707 INFO L85 PathProgramCache]: Analyzing trace with hash -419140900, now seen corresponding path program 1 times [2023-08-27 10:05:54,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:05:54,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669485843] [2023-08-27 10:05:54,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:05:54,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:05:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:05:54,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:05:54,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:05:54,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669485843] [2023-08-27 10:05:54,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669485843] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:05:54,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:05:54,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:05:54,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898683839] [2023-08-27 10:05:54,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:05:54,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:05:54,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:05:54,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:05:54,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:05:54,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 266 [2023-08-27 10:05:54,932 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-27 10:05:54,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:05:54,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 266 [2023-08-27 10:05:54,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:05:57,889 INFO L124 PetriNetUnfolderBase]: 17817/26998 cut-off events. [2023-08-27 10:05:57,889 INFO L125 PetriNetUnfolderBase]: For 211048/211048 co-relation queries the response was YES. [2023-08-27 10:05:58,090 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-27 10:05:58,119 INFO L140 encePairwiseOnDemand]: 255/266 looper letters, 96 selfloop transitions, 27 changer transitions 186/309 dead transitions. [2023-08-27 10:05:58,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 309 transitions, 4058 flow [2023-08-27 10:05:58,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:05:58,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:05:58,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 718 transitions. [2023-08-27 10:05:58,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.449874686716792 [2023-08-27 10:05:58,122 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 718 transitions. [2023-08-27 10:05:58,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 718 transitions. [2023-08-27 10:05:58,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:05:58,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 718 transitions. [2023-08-27 10:05:58,124 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-27 10:05:58,126 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-27 10:05:58,127 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-27 10:05:58,127 INFO L175 Difference]: Start difference. First operand has 109 places, 136 transitions, 1665 flow. Second operand 6 states and 718 transitions. [2023-08-27 10:05:58,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 309 transitions, 4058 flow [2023-08-27 10:06:01,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 309 transitions, 3429 flow, removed 86 selfloop flow, removed 16 redundant places. [2023-08-27 10:06:01,372 INFO L231 Difference]: Finished difference. Result has 96 places, 82 transitions, 846 flow [2023-08-27 10:06:01,372 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-27 10:06:01,373 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 44 predicate places. [2023-08-27 10:06:01,373 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 82 transitions, 846 flow [2023-08-27 10:06:01,373 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-27 10:06:01,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:06:01,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:06:01,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 10:06:01,373 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:06:01,374 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:06:01,374 INFO L85 PathProgramCache]: Analyzing trace with hash 2031730524, now seen corresponding path program 2 times [2023-08-27 10:06:01,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:06:01,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898552110] [2023-08-27 10:06:01,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:06:01,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:06:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:06:02,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:06:02,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:06:02,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898552110] [2023-08-27 10:06:02,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898552110] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:06:02,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:06:02,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 10:06:02,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134749727] [2023-08-27 10:06:02,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:06:02,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 10:06:02,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:06:02,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 10:06:02,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-27 10:06:02,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 266 [2023-08-27 10:06:02,110 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-27 10:06:02,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:06:02,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 266 [2023-08-27 10:06:02,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:06:02,671 INFO L124 PetriNetUnfolderBase]: 2359/4123 cut-off events. [2023-08-27 10:06:02,672 INFO L125 PetriNetUnfolderBase]: For 18555/18681 co-relation queries the response was YES. [2023-08-27 10:06:02,685 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-27 10:06:02,694 INFO L140 encePairwiseOnDemand]: 260/266 looper letters, 75 selfloop transitions, 11 changer transitions 42/145 dead transitions. [2023-08-27 10:06:02,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 145 transitions, 1469 flow [2023-08-27 10:06:02,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:06:02,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:06:02,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 821 transitions. [2023-08-27 10:06:02,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44092373791621914 [2023-08-27 10:06:02,696 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 821 transitions. [2023-08-27 10:06:02,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 821 transitions. [2023-08-27 10:06:02,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:06:02,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 821 transitions. [2023-08-27 10:06:02,698 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-27 10:06:02,700 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-27 10:06:02,700 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-27 10:06:02,701 INFO L175 Difference]: Start difference. First operand has 96 places, 82 transitions, 846 flow. Second operand 7 states and 821 transitions. [2023-08-27 10:06:02,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 145 transitions, 1469 flow [2023-08-27 10:06:02,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 145 transitions, 1300 flow, removed 33 selfloop flow, removed 12 redundant places. [2023-08-27 10:06:02,787 INFO L231 Difference]: Finished difference. Result has 84 places, 74 transitions, 642 flow [2023-08-27 10:06:02,788 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-27 10:06:02,788 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 32 predicate places. [2023-08-27 10:06:02,788 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 74 transitions, 642 flow [2023-08-27 10:06:02,789 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-27 10:06:02,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:06:02,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:06:02,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-27 10:06:02,789 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:06:02,789 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:06:02,789 INFO L85 PathProgramCache]: Analyzing trace with hash 586563820, now seen corresponding path program 3 times [2023-08-27 10:06:02,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:06:02,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581888359] [2023-08-27 10:06:02,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:06:02,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:06:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:06:02,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:06:02,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:06:02,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581888359] [2023-08-27 10:06:02,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581888359] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:06:02,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:06:02,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:06:02,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613034072] [2023-08-27 10:06:02,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:06:02,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:06:02,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:06:02,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:06:02,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:06:02,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 266 [2023-08-27 10:06:02,998 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-27 10:06:02,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:06:02,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 266 [2023-08-27 10:06:02,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:06:03,643 INFO L124 PetriNetUnfolderBase]: 3415/5658 cut-off events. [2023-08-27 10:06:03,643 INFO L125 PetriNetUnfolderBase]: For 22319/22319 co-relation queries the response was YES. [2023-08-27 10:06:03,655 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-27 10:06:03,659 INFO L140 encePairwiseOnDemand]: 260/266 looper letters, 61 selfloop transitions, 6 changer transitions 73/140 dead transitions. [2023-08-27 10:06:03,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 140 transitions, 1356 flow [2023-08-27 10:06:03,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:06:03,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:06:03,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2023-08-27 10:06:03,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.462406015037594 [2023-08-27 10:06:03,661 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 492 transitions. [2023-08-27 10:06:03,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 492 transitions. [2023-08-27 10:06:03,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:06:03,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 492 transitions. [2023-08-27 10:06:03,662 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-27 10:06:03,663 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-27 10:06:03,663 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-27 10:06:03,663 INFO L175 Difference]: Start difference. First operand has 84 places, 74 transitions, 642 flow. Second operand 4 states and 492 transitions. [2023-08-27 10:06:03,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 140 transitions, 1356 flow [2023-08-27 10:06:03,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 140 transitions, 1290 flow, removed 5 selfloop flow, removed 7 redundant places. [2023-08-27 10:06:03,754 INFO L231 Difference]: Finished difference. Result has 79 places, 51 transitions, 344 flow [2023-08-27 10:06:03,754 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-27 10:06:03,754 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 27 predicate places. [2023-08-27 10:06:03,754 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 51 transitions, 344 flow [2023-08-27 10:06:03,755 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-27 10:06:03,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:06:03,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:06:03,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-27 10:06:03,755 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:06:03,755 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:06:03,755 INFO L85 PathProgramCache]: Analyzing trace with hash -642081374, now seen corresponding path program 4 times [2023-08-27 10:06:03,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:06:03,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515366575] [2023-08-27 10:06:03,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:06:03,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:06:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:06:03,822 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 10:06:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:06:03,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 10:06:03,917 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 10:06:03,918 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (22 of 23 remaining) [2023-08-27 10:06:03,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (21 of 23 remaining) [2023-08-27 10:06:03,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2023-08-27 10:06:03,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2023-08-27 10:06:03,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2023-08-27 10:06:03,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2023-08-27 10:06:03,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2023-08-27 10:06:03,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 23 remaining) [2023-08-27 10:06:03,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2023-08-27 10:06:03,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2023-08-27 10:06:03,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2023-08-27 10:06:03,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2023-08-27 10:06:03,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2023-08-27 10:06:03,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2023-08-27 10:06:03,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (8 of 23 remaining) [2023-08-27 10:06:03,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2023-08-27 10:06:03,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 23 remaining) [2023-08-27 10:06:03,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2023-08-27 10:06:03,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2023-08-27 10:06:03,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2023-08-27 10:06:03,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 23 remaining) [2023-08-27 10:06:03,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2023-08-27 10:06:03,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2023-08-27 10:06:03,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-27 10:06:03,925 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:06:03,930 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 10:06:03,930 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 10:06:04,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 10:06:04 BasicIcfg [2023-08-27 10:06:04,030 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 10:06:04,031 INFO L158 Benchmark]: Toolchain (without parser) took 106153.35ms. Allocated memory was 354.4MB in the beginning and 11.5GB in the end (delta: 11.1GB). Free memory was 329.4MB in the beginning and 8.9GB in the end (delta: -8.6GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. [2023-08-27 10:06:04,031 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 354.4MB. Free memory is still 331.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 10:06:04,031 INFO L158 Benchmark]: CACSL2BoogieTranslator took 579.81ms. Allocated memory is still 354.4MB. Free memory was 329.0MB in the beginning and 305.0MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 10:06:04,031 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.10ms. Allocated memory is still 354.4MB. Free memory was 305.0MB in the beginning and 302.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-27 10:06:04,031 INFO L158 Benchmark]: Boogie Preprocessor took 59.34ms. Allocated memory is still 354.4MB. Free memory was 302.1MB in the beginning and 300.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:06:04,032 INFO L158 Benchmark]: RCFGBuilder took 732.06ms. Allocated memory is still 354.4MB. Free memory was 300.0MB in the beginning and 314.4MB in the end (delta: -14.4MB). Peak memory consumption was 31.2MB. Max. memory is 16.0GB. [2023-08-27 10:06:04,032 INFO L158 Benchmark]: TraceAbstraction took 104710.98ms. Allocated memory was 354.4MB in the beginning and 11.5GB in the end (delta: 11.1GB). Free memory was 313.3MB in the beginning and 8.9GB in the end (delta: -8.6GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. [2023-08-27 10:06:04,033 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.16ms. Allocated memory is still 354.4MB. Free memory is still 331.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 579.81ms. Allocated memory is still 354.4MB. Free memory was 329.0MB in the beginning and 305.0MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 66.10ms. Allocated memory is still 354.4MB. Free memory was 305.0MB in the beginning and 302.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 59.34ms. Allocated memory is still 354.4MB. Free memory was 302.1MB in the beginning and 300.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 732.06ms. Allocated memory is still 354.4MB. Free memory was 300.0MB in the beginning and 314.4MB in the end (delta: -14.4MB). Peak memory consumption was 31.2MB. Max. memory is 16.0GB. * TraceAbstraction took 104710.98ms. Allocated memory was 354.4MB in the beginning and 11.5GB in the end (delta: 11.1GB). Free memory was 313.3MB in the beginning and 8.9GB in the end (delta: -8.6GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 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: 104.5s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 95.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 961 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 961 mSDsluCounter, 109 SdHoareTripleChecker+Invalid, 2.0s 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.1s 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-27 10:06:04,058 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...