/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 21:12:39,472 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 21:12:39,604 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 21:12:39,608 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 21:12:39,609 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 21:12:39,629 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 21:12:39,630 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 21:12:39,630 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 21:12:39,631 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 21:12:39,634 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 21:12:39,634 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 21:12:39,634 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 21:12:39,635 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 21:12:39,636 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 21:12:39,636 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 21:12:39,636 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 21:12:39,636 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 21:12:39,637 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 21:12:39,637 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 21:12:39,637 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 21:12:39,637 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 21:12:39,638 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 21:12:39,638 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 21:12:39,639 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 21:12:39,639 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 21:12:39,639 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 21:12:39,639 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 21:12:39,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:12:39,640 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 21:12:39,640 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 21:12:39,641 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 21:12:39,641 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 21:12:39,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 21:12:39,641 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 21:12:39,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 21:12:39,642 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-26 21:12:39,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 21:12:39,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 21:12:39,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 21:12:39,982 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 21:12:39,982 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 21:12:39,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 21:12:41,277 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 21:12:41,585 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 21:12:41,585 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 21:12:41,601 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0103cecc/d48e45192e6d442aae2ccc961ca519b3/FLAGba392b66a [2023-08-26 21:12:41,614 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0103cecc/d48e45192e6d442aae2ccc961ca519b3 [2023-08-26 21:12:41,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 21:12:41,617 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 21:12:41,618 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 21:12:41,618 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 21:12:41,620 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 21:12:41,621 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:12:41" (1/1) ... [2023-08-26 21:12:41,622 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@413f7c1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:12:41, skipping insertion in model container [2023-08-26 21:12:41,622 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:12:41" (1/1) ... [2023-08-26 21:12:41,680 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 21:12:42,064 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:12:42,078 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 21:12:42,106 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:12:42,108 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:12:42,156 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:12:42,192 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:12:42,192 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:12:42,198 INFO L206 MainTranslator]: Completed translation [2023-08-26 21:12:42,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:12:42 WrapperNode [2023-08-26 21:12:42,200 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 21:12:42,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 21:12:42,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 21:12:42,202 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 21:12:42,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:12:42" (1/1) ... [2023-08-26 21:12:42,238 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:12:42" (1/1) ... [2023-08-26 21:12:42,272 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 154 [2023-08-26 21:12:42,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 21:12:42,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 21:12:42,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 21:12:42,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 21:12:42,280 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:12:42" (1/1) ... [2023-08-26 21:12:42,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:12:42" (1/1) ... [2023-08-26 21:12:42,285 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:12:42" (1/1) ... [2023-08-26 21:12:42,285 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:12:42" (1/1) ... [2023-08-26 21:12:42,296 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:12:42" (1/1) ... [2023-08-26 21:12:42,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:12:42" (1/1) ... [2023-08-26 21:12:42,300 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:12:42" (1/1) ... [2023-08-26 21:12:42,302 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:12:42" (1/1) ... [2023-08-26 21:12:42,305 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 21:12:42,306 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 21:12:42,306 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 21:12:42,306 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 21:12:42,306 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:12:42" (1/1) ... [2023-08-26 21:12:42,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:12:42,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 21:12:42,344 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 21:12:42,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 21:12:42,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 21:12:42,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 21:12:42,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 21:12:42,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 21:12:42,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 21:12:42,377 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 21:12:42,377 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 21:12:42,377 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 21:12:42,377 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 21:12:42,377 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 21:12:42,377 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 21:12:42,377 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 21:12:42,377 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 21:12:42,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 21:12:42,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 21:12:42,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 21:12:42,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 21:12:42,379 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 21:12:42,537 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 21:12:42,539 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 21:12:42,935 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 21:12:43,016 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 21:12:43,016 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 21:12:43,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:12:43 BoogieIcfgContainer [2023-08-26 21:12:43,018 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 21:12:43,020 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 21:12:43,020 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 21:12:43,023 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 21:12:43,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:12:41" (1/3) ... [2023-08-26 21:12:43,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a1213a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:12:43, skipping insertion in model container [2023-08-26 21:12:43,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:12:42" (2/3) ... [2023-08-26 21:12:43,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a1213a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:12:43, skipping insertion in model container [2023-08-26 21:12:43,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:12:43" (3/3) ... [2023-08-26 21:12:43,025 INFO L112 eAbstractionObserver]: Analyzing ICFG mix014_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 21:12:43,038 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 21:12:43,038 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 21:12:43,038 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 21:12:43,089 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 21:12:43,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 145 transitions, 310 flow [2023-08-26 21:12:43,164 INFO L124 PetriNetUnfolderBase]: 3/141 cut-off events. [2023-08-26 21:12:43,164 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:12:43,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 3/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 114 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-26 21:12:43,171 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 145 transitions, 310 flow [2023-08-26 21:12:43,175 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 141 transitions, 294 flow [2023-08-26 21:12:43,178 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 21:12:43,185 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 141 transitions, 294 flow [2023-08-26 21:12:43,188 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 141 transitions, 294 flow [2023-08-26 21:12:43,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 141 transitions, 294 flow [2023-08-26 21:12:43,214 INFO L124 PetriNetUnfolderBase]: 3/141 cut-off events. [2023-08-26 21:12:43,214 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:12:43,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 3/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 114 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-26 21:12:43,218 INFO L119 LiptonReduction]: Number of co-enabled transitions 4696 [2023-08-26 21:12:47,645 INFO L134 LiptonReduction]: Checked pairs total: 19688 [2023-08-26 21:12:47,646 INFO L136 LiptonReduction]: Total number of compositions: 121 [2023-08-26 21:12:47,658 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 21:12:47,663 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;@53920ae1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 21:12:47,663 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-26 21:12:47,665 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 21:12:47,666 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-26 21:12:47,666 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:12:47,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:12:47,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 21:12:47,667 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:12:47,671 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:12:47,671 INFO L85 PathProgramCache]: Analyzing trace with hash 633680, now seen corresponding path program 1 times [2023-08-26 21:12:47,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:12:47,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622570908] [2023-08-26 21:12:47,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:12:47,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:12:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:12:48,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:12:48,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:12:48,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622570908] [2023-08-26 21:12:48,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622570908] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:12:48,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:12:48,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:12:48,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599548312] [2023-08-26 21:12:48,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:12:48,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:12:48,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:12:48,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:12:48,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:12:48,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 266 [2023-08-26 21:12:48,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:12:48,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:12:48,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 266 [2023-08-26 21:12:48,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:12:50,087 INFO L124 PetriNetUnfolderBase]: 12064/17895 cut-off events. [2023-08-26 21:12:50,088 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2023-08-26 21:12:50,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34338 conditions, 17895 events. 12064/17895 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 859. Compared 123983 event pairs, 1764 based on Foata normal form. 0/14070 useless extension candidates. Maximal degree in co-relation 34326. Up to 13549 conditions per place. [2023-08-26 21:12:50,227 INFO L140 encePairwiseOnDemand]: 262/266 looper letters, 50 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-08-26 21:12:50,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 61 transitions, 247 flow [2023-08-26 21:12:50,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:12:50,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:12:50,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-08-26 21:12:50,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5200501253132832 [2023-08-26 21:12:50,240 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-08-26 21:12:50,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-08-26 21:12:50,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:12:50,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-08-26 21:12:50,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:12:50,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:12:50,253 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:12:50,254 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 3 states and 415 transitions. [2023-08-26 21:12:50,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 61 transitions, 247 flow [2023-08-26 21:12:50,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 240 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 21:12:50,261 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 88 flow [2023-08-26 21:12:50,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2023-08-26 21:12:50,265 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2023-08-26 21:12:50,266 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 88 flow [2023-08-26 21:12:50,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:12:50,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:12:50,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 21:12:50,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 21:12:50,267 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:12:50,267 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:12:50,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1698566384, now seen corresponding path program 1 times [2023-08-26 21:12:50,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:12:50,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998038314] [2023-08-26 21:12:50,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:12:50,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:12:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:12:50,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:12:50,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:12:50,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998038314] [2023-08-26 21:12:50,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998038314] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:12:50,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:12:50,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:12:50,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063947693] [2023-08-26 21:12:50,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:12:50,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:12:50,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:12:50,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:12:50,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:12:50,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 266 [2023-08-26 21:12:50,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:12:50,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:12:50,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 266 [2023-08-26 21:12:50,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:12:52,007 INFO L124 PetriNetUnfolderBase]: 12064/16198 cut-off events. [2023-08-26 21:12:52,008 INFO L125 PetriNetUnfolderBase]: For 811/811 co-relation queries the response was YES. [2023-08-26 21:12:52,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33451 conditions, 16198 events. 12064/16198 cut-off events. For 811/811 co-relation queries the response was YES. Maximal size of possible extension queue 714. Compared 86489 event pairs, 12064 based on Foata normal form. 0/12265 useless extension candidates. Maximal degree in co-relation 33441. Up to 16125 conditions per place. [2023-08-26 21:12:52,114 INFO L140 encePairwiseOnDemand]: 261/266 looper letters, 28 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2023-08-26 21:12:52,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 34 transitions, 138 flow [2023-08-26 21:12:52,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:12:52,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:12:52,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2023-08-26 21:12:52,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2023-08-26 21:12:52,118 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2023-08-26 21:12:52,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2023-08-26 21:12:52,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:12:52,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2023-08-26 21:12:52,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:12:52,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:12:52,122 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:12:52,122 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 88 flow. Second operand 3 states and 378 transitions. [2023-08-26 21:12:52,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 34 transitions, 138 flow [2023-08-26 21:12:52,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 34 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:12:52,124 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 78 flow [2023-08-26 21:12:52,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2023-08-26 21:12:52,124 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -7 predicate places. [2023-08-26 21:12:52,125 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 78 flow [2023-08-26 21:12:52,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:12:52,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:12:52,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 21:12:52,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 21:12:52,126 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:12:52,126 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:12:52,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1698566385, now seen corresponding path program 1 times [2023-08-26 21:12:52,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:12:52,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887657212] [2023-08-26 21:12:52,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:12:52,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:12:52,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:12:52,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:12:52,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:12:52,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887657212] [2023-08-26 21:12:52,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887657212] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:12:52,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:12:52,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:12:52,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072420588] [2023-08-26 21:12:52,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:12:52,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:12:52,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:12:52,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:12:52,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:12:52,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 266 [2023-08-26 21:12:52,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:12:52,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:12:52,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 266 [2023-08-26 21:12:52,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:12:53,025 INFO L124 PetriNetUnfolderBase]: 7784/10744 cut-off events. [2023-08-26 21:12:53,025 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:12:53,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21665 conditions, 10744 events. 7784/10744 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 58578 event pairs, 2133 based on Foata normal form. 0/8738 useless extension candidates. Maximal degree in co-relation 21659. Up to 8563 conditions per place. [2023-08-26 21:12:53,083 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 47 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2023-08-26 21:12:53,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 57 transitions, 234 flow [2023-08-26 21:12:53,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:12:53,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:12:53,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2023-08-26 21:12:53,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5025062656641605 [2023-08-26 21:12:53,085 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions. [2023-08-26 21:12:53,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions. [2023-08-26 21:12:53,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:12:53,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions. [2023-08-26 21:12:53,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:12:53,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:12:53,088 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:12:53,088 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 78 flow. Second operand 3 states and 401 transitions. [2023-08-26 21:12:53,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 57 transitions, 234 flow [2023-08-26 21:12:53,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 233 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:12:53,090 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 116 flow [2023-08-26 21:12:53,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-08-26 21:12:53,091 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2023-08-26 21:12:53,091 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 116 flow [2023-08-26 21:12:53,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:12:53,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:12:53,092 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:12:53,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 21:12:53,092 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:12:53,092 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:12:53,092 INFO L85 PathProgramCache]: Analyzing trace with hash -266747735, now seen corresponding path program 1 times [2023-08-26 21:12:53,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:12:53,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586790384] [2023-08-26 21:12:53,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:12:53,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:12:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:12:53,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:12:53,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:12:53,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586790384] [2023-08-26 21:12:53,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586790384] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:12:53,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:12:53,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:12:53,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060804257] [2023-08-26 21:12:53,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:12:53,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:12:53,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:12:53,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:12:53,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:12:53,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 266 [2023-08-26 21:12:53,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:12:53,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:12:53,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 266 [2023-08-26 21:12:53,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:12:56,319 INFO L124 PetriNetUnfolderBase]: 31695/43232 cut-off events. [2023-08-26 21:12:56,319 INFO L125 PetriNetUnfolderBase]: For 3956/3956 co-relation queries the response was YES. [2023-08-26 21:12:56,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102040 conditions, 43232 events. 31695/43232 cut-off events. For 3956/3956 co-relation queries the response was YES. Maximal size of possible extension queue 1161. Compared 246798 event pairs, 11983 based on Foata normal form. 0/37824 useless extension candidates. Maximal degree in co-relation 102032. Up to 27567 conditions per place. [2023-08-26 21:12:56,575 INFO L140 encePairwiseOnDemand]: 256/266 looper letters, 62 selfloop transitions, 9 changer transitions 0/71 dead transitions. [2023-08-26 21:12:56,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 71 transitions, 356 flow [2023-08-26 21:12:56,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:12:56,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:12:56,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-08-26 21:12:56,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48621553884711777 [2023-08-26 21:12:56,577 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-08-26 21:12:56,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-08-26 21:12:56,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:12:56,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-08-26 21:12:56,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:12:56,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:12:56,581 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:12:56,581 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 116 flow. Second operand 3 states and 388 transitions. [2023-08-26 21:12:56,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 71 transitions, 356 flow [2023-08-26 21:12:56,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 71 transitions, 347 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:12:56,587 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 181 flow [2023-08-26 21:12:56,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2023-08-26 21:12:56,589 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2023-08-26 21:12:56,589 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 181 flow [2023-08-26 21:12:56,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:12:56,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:12:56,590 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:12:56,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 21:12:56,590 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:12:56,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:12:56,590 INFO L85 PathProgramCache]: Analyzing trace with hash 320752489, now seen corresponding path program 1 times [2023-08-26 21:12:56,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:12:56,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703566498] [2023-08-26 21:12:56,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:12:56,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:12:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:12:56,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:12:56,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:12:56,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703566498] [2023-08-26 21:12:56,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703566498] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:12:56,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:12:56,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:12:56,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315727492] [2023-08-26 21:12:56,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:12:56,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:12:56,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:12:56,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:12:56,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:12:56,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 266 [2023-08-26 21:12:56,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:12:56,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:12:56,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 266 [2023-08-26 21:12:56,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:12:59,467 INFO L124 PetriNetUnfolderBase]: 23721/33644 cut-off events. [2023-08-26 21:12:59,467 INFO L125 PetriNetUnfolderBase]: For 13058/13257 co-relation queries the response was YES. [2023-08-26 21:12:59,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89469 conditions, 33644 events. 23721/33644 cut-off events. For 13058/13257 co-relation queries the response was YES. Maximal size of possible extension queue 1150. Compared 209668 event pairs, 7261 based on Foata normal form. 234/29345 useless extension candidates. Maximal degree in co-relation 89458. Up to 24225 conditions per place. [2023-08-26 21:12:59,656 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 55 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2023-08-26 21:12:59,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 66 transitions, 367 flow [2023-08-26 21:12:59,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:12:59,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:12:59,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2023-08-26 21:12:59,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5012531328320802 [2023-08-26 21:12:59,658 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 400 transitions. [2023-08-26 21:12:59,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 400 transitions. [2023-08-26 21:12:59,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:12:59,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 400 transitions. [2023-08-26 21:12:59,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:12:59,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:12:59,661 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:12:59,661 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 181 flow. Second operand 3 states and 400 transitions. [2023-08-26 21:12:59,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 66 transitions, 367 flow [2023-08-26 21:12:59,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 66 transitions, 345 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:12:59,759 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 174 flow [2023-08-26 21:12:59,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2023-08-26 21:12:59,760 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2023-08-26 21:12:59,760 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 174 flow [2023-08-26 21:12:59,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:12:59,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:12:59,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:12:59,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 21:12:59,761 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:12:59,761 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:12:59,761 INFO L85 PathProgramCache]: Analyzing trace with hash 601715304, now seen corresponding path program 1 times [2023-08-26 21:12:59,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:12:59,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101260581] [2023-08-26 21:12:59,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:12:59,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:12:59,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:12:59,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:12:59,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:12:59,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101260581] [2023-08-26 21:12:59,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101260581] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:12:59,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:12:59,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:12:59,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528746723] [2023-08-26 21:12:59,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:12:59,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:12:59,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:12:59,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:12:59,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:12:59,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 266 [2023-08-26 21:12:59,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:12:59,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:12:59,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 266 [2023-08-26 21:12:59,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:01,904 INFO L124 PetriNetUnfolderBase]: 16574/23569 cut-off events. [2023-08-26 21:13:01,904 INFO L125 PetriNetUnfolderBase]: For 7435/7925 co-relation queries the response was YES. [2023-08-26 21:13:01,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59940 conditions, 23569 events. 16574/23569 cut-off events. For 7435/7925 co-relation queries the response was YES. Maximal size of possible extension queue 1027. Compared 148876 event pairs, 4368 based on Foata normal form. 12/21797 useless extension candidates. Maximal degree in co-relation 59928. Up to 8994 conditions per place. [2023-08-26 21:13:02,064 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 73 selfloop transitions, 9 changer transitions 0/92 dead transitions. [2023-08-26 21:13:02,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 92 transitions, 480 flow [2023-08-26 21:13:02,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:13:02,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:13:02,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 537 transitions. [2023-08-26 21:13:02,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5046992481203008 [2023-08-26 21:13:02,067 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 537 transitions. [2023-08-26 21:13:02,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 537 transitions. [2023-08-26 21:13:02,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:02,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 537 transitions. [2023-08-26 21:13:02,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:02,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:02,073 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:02,073 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 174 flow. Second operand 4 states and 537 transitions. [2023-08-26 21:13:02,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 92 transitions, 480 flow [2023-08-26 21:13:02,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 92 transitions, 474 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:13:02,082 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 226 flow [2023-08-26 21:13:02,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2023-08-26 21:13:02,083 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2023-08-26 21:13:02,083 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 226 flow [2023-08-26 21:13:02,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:02,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:02,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:02,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 21:13:02,084 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:13:02,085 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:02,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1574480640, now seen corresponding path program 1 times [2023-08-26 21:13:02,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:02,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14962300] [2023-08-26 21:13:02,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:02,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:02,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:13:02,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:02,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14962300] [2023-08-26 21:13:02,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14962300] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:02,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:02,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:13:02,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100367075] [2023-08-26 21:13:02,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:02,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:13:02,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:02,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:13:02,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:13:02,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 266 [2023-08-26 21:13:02,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:02,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:02,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 266 [2023-08-26 21:13:02,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:03,931 INFO L124 PetriNetUnfolderBase]: 16462/23641 cut-off events. [2023-08-26 21:13:03,931 INFO L125 PetriNetUnfolderBase]: For 19424/19679 co-relation queries the response was YES. [2023-08-26 21:13:03,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66791 conditions, 23641 events. 16462/23641 cut-off events. For 19424/19679 co-relation queries the response was YES. Maximal size of possible extension queue 895. Compared 147511 event pairs, 4717 based on Foata normal form. 227/22544 useless extension candidates. Maximal degree in co-relation 66778. Up to 14890 conditions per place. [2023-08-26 21:13:04,063 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 67 selfloop transitions, 3 changer transitions 0/78 dead transitions. [2023-08-26 21:13:04,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 78 transitions, 488 flow [2023-08-26 21:13:04,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:13:04,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:13:04,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions. [2023-08-26 21:13:04,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075187969924813 [2023-08-26 21:13:04,064 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 405 transitions. [2023-08-26 21:13:04,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 405 transitions. [2023-08-26 21:13:04,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:04,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 405 transitions. [2023-08-26 21:13:04,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:04,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:04,067 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:04,067 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 226 flow. Second operand 3 states and 405 transitions. [2023-08-26 21:13:04,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 78 transitions, 488 flow [2023-08-26 21:13:04,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 78 transitions, 458 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-26 21:13:04,077 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 219 flow [2023-08-26 21:13:04,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=219, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2023-08-26 21:13:04,078 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2023-08-26 21:13:04,078 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 219 flow [2023-08-26 21:13:04,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:04,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:04,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:04,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 21:13:04,079 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:13:04,079 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:04,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1039519169, now seen corresponding path program 1 times [2023-08-26 21:13:04,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:04,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360550733] [2023-08-26 21:13:04,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:04,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:04,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:13:04,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:04,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360550733] [2023-08-26 21:13:04,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360550733] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:04,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:04,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:13:04,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105964689] [2023-08-26 21:13:04,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:04,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:13:04,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:04,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:13:04,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:13:04,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 266 [2023-08-26 21:13:04,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 219 flow. Second operand has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:04,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:04,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 266 [2023-08-26 21:13:04,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:05,557 INFO L124 PetriNetUnfolderBase]: 12167/18321 cut-off events. [2023-08-26 21:13:05,557 INFO L125 PetriNetUnfolderBase]: For 8272/8436 co-relation queries the response was YES. [2023-08-26 21:13:05,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49237 conditions, 18321 events. 12167/18321 cut-off events. For 8272/8436 co-relation queries the response was YES. Maximal size of possible extension queue 786. Compared 121303 event pairs, 2304 based on Foata normal form. 1232/18242 useless extension candidates. Maximal degree in co-relation 49223. Up to 12187 conditions per place. [2023-08-26 21:13:05,684 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 86 selfloop transitions, 10 changer transitions 0/106 dead transitions. [2023-08-26 21:13:05,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 106 transitions, 609 flow [2023-08-26 21:13:05,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:13:05,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:13:05,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 636 transitions. [2023-08-26 21:13:05,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4781954887218045 [2023-08-26 21:13:05,686 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 636 transitions. [2023-08-26 21:13:05,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 636 transitions. [2023-08-26 21:13:05,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:05,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 636 transitions. [2023-08-26 21:13:05,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:05,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:05,690 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:05,690 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 219 flow. Second operand 5 states and 636 transitions. [2023-08-26 21:13:05,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 106 transitions, 609 flow [2023-08-26 21:13:05,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 106 transitions, 603 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:13:05,697 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 280 flow [2023-08-26 21:13:05,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=280, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2023-08-26 21:13:05,698 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2023-08-26 21:13:05,698 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 280 flow [2023-08-26 21:13:05,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:05,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:05,699 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] [2023-08-26 21:13:05,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 21:13:05,699 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:13:05,699 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:05,699 INFO L85 PathProgramCache]: Analyzing trace with hash 2060569219, now seen corresponding path program 1 times [2023-08-26 21:13:05,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:05,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962925419] [2023-08-26 21:13:05,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:05,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:05,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:05,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:13:05,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:05,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962925419] [2023-08-26 21:13:05,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962925419] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:05,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:05,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:13:05,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743938338] [2023-08-26 21:13:05,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:05,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:13:05,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:05,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:13:05,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:13:05,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 266 [2023-08-26 21:13:05,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 55 transitions, 280 flow. Second operand has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:05,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:05,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 266 [2023-08-26 21:13:05,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:07,056 INFO L124 PetriNetUnfolderBase]: 8881/13920 cut-off events. [2023-08-26 21:13:07,056 INFO L125 PetriNetUnfolderBase]: For 13384/13447 co-relation queries the response was YES. [2023-08-26 21:13:07,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42287 conditions, 13920 events. 8881/13920 cut-off events. For 13384/13447 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 94255 event pairs, 1522 based on Foata normal form. 822/13516 useless extension candidates. Maximal degree in co-relation 42270. Up to 4277 conditions per place. [2023-08-26 21:13:07,143 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 104 selfloop transitions, 19 changer transitions 0/133 dead transitions. [2023-08-26 21:13:07,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 133 transitions, 774 flow [2023-08-26 21:13:07,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:13:07,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:13:07,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 889 transitions. [2023-08-26 21:13:07,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4774436090225564 [2023-08-26 21:13:07,146 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 889 transitions. [2023-08-26 21:13:07,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 889 transitions. [2023-08-26 21:13:07,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:07,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 889 transitions. [2023-08-26 21:13:07,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.0) internal successors, (889), 7 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:07,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:07,152 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:07,152 INFO L175 Difference]: Start difference. First operand has 59 places, 55 transitions, 280 flow. Second operand 7 states and 889 transitions. [2023-08-26 21:13:07,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 133 transitions, 774 flow [2023-08-26 21:13:07,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 133 transitions, 760 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:13:07,361 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 352 flow [2023-08-26 21:13:07,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=352, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2023-08-26 21:13:07,362 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2023-08-26 21:13:07,362 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 352 flow [2023-08-26 21:13:07,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:07,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:07,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:07,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 21:13:07,363 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:13:07,363 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:07,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1250045487, now seen corresponding path program 1 times [2023-08-26 21:13:07,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:07,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256575801] [2023-08-26 21:13:07,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:07,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:07,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:13:07,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:07,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256575801] [2023-08-26 21:13:07,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256575801] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:07,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:07,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:13:07,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338137526] [2023-08-26 21:13:07,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:07,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:13:07,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:07,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:13:07,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:13:07,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 266 [2023-08-26 21:13:07,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 352 flow. Second operand has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:07,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:07,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 266 [2023-08-26 21:13:07,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:08,688 INFO L124 PetriNetUnfolderBase]: 7939/12272 cut-off events. [2023-08-26 21:13:08,688 INFO L125 PetriNetUnfolderBase]: For 19713/19772 co-relation queries the response was YES. [2023-08-26 21:13:08,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41381 conditions, 12272 events. 7939/12272 cut-off events. For 19713/19772 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 80323 event pairs, 1786 based on Foata normal form. 6/11802 useless extension candidates. Maximal degree in co-relation 41361. Up to 4359 conditions per place. [2023-08-26 21:13:08,773 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 83 selfloop transitions, 21 changer transitions 0/114 dead transitions. [2023-08-26 21:13:08,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 114 transitions, 742 flow [2023-08-26 21:13:08,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:13:08,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:13:08,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 665 transitions. [2023-08-26 21:13:08,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-26 21:13:08,776 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 665 transitions. [2023-08-26 21:13:08,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 665 transitions. [2023-08-26 21:13:08,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:08,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 665 transitions. [2023-08-26 21:13:08,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:08,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:08,780 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:08,780 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 352 flow. Second operand 5 states and 665 transitions. [2023-08-26 21:13:08,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 114 transitions, 742 flow [2023-08-26 21:13:09,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 114 transitions, 708 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-26 21:13:09,026 INFO L231 Difference]: Finished difference. Result has 67 places, 64 transitions, 412 flow [2023-08-26 21:13:09,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=412, PETRI_PLACES=67, PETRI_TRANSITIONS=64} [2023-08-26 21:13:09,027 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 15 predicate places. [2023-08-26 21:13:09,027 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 412 flow [2023-08-26 21:13:09,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:09,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:09,027 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:09,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 21:13:09,028 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:13:09,028 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:09,028 INFO L85 PathProgramCache]: Analyzing trace with hash -310582825, now seen corresponding path program 1 times [2023-08-26 21:13:09,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:09,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643049066] [2023-08-26 21:13:09,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:09,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:09,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:13:09,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:09,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643049066] [2023-08-26 21:13:09,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643049066] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:09,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:09,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:13:09,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846797963] [2023-08-26 21:13:09,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:09,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:13:09,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:09,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:13:09,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:13:09,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 266 [2023-08-26 21:13:09,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 412 flow. Second operand has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:09,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:09,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 266 [2023-08-26 21:13:09,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:10,373 INFO L124 PetriNetUnfolderBase]: 7005/10815 cut-off events. [2023-08-26 21:13:10,373 INFO L125 PetriNetUnfolderBase]: For 20162/20222 co-relation queries the response was YES. [2023-08-26 21:13:10,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37458 conditions, 10815 events. 7005/10815 cut-off events. For 20162/20222 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 70790 event pairs, 866 based on Foata normal form. 242/10673 useless extension candidates. Maximal degree in co-relation 37437. Up to 2616 conditions per place. [2023-08-26 21:13:10,442 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 124 selfloop transitions, 28 changer transitions 4/166 dead transitions. [2023-08-26 21:13:10,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 166 transitions, 1076 flow [2023-08-26 21:13:10,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 21:13:10,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 21:13:10,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1140 transitions. [2023-08-26 21:13:10,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2023-08-26 21:13:10,445 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1140 transitions. [2023-08-26 21:13:10,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1140 transitions. [2023-08-26 21:13:10,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:10,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1140 transitions. [2023-08-26 21:13:10,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 126.66666666666667) internal successors, (1140), 9 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:10,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 266.0) internal successors, (2660), 10 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:10,452 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 266.0) internal successors, (2660), 10 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:10,452 INFO L175 Difference]: Start difference. First operand has 67 places, 64 transitions, 412 flow. Second operand 9 states and 1140 transitions. [2023-08-26 21:13:10,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 166 transitions, 1076 flow [2023-08-26 21:13:11,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 166 transitions, 1010 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-08-26 21:13:11,049 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 472 flow [2023-08-26 21:13:11,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=472, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2023-08-26 21:13:11,050 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2023-08-26 21:13:11,050 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 472 flow [2023-08-26 21:13:11,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:11,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:11,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:11,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 21:13:11,051 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:13:11,051 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:11,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1091499557, now seen corresponding path program 1 times [2023-08-26 21:13:11,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:11,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615048146] [2023-08-26 21:13:11,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:11,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:12,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:13:12,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:12,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615048146] [2023-08-26 21:13:12,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615048146] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:12,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:12,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:13:12,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631121095] [2023-08-26 21:13:12,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:12,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:13:12,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:12,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:13:12,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:13:12,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 266 [2023-08-26 21:13:12,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 472 flow. Second operand has 7 states, 7 states have (on average 117.0) internal successors, (819), 7 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:12,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:12,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 266 [2023-08-26 21:13:12,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:13,687 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse10 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse7)) (.cse4 (and .cse7 .cse10)) (.cse11 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse0 (or .cse3 .cse4 .cse11)) (.cse1 (and .cse8 (not .cse11))) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse6 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse3 .cse4 .cse5) v_~a$w_buff1_used~0_133 0))) (= v_~a$flush_delayed~0_25 0) (= (ite .cse2 v_~a$w_buff0_used~0_148 (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse1 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~a$r_buff0_thd4~0_62 (ite (and (not .cse5) .cse8) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse9 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse9 .cse10) (and .cse6 .cse9) .cse5)) v_~a$r_buff1_thd4~0_60 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~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_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, 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][79], [Black: 190#(= ~__unbuffered_p1_EAX~0 0), 247#(and (<= 0 ~a$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), 164#(<= 0 ~__unbuffered_cnt~0), 104#L811true, Black: 195#(= ~__unbuffered_cnt~0 0), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 196#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 101#L847true, P3Thread1of1ForFork0InUse, Black: 206#(<= ~__unbuffered_cnt~0 1), Black: 207#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, Black: 220#(<= ~__unbuffered_cnt~0 2), 232#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 120#P0EXITtrue, Black: 168#(<= ~__unbuffered_cnt~0 0), Black: 227#(<= ~__unbuffered_cnt~0 2), 97#L798true, Black: 234#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 228#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 173#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 179#(<= ~__unbuffered_p3_EAX~0 0), 64#L3true]) [2023-08-26 21:13:13,688 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2023-08-26 21:13:13,688 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-08-26 21:13:13,688 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-08-26 21:13:13,688 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-08-26 21:13:13,705 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse10 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse7)) (.cse4 (and .cse7 .cse10)) (.cse11 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse0 (or .cse3 .cse4 .cse11)) (.cse1 (and .cse8 (not .cse11))) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse6 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse3 .cse4 .cse5) v_~a$w_buff1_used~0_133 0))) (= v_~a$flush_delayed~0_25 0) (= (ite .cse2 v_~a$w_buff0_used~0_148 (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse1 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~a$r_buff0_thd4~0_62 (ite (and (not .cse5) .cse8) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse9 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse9 .cse10) (and .cse6 .cse9) .cse5)) v_~a$r_buff1_thd4~0_60 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~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_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, 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][79], [Black: 190#(= ~__unbuffered_p1_EAX~0 0), 247#(and (<= 0 ~a$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), 164#(<= 0 ~__unbuffered_cnt~0), 104#L811true, Black: 195#(= ~__unbuffered_cnt~0 0), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 101#L847true, Black: 206#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork0InUse, Black: 207#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 196#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 220#(<= ~__unbuffered_cnt~0 2), 232#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 120#P0EXITtrue, Black: 168#(<= ~__unbuffered_cnt~0 0), Black: 227#(<= ~__unbuffered_cnt~0 2), 97#L798true, Black: 234#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 228#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 173#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 179#(<= ~__unbuffered_p3_EAX~0 0), 64#L3true]) [2023-08-26 21:13:13,705 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2023-08-26 21:13:13,705 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-08-26 21:13:13,705 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-08-26 21:13:13,705 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-08-26 21:13:13,822 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse10 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse7)) (.cse4 (and .cse7 .cse10)) (.cse11 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse0 (or .cse3 .cse4 .cse11)) (.cse1 (and .cse8 (not .cse11))) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse6 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse3 .cse4 .cse5) v_~a$w_buff1_used~0_133 0))) (= v_~a$flush_delayed~0_25 0) (= (ite .cse2 v_~a$w_buff0_used~0_148 (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse1 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~a$r_buff0_thd4~0_62 (ite (and (not .cse5) .cse8) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse9 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse9 .cse10) (and .cse6 .cse9) .cse5)) v_~a$r_buff1_thd4~0_60 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~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_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, 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][79], [Black: 190#(= ~__unbuffered_p1_EAX~0 0), 220#(<= ~__unbuffered_cnt~0 2), 247#(and (<= 0 ~a$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), 164#(<= 0 ~__unbuffered_cnt~0), 104#L811true, Black: 195#(= ~__unbuffered_cnt~0 0), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 196#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 101#L847true, Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P3Thread1of1ForFork0InUse, Black: 206#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 120#P0EXITtrue, Black: 168#(<= ~__unbuffered_cnt~0 0), 100#P1EXITtrue, 234#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 227#(<= ~__unbuffered_cnt~0 2), Black: 228#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 173#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 179#(<= ~__unbuffered_p3_EAX~0 0), 64#L3true, 207#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 185#(<= ~__unbuffered_cnt~0 1)]) [2023-08-26 21:13:13,822 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is not cut-off event [2023-08-26 21:13:13,822 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-08-26 21:13:13,822 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-08-26 21:13:13,822 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-08-26 21:13:13,832 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse10 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse7)) (.cse4 (and .cse7 .cse10)) (.cse11 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse0 (or .cse3 .cse4 .cse11)) (.cse1 (and .cse8 (not .cse11))) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse6 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse3 .cse4 .cse5) v_~a$w_buff1_used~0_133 0))) (= v_~a$flush_delayed~0_25 0) (= (ite .cse2 v_~a$w_buff0_used~0_148 (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse1 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~a$r_buff0_thd4~0_62 (ite (and (not .cse5) .cse8) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse9 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse9 .cse10) (and .cse6 .cse9) .cse5)) v_~a$r_buff1_thd4~0_60 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~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_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, 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][79], [Black: 190#(= ~__unbuffered_p1_EAX~0 0), 220#(<= ~__unbuffered_cnt~0 2), 247#(and (<= 0 ~a$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), 164#(<= 0 ~__unbuffered_cnt~0), 104#L811true, Black: 195#(= ~__unbuffered_cnt~0 0), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 101#L847true, Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 206#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 196#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 120#P0EXITtrue, 100#P1EXITtrue, Black: 168#(<= ~__unbuffered_cnt~0 0), 234#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 227#(<= ~__unbuffered_cnt~0 2), Black: 228#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 173#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 179#(<= ~__unbuffered_p3_EAX~0 0), 64#L3true, 207#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 185#(<= ~__unbuffered_cnt~0 1)]) [2023-08-26 21:13:13,832 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is not cut-off event [2023-08-26 21:13:13,832 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-08-26 21:13:13,832 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-08-26 21:13:13,832 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-08-26 21:13:14,098 INFO L124 PetriNetUnfolderBase]: 12659/20218 cut-off events. [2023-08-26 21:13:14,098 INFO L125 PetriNetUnfolderBase]: For 51023/51562 co-relation queries the response was YES. [2023-08-26 21:13:14,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75194 conditions, 20218 events. 12659/20218 cut-off events. For 51023/51562 co-relation queries the response was YES. Maximal size of possible extension queue 1083. Compared 150240 event pairs, 1995 based on Foata normal form. 92/19677 useless extension candidates. Maximal degree in co-relation 75170. Up to 8265 conditions per place. [2023-08-26 21:13:14,272 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 223 selfloop transitions, 11 changer transitions 3/247 dead transitions. [2023-08-26 21:13:14,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 247 transitions, 2280 flow [2023-08-26 21:13:14,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:13:14,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:13:14,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 794 transitions. [2023-08-26 21:13:14,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4974937343358396 [2023-08-26 21:13:14,274 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 794 transitions. [2023-08-26 21:13:14,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 794 transitions. [2023-08-26 21:13:14,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:14,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 794 transitions. [2023-08-26 21:13:14,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 132.33333333333334) internal successors, (794), 6 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:14,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:14,278 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:14,279 INFO L175 Difference]: Start difference. First operand has 75 places, 69 transitions, 472 flow. Second operand 6 states and 794 transitions. [2023-08-26 21:13:14,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 247 transitions, 2280 flow [2023-08-26 21:13:16,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 247 transitions, 2040 flow, removed 10 selfloop flow, removed 6 redundant places. [2023-08-26 21:13:16,553 INFO L231 Difference]: Finished difference. Result has 77 places, 78 transitions, 509 flow [2023-08-26 21:13:16,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=509, PETRI_PLACES=77, PETRI_TRANSITIONS=78} [2023-08-26 21:13:16,554 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 25 predicate places. [2023-08-26 21:13:16,554 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 78 transitions, 509 flow [2023-08-26 21:13:16,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.0) internal successors, (819), 7 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:16,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:16,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:16,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 21:13:16,554 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:13:16,555 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:16,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1441714873, now seen corresponding path program 1 times [2023-08-26 21:13:16,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:16,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888618831] [2023-08-26 21:13:16,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:16,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:16,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:13:16,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:16,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888618831] [2023-08-26 21:13:16,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888618831] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:16,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:16,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:13:16,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913195866] [2023-08-26 21:13:16,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:16,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:13:16,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:16,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:13:16,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:13:16,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 266 [2023-08-26 21:13:16,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 78 transitions, 509 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:16,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:16,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 266 [2023-08-26 21:13:16,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:17,967 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse10 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse7)) (.cse4 (and .cse7 .cse10)) (.cse11 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse0 (or .cse3 .cse4 .cse11)) (.cse1 (and .cse8 (not .cse11))) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse6 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse3 .cse4 .cse5) v_~a$w_buff1_used~0_133 0))) (= v_~a$flush_delayed~0_25 0) (= (ite .cse2 v_~a$w_buff0_used~0_148 (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse1 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~a$r_buff0_thd4~0_62 (ite (and (not .cse5) .cse8) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse9 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse9 .cse10) (and .cse6 .cse9) .cse5)) v_~a$r_buff1_thd4~0_60 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~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_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, 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][62], [Black: 190#(= ~__unbuffered_p1_EAX~0 0), 247#(and (<= 0 ~a$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), 164#(<= 0 ~__unbuffered_cnt~0), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 196#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 101#L847true, Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P3Thread1of1ForFork0InUse, Black: 206#(<= ~__unbuffered_cnt~0 1), Black: 207#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, Black: 220#(<= ~__unbuffered_cnt~0 2), 254#(= ~x~0 1), 117#L818true, Black: 227#(<= ~__unbuffered_cnt~0 2), Black: 234#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 228#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 173#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 136#L791true, 195#(= ~__unbuffered_cnt~0 0), Black: 179#(<= ~__unbuffered_p3_EAX~0 0), 78#L878-3true, Black: 243#(and (<= 0 ~a$w_buff0_used~0) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), Black: 185#(<= ~__unbuffered_cnt~0 1), Black: 242#(and (<= 0 ~a$w_buff1_used~0) (<= ~a$w_buff1_used~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), 127#L775true]) [2023-08-26 21:13:17,967 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-26 21:13:17,967 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:13:17,967 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:13:17,967 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:13:18,212 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse10 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse7)) (.cse4 (and .cse7 .cse10)) (.cse11 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse0 (or .cse3 .cse4 .cse11)) (.cse1 (and .cse8 (not .cse11))) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse6 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse3 .cse4 .cse5) v_~a$w_buff1_used~0_133 0))) (= v_~a$flush_delayed~0_25 0) (= (ite .cse2 v_~a$w_buff0_used~0_148 (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse1 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~a$r_buff0_thd4~0_62 (ite (and (not .cse5) .cse8) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse9 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse9 .cse10) (and .cse6 .cse9) .cse5)) v_~a$r_buff1_thd4~0_60 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~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_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, 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][62], [Black: 190#(= ~__unbuffered_p1_EAX~0 0), 247#(and (<= 0 ~a$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), 164#(<= 0 ~__unbuffered_cnt~0), Black: 195#(= ~__unbuffered_cnt~0 0), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 196#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 101#L847true, Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P3Thread1of1ForFork0InUse, Black: 207#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 226#(<= ~__unbuffered_cnt~0 1), P1Thread1of1ForFork1InUse, Black: 220#(<= ~__unbuffered_cnt~0 2), 120#P0EXITtrue, Black: 168#(<= ~__unbuffered_cnt~0 0), 254#(= ~x~0 1), 117#L818true, Black: 227#(<= ~__unbuffered_cnt~0 2), Black: 234#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 228#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 173#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 136#L791true, Black: 179#(<= ~__unbuffered_p3_EAX~0 0), 78#L878-3true, Black: 243#(and (<= 0 ~a$w_buff0_used~0) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), Black: 242#(and (<= 0 ~a$w_buff1_used~0) (<= ~a$w_buff1_used~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1))]) [2023-08-26 21:13:18,213 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:13:18,213 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:13:18,213 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:13:18,213 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:13:18,252 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse10 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse7)) (.cse4 (and .cse7 .cse10)) (.cse11 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse0 (or .cse3 .cse4 .cse11)) (.cse1 (and .cse8 (not .cse11))) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse6 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse3 .cse4 .cse5) v_~a$w_buff1_used~0_133 0))) (= v_~a$flush_delayed~0_25 0) (= (ite .cse2 v_~a$w_buff0_used~0_148 (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse1 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~a$r_buff0_thd4~0_62 (ite (and (not .cse5) .cse8) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse9 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse9 .cse10) (and .cse6 .cse9) .cse5)) v_~a$r_buff1_thd4~0_60 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~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_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, 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][62], [Black: 190#(= ~__unbuffered_p1_EAX~0 0), 247#(and (<= 0 ~a$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), 164#(<= 0 ~__unbuffered_cnt~0), Black: 195#(= ~__unbuffered_cnt~0 0), Black: 196#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 209#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 101#L847true, Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 206#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork0InUse, Black: 207#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, Black: 220#(<= ~__unbuffered_cnt~0 2), 117#L818true, 254#(= ~x~0 1), Black: 227#(<= ~__unbuffered_cnt~0 2), Black: 234#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 228#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 136#L791true, Black: 173#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 179#(<= ~__unbuffered_p3_EAX~0 0), 64#L3true, Black: 243#(and (<= 0 ~a$w_buff0_used~0) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), Black: 185#(<= ~__unbuffered_cnt~0 1), Black: 242#(and (<= 0 ~a$w_buff1_used~0) (<= ~a$w_buff1_used~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), 127#L775true]) [2023-08-26 21:13:18,252 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:13:18,252 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:13:18,252 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:13:18,252 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:13:18,252 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse10 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse7)) (.cse4 (and .cse7 .cse10)) (.cse11 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse0 (or .cse3 .cse4 .cse11)) (.cse1 (and .cse8 (not .cse11))) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse6 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse3 .cse4 .cse5) v_~a$w_buff1_used~0_133 0))) (= v_~a$flush_delayed~0_25 0) (= (ite .cse2 v_~a$w_buff0_used~0_148 (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse1 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~a$r_buff0_thd4~0_62 (ite (and (not .cse5) .cse8) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse9 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse9 .cse10) (and .cse6 .cse9) .cse5)) v_~a$r_buff1_thd4~0_60 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~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_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, 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][62], [Black: 190#(= ~__unbuffered_p1_EAX~0 0), 247#(and (<= 0 ~a$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), 164#(<= 0 ~__unbuffered_cnt~0), Black: 195#(= ~__unbuffered_cnt~0 0), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 47#P2EXITtrue, Black: 196#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 101#L847true, Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P3Thread1of1ForFork0InUse, Black: 207#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 226#(<= ~__unbuffered_cnt~0 1), Black: 220#(<= ~__unbuffered_cnt~0 2), Black: 168#(<= ~__unbuffered_cnt~0 0), 254#(= ~x~0 1), Black: 227#(<= ~__unbuffered_cnt~0 2), Black: 234#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 228#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 136#L791true, Black: 173#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 179#(<= ~__unbuffered_p3_EAX~0 0), 78#L878-3true, Black: 243#(and (<= 0 ~a$w_buff0_used~0) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), Black: 242#(and (<= 0 ~a$w_buff1_used~0) (<= ~a$w_buff1_used~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), 127#L775true]) [2023-08-26 21:13:18,252 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:13:18,253 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:13:18,253 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:13:18,253 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:13:18,475 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse10 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse7)) (.cse4 (and .cse7 .cse10)) (.cse11 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse0 (or .cse3 .cse4 .cse11)) (.cse1 (and .cse8 (not .cse11))) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse6 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse3 .cse4 .cse5) v_~a$w_buff1_used~0_133 0))) (= v_~a$flush_delayed~0_25 0) (= (ite .cse2 v_~a$w_buff0_used~0_148 (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse1 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~a$r_buff0_thd4~0_62 (ite (and (not .cse5) .cse8) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse9 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse9 .cse10) (and .cse6 .cse9) .cse5)) v_~a$r_buff1_thd4~0_60 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~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_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, 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][62], [Black: 190#(= ~__unbuffered_p1_EAX~0 0), 247#(and (<= 0 ~a$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), 164#(<= 0 ~__unbuffered_cnt~0), Black: 195#(= ~__unbuffered_cnt~0 0), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 47#P2EXITtrue, Black: 196#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 101#L847true, Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 206#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork0InUse, Black: 207#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 120#P0EXITtrue, Black: 168#(<= ~__unbuffered_cnt~0 0), 254#(= ~x~0 1), Black: 234#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 228#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 173#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 136#L791true, 227#(<= ~__unbuffered_cnt~0 2), Black: 179#(<= ~__unbuffered_p3_EAX~0 0), 78#L878-3true, Black: 243#(and (<= 0 ~a$w_buff0_used~0) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), Black: 242#(and (<= 0 ~a$w_buff1_used~0) (<= ~a$w_buff1_used~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 185#(<= ~__unbuffered_cnt~0 1)]) [2023-08-26 21:13:18,475 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 21:13:18,475 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:13:18,475 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:13:18,475 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:13:18,476 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse10 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse7)) (.cse4 (and .cse7 .cse10)) (.cse11 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse0 (or .cse3 .cse4 .cse11)) (.cse1 (and .cse8 (not .cse11))) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse6 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse3 .cse4 .cse5) v_~a$w_buff1_used~0_133 0))) (= v_~a$flush_delayed~0_25 0) (= (ite .cse2 v_~a$w_buff0_used~0_148 (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse1 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~a$r_buff0_thd4~0_62 (ite (and (not .cse5) .cse8) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse9 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse9 .cse10) (and .cse6 .cse9) .cse5)) v_~a$r_buff1_thd4~0_60 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~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_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, 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][62], [Black: 190#(= ~__unbuffered_p1_EAX~0 0), 247#(and (<= 0 ~a$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), 164#(<= 0 ~__unbuffered_cnt~0), Black: 195#(= ~__unbuffered_cnt~0 0), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 196#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 101#L847true, P3Thread1of1ForFork0InUse, Black: 206#(<= ~__unbuffered_cnt~0 1), Black: 207#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, Black: 220#(<= ~__unbuffered_cnt~0 2), 232#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 120#P0EXITtrue, Black: 168#(<= ~__unbuffered_cnt~0 0), 117#L818true, 254#(= ~x~0 1), Black: 227#(<= ~__unbuffered_cnt~0 2), Black: 234#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 228#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 173#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 136#L791true, Black: 179#(<= ~__unbuffered_p3_EAX~0 0), Black: 243#(and (<= 0 ~a$w_buff0_used~0) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), 64#L3true, Black: 242#(and (<= 0 ~a$w_buff1_used~0) (<= ~a$w_buff1_used~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1))]) [2023-08-26 21:13:18,476 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 21:13:18,476 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:13:18,476 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:13:18,476 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:13:18,492 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse10 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse7)) (.cse4 (and .cse7 .cse10)) (.cse11 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse0 (or .cse3 .cse4 .cse11)) (.cse1 (and .cse8 (not .cse11))) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse6 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse3 .cse4 .cse5) v_~a$w_buff1_used~0_133 0))) (= v_~a$flush_delayed~0_25 0) (= (ite .cse2 v_~a$w_buff0_used~0_148 (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse1 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~a$r_buff0_thd4~0_62 (ite (and (not .cse5) .cse8) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse9 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse9 .cse10) (and .cse6 .cse9) .cse5)) v_~a$r_buff1_thd4~0_60 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~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_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, 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][62], [Black: 190#(= ~__unbuffered_p1_EAX~0 0), 247#(and (<= 0 ~a$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), 164#(<= 0 ~__unbuffered_cnt~0), Black: 195#(= ~__unbuffered_cnt~0 0), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 196#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 101#L847true, Black: 206#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork0InUse, Black: 207#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, Black: 220#(<= ~__unbuffered_cnt~0 2), 232#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 120#P0EXITtrue, Black: 168#(<= ~__unbuffered_cnt~0 0), 117#L818true, 254#(= ~x~0 1), Black: 227#(<= ~__unbuffered_cnt~0 2), Black: 234#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 228#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 173#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 136#L791true, Black: 179#(<= ~__unbuffered_p3_EAX~0 0), 64#L3true, Black: 243#(and (<= 0 ~a$w_buff0_used~0) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), Black: 242#(and (<= 0 ~a$w_buff1_used~0) (<= ~a$w_buff1_used~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1))]) [2023-08-26 21:13:18,492 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 21:13:18,492 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:13:18,492 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:13:18,493 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:13:18,493 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:13:18,508 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse10 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse7)) (.cse4 (and .cse7 .cse10)) (.cse11 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse0 (or .cse3 .cse4 .cse11)) (.cse1 (and .cse8 (not .cse11))) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse6 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse3 .cse4 .cse5) v_~a$w_buff1_used~0_133 0))) (= v_~a$flush_delayed~0_25 0) (= (ite .cse2 v_~a$w_buff0_used~0_148 (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse1 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~a$r_buff0_thd4~0_62 (ite (and (not .cse5) .cse8) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse9 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse9 .cse10) (and .cse6 .cse9) .cse5)) v_~a$r_buff1_thd4~0_60 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~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_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, 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][62], [Black: 190#(= ~__unbuffered_p1_EAX~0 0), 247#(and (<= 0 ~a$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), 164#(<= 0 ~__unbuffered_cnt~0), Black: 195#(= ~__unbuffered_cnt~0 0), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 101#L847true, Black: 206#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork0InUse, Black: 207#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 196#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 220#(<= ~__unbuffered_cnt~0 2), 232#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 120#P0EXITtrue, Black: 168#(<= ~__unbuffered_cnt~0 0), 117#L818true, 254#(= ~x~0 1), Black: 227#(<= ~__unbuffered_cnt~0 2), Black: 234#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 228#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 136#L791true, Black: 173#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 179#(<= ~__unbuffered_p3_EAX~0 0), 64#L3true, Black: 243#(and (<= 0 ~a$w_buff0_used~0) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), Black: 242#(and (<= 0 ~a$w_buff1_used~0) (<= ~a$w_buff1_used~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1))]) [2023-08-26 21:13:18,508 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 21:13:18,508 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:13:18,509 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:13:18,509 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:13:18,510 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse10 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse7)) (.cse4 (and .cse7 .cse10)) (.cse11 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse0 (or .cse3 .cse4 .cse11)) (.cse1 (and .cse8 (not .cse11))) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse6 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse3 .cse4 .cse5) v_~a$w_buff1_used~0_133 0))) (= v_~a$flush_delayed~0_25 0) (= (ite .cse2 v_~a$w_buff0_used~0_148 (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse1 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~a$r_buff0_thd4~0_62 (ite (and (not .cse5) .cse8) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse9 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse9 .cse10) (and .cse6 .cse9) .cse5)) v_~a$r_buff1_thd4~0_60 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~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_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, 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][62], [Black: 190#(= ~__unbuffered_p1_EAX~0 0), 247#(and (<= 0 ~a$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), 164#(<= 0 ~__unbuffered_cnt~0), Black: 195#(= ~__unbuffered_cnt~0 0), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 47#P2EXITtrue, Black: 196#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 101#L847true, P3Thread1of1ForFork0InUse, Black: 206#(<= ~__unbuffered_cnt~0 1), Black: 207#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, Black: 220#(<= ~__unbuffered_cnt~0 2), 232#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 168#(<= ~__unbuffered_cnt~0 0), 254#(= ~x~0 1), Black: 227#(<= ~__unbuffered_cnt~0 2), Black: 234#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 228#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 173#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 136#L791true, Black: 179#(<= ~__unbuffered_p3_EAX~0 0), Black: 243#(and (<= 0 ~a$w_buff0_used~0) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), 64#L3true, Black: 242#(and (<= 0 ~a$w_buff1_used~0) (<= ~a$w_buff1_used~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), 127#L775true]) [2023-08-26 21:13:18,510 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 21:13:18,510 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:13:18,510 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:13:18,510 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:13:18,539 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse10 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse7)) (.cse4 (and .cse7 .cse10)) (.cse11 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse0 (or .cse3 .cse4 .cse11)) (.cse1 (and .cse8 (not .cse11))) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse6 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse3 .cse4 .cse5) v_~a$w_buff1_used~0_133 0))) (= v_~a$flush_delayed~0_25 0) (= (ite .cse2 v_~a$w_buff0_used~0_148 (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse1 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~a$r_buff0_thd4~0_62 (ite (and (not .cse5) .cse8) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse9 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse9 .cse10) (and .cse6 .cse9) .cse5)) v_~a$r_buff1_thd4~0_60 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~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_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, 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][62], [Black: 190#(= ~__unbuffered_p1_EAX~0 0), 247#(and (<= 0 ~a$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), 164#(<= 0 ~__unbuffered_cnt~0), Black: 195#(= ~__unbuffered_cnt~0 0), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 47#P2EXITtrue, 101#L847true, Black: 206#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork0InUse, Black: 207#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 196#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 220#(<= ~__unbuffered_cnt~0 2), 232#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 168#(<= ~__unbuffered_cnt~0 0), 254#(= ~x~0 1), Black: 227#(<= ~__unbuffered_cnt~0 2), Black: 234#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 228#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 173#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 136#L791true, Black: 179#(<= ~__unbuffered_p3_EAX~0 0), Black: 243#(and (<= 0 ~a$w_buff0_used~0) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), 64#L3true, Black: 242#(and (<= 0 ~a$w_buff1_used~0) (<= ~a$w_buff1_used~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), 127#L775true]) [2023-08-26 21:13:18,540 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 21:13:18,540 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:13:18,540 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:13:18,540 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:13:18,541 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse10 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse7)) (.cse4 (and .cse7 .cse10)) (.cse11 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse0 (or .cse3 .cse4 .cse11)) (.cse1 (and .cse8 (not .cse11))) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse6 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse3 .cse4 .cse5) v_~a$w_buff1_used~0_133 0))) (= v_~a$flush_delayed~0_25 0) (= (ite .cse2 v_~a$w_buff0_used~0_148 (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse1 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~a$r_buff0_thd4~0_62 (ite (and (not .cse5) .cse8) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse9 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse9 .cse10) (and .cse6 .cse9) .cse5)) v_~a$r_buff1_thd4~0_60 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~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_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, 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][62], [Black: 190#(= ~__unbuffered_p1_EAX~0 0), 247#(and (<= 0 ~a$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), 164#(<= 0 ~__unbuffered_cnt~0), Black: 195#(= ~__unbuffered_cnt~0 0), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 101#L847true, Black: 206#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork0InUse, Black: 207#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 196#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 220#(<= ~__unbuffered_cnt~0 2), 232#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 120#P0EXITtrue, Black: 168#(<= ~__unbuffered_cnt~0 0), 117#L818true, 254#(= ~x~0 1), Black: 227#(<= ~__unbuffered_cnt~0 2), Black: 234#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 228#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 136#L791true, Black: 173#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 179#(<= ~__unbuffered_p3_EAX~0 0), Black: 243#(and (<= 0 ~a$w_buff0_used~0) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), 64#L3true, Black: 242#(and (<= 0 ~a$w_buff1_used~0) (<= ~a$w_buff1_used~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1))]) [2023-08-26 21:13:18,541 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 21:13:18,541 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:13:18,541 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:13:18,541 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:13:18,541 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:13:18,722 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse10 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse7)) (.cse4 (and .cse7 .cse10)) (.cse11 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse0 (or .cse3 .cse4 .cse11)) (.cse1 (and .cse8 (not .cse11))) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse6 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse3 .cse4 .cse5) v_~a$w_buff1_used~0_133 0))) (= v_~a$flush_delayed~0_25 0) (= (ite .cse2 v_~a$w_buff0_used~0_148 (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse1 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~a$r_buff0_thd4~0_62 (ite (and (not .cse5) .cse8) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse9 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse9 .cse10) (and .cse6 .cse9) .cse5)) v_~a$r_buff1_thd4~0_60 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~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_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, 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][62], [Black: 190#(= ~__unbuffered_p1_EAX~0 0), 247#(and (<= 0 ~a$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), 164#(<= 0 ~__unbuffered_cnt~0), Black: 195#(= ~__unbuffered_cnt~0 0), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 47#P2EXITtrue, Black: 196#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 101#L847true, Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P3Thread1of1ForFork0InUse, Black: 206#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 120#P0EXITtrue, Black: 168#(<= ~__unbuffered_cnt~0 0), 234#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 254#(= ~x~0 1), Black: 227#(<= ~__unbuffered_cnt~0 2), Black: 228#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 173#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 136#L791true, Black: 179#(<= ~__unbuffered_p3_EAX~0 0), 207#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 243#(and (<= 0 ~a$w_buff0_used~0) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), 64#L3true, Black: 242#(and (<= 0 ~a$w_buff1_used~0) (<= ~a$w_buff1_used~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 185#(<= ~__unbuffered_cnt~0 1)]) [2023-08-26 21:13:18,722 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-26 21:13:18,722 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:13:18,722 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:13:18,722 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:13:18,723 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse10 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse7)) (.cse4 (and .cse7 .cse10)) (.cse11 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse0 (or .cse3 .cse4 .cse11)) (.cse1 (and .cse8 (not .cse11))) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse6 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse3 .cse4 .cse5) v_~a$w_buff1_used~0_133 0))) (= v_~a$flush_delayed~0_25 0) (= (ite .cse2 v_~a$w_buff0_used~0_148 (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse1 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~a$r_buff0_thd4~0_62 (ite (and (not .cse5) .cse8) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse9 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse9 .cse10) (and .cse6 .cse9) .cse5)) v_~a$r_buff1_thd4~0_60 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~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_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, 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][62], [Black: 190#(= ~__unbuffered_p1_EAX~0 0), 247#(and (<= 0 ~a$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), 164#(<= 0 ~__unbuffered_cnt~0), Black: 195#(= ~__unbuffered_cnt~0 0), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 47#P2EXITtrue, Black: 196#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 101#L847true, Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 206#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork0InUse, Black: 207#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 120#P0EXITtrue, Black: 168#(<= ~__unbuffered_cnt~0 0), 234#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 254#(= ~x~0 1), Black: 227#(<= ~__unbuffered_cnt~0 2), Black: 228#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 173#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 136#L791true, Black: 179#(<= ~__unbuffered_p3_EAX~0 0), 64#L3true, Black: 243#(and (<= 0 ~a$w_buff0_used~0) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), Black: 242#(and (<= 0 ~a$w_buff1_used~0) (<= ~a$w_buff1_used~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 185#(<= ~__unbuffered_cnt~0 1)]) [2023-08-26 21:13:18,723 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-26 21:13:18,723 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:13:18,723 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:13:18,723 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:13:18,751 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse10 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse7)) (.cse4 (and .cse7 .cse10)) (.cse11 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse0 (or .cse3 .cse4 .cse11)) (.cse1 (and .cse8 (not .cse11))) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse6 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse3 .cse4 .cse5) v_~a$w_buff1_used~0_133 0))) (= v_~a$flush_delayed~0_25 0) (= (ite .cse2 v_~a$w_buff0_used~0_148 (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse1 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~a$r_buff0_thd4~0_62 (ite (and (not .cse5) .cse8) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse9 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse9 .cse10) (and .cse6 .cse9) .cse5)) v_~a$r_buff1_thd4~0_60 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~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_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, 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][62], [Black: 190#(= ~__unbuffered_p1_EAX~0 0), 247#(and (<= 0 ~a$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), 164#(<= 0 ~__unbuffered_cnt~0), Black: 195#(= ~__unbuffered_cnt~0 0), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 47#P2EXITtrue, Black: 196#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 101#L847true, Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 206#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 120#P0EXITtrue, Black: 168#(<= ~__unbuffered_cnt~0 0), 234#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 254#(= ~x~0 1), Black: 227#(<= ~__unbuffered_cnt~0 2), Black: 228#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 136#L791true, Black: 173#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 179#(<= ~__unbuffered_p3_EAX~0 0), 64#L3true, 207#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 243#(and (<= 0 ~a$w_buff0_used~0) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), Black: 242#(and (<= 0 ~a$w_buff1_used~0) (<= ~a$w_buff1_used~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 185#(<= ~__unbuffered_cnt~0 1)]) [2023-08-26 21:13:18,751 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-26 21:13:18,751 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:13:18,752 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:13:18,752 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:13:18,752 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:13:18,766 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse10 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse7)) (.cse4 (and .cse7 .cse10)) (.cse11 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse0 (or .cse3 .cse4 .cse11)) (.cse1 (and .cse8 (not .cse11))) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse6 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse3 .cse4 .cse5) v_~a$w_buff1_used~0_133 0))) (= v_~a$flush_delayed~0_25 0) (= (ite .cse2 v_~a$w_buff0_used~0_148 (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse1 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~a$r_buff0_thd4~0_62 (ite (and (not .cse5) .cse8) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse9 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse9 .cse10) (and .cse6 .cse9) .cse5)) v_~a$r_buff1_thd4~0_60 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~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_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, 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][62], [Black: 190#(= ~__unbuffered_p1_EAX~0 0), 247#(and (<= 0 ~a$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), 164#(<= 0 ~__unbuffered_cnt~0), Black: 195#(= ~__unbuffered_cnt~0 0), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 47#P2EXITtrue, 101#L847true, Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 206#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 196#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 120#P0EXITtrue, Black: 168#(<= ~__unbuffered_cnt~0 0), 254#(= ~x~0 1), 234#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 227#(<= ~__unbuffered_cnt~0 2), Black: 228#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 136#L791true, Black: 173#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 179#(<= ~__unbuffered_p3_EAX~0 0), 64#L3true, 207#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 243#(and (<= 0 ~a$w_buff0_used~0) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), Black: 242#(and (<= 0 ~a$w_buff1_used~0) (<= ~a$w_buff1_used~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 185#(<= ~__unbuffered_cnt~0 1)]) [2023-08-26 21:13:18,767 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-26 21:13:18,767 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:13:18,767 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:13:18,767 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:13:18,800 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse10 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse7)) (.cse4 (and .cse7 .cse10)) (.cse11 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse0 (or .cse3 .cse4 .cse11)) (.cse1 (and .cse8 (not .cse11))) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse6 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse3 .cse4 .cse5) v_~a$w_buff1_used~0_133 0))) (= v_~a$flush_delayed~0_25 0) (= (ite .cse2 v_~a$w_buff0_used~0_148 (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse1 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~a$r_buff0_thd4~0_62 (ite (and (not .cse5) .cse8) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse9 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse9 .cse10) (and .cse6 .cse9) .cse5)) v_~a$r_buff1_thd4~0_60 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~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_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, 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][62], [Black: 190#(= ~__unbuffered_p1_EAX~0 0), 247#(and (<= 0 ~a$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), 164#(<= 0 ~__unbuffered_cnt~0), Black: 195#(= ~__unbuffered_cnt~0 0), 47#P2EXITtrue, Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 101#L847true, Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 206#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 196#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 120#P0EXITtrue, Black: 168#(<= ~__unbuffered_cnt~0 0), 254#(= ~x~0 1), 234#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 227#(<= ~__unbuffered_cnt~0 2), Black: 228#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 173#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 136#L791true, Black: 179#(<= ~__unbuffered_p3_EAX~0 0), Black: 243#(and (<= 0 ~a$w_buff0_used~0) (<= ~a$w_buff0_used~0 0) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (= ~a~0 1) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256)))), 207#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 64#L3true, Black: 242#(and (<= 0 ~a$w_buff1_used~0) (<= ~a$w_buff1_used~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 185#(<= ~__unbuffered_cnt~0 1)]) [2023-08-26 21:13:18,800 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-26 21:13:18,800 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:13:18,800 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:13:18,800 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:13:18,800 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:13:19,273 INFO L124 PetriNetUnfolderBase]: 20203/31120 cut-off events. [2023-08-26 21:13:19,274 INFO L125 PetriNetUnfolderBase]: For 71784/72978 co-relation queries the response was YES. [2023-08-26 21:13:19,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121191 conditions, 31120 events. 20203/31120 cut-off events. For 71784/72978 co-relation queries the response was YES. Maximal size of possible extension queue 1491. Compared 229540 event pairs, 6406 based on Foata normal form. 243/30525 useless extension candidates. Maximal degree in co-relation 121164. Up to 17658 conditions per place. [2023-08-26 21:13:19,547 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 129 selfloop transitions, 4 changer transitions 3/142 dead transitions. [2023-08-26 21:13:19,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 142 transitions, 1214 flow [2023-08-26 21:13:19,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:13:19,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:13:19,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2023-08-26 21:13:19,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5087719298245614 [2023-08-26 21:13:19,549 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2023-08-26 21:13:19,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2023-08-26 21:13:19,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:19,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2023-08-26 21:13:19,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:19,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:19,552 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:19,552 INFO L175 Difference]: Start difference. First operand has 77 places, 78 transitions, 509 flow. Second operand 3 states and 406 transitions. [2023-08-26 21:13:19,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 142 transitions, 1214 flow [2023-08-26 21:13:24,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 142 transitions, 1212 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:13:24,088 INFO L231 Difference]: Finished difference. Result has 79 places, 80 transitions, 533 flow [2023-08-26 21:13:24,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=533, PETRI_PLACES=79, PETRI_TRANSITIONS=80} [2023-08-26 21:13:24,088 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 27 predicate places. [2023-08-26 21:13:24,089 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 80 transitions, 533 flow [2023-08-26 21:13:24,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:24,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:24,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:24,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 21:13:24,089 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:13:24,089 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:24,089 INFO L85 PathProgramCache]: Analyzing trace with hash -627633689, now seen corresponding path program 2 times [2023-08-26 21:13:24,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:24,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559265950] [2023-08-26 21:13:24,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:24,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:24,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:13:24,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:24,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559265950] [2023-08-26 21:13:24,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559265950] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:24,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:24,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:13:24,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051154372] [2023-08-26 21:13:24,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:24,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:13:24,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:24,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:13:24,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:13:24,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 266 [2023-08-26 21:13:24,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 80 transitions, 533 flow. Second operand has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:24,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:24,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 266 [2023-08-26 21:13:24,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:26,831 INFO L124 PetriNetUnfolderBase]: 15476/24275 cut-off events. [2023-08-26 21:13:26,831 INFO L125 PetriNetUnfolderBase]: For 59325/60095 co-relation queries the response was YES. [2023-08-26 21:13:26,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97589 conditions, 24275 events. 15476/24275 cut-off events. For 59325/60095 co-relation queries the response was YES. Maximal size of possible extension queue 1389. Compared 186245 event pairs, 1273 based on Foata normal form. 384/24111 useless extension candidates. Maximal degree in co-relation 97561. Up to 7904 conditions per place. [2023-08-26 21:13:27,008 INFO L140 encePairwiseOnDemand]: 255/266 looper letters, 124 selfloop transitions, 33 changer transitions 56/221 dead transitions. [2023-08-26 21:13:27,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 221 transitions, 1681 flow [2023-08-26 21:13:27,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 21:13:27,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 21:13:27,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1363 transitions. [2023-08-26 21:13:27,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46582365003417636 [2023-08-26 21:13:27,012 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1363 transitions. [2023-08-26 21:13:27,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1363 transitions. [2023-08-26 21:13:27,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:27,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1363 transitions. [2023-08-26 21:13:27,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 123.9090909090909) internal successors, (1363), 11 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:27,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 266.0) internal successors, (3192), 12 states have internal predecessors, (3192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:27,018 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 266.0) internal successors, (3192), 12 states have internal predecessors, (3192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:27,018 INFO L175 Difference]: Start difference. First operand has 79 places, 80 transitions, 533 flow. Second operand 11 states and 1363 transitions. [2023-08-26 21:13:27,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 221 transitions, 1681 flow [2023-08-26 21:13:32,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 221 transitions, 1653 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-26 21:13:32,972 INFO L231 Difference]: Finished difference. Result has 85 places, 68 transitions, 520 flow [2023-08-26 21:13:32,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=520, PETRI_PLACES=85, PETRI_TRANSITIONS=68} [2023-08-26 21:13:32,973 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 33 predicate places. [2023-08-26 21:13:32,973 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 68 transitions, 520 flow [2023-08-26 21:13:32,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:32,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:32,973 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:32,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 21:13:32,974 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:13:32,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:32,974 INFO L85 PathProgramCache]: Analyzing trace with hash -967160350, now seen corresponding path program 1 times [2023-08-26 21:13:32,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:32,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492335417] [2023-08-26 21:13:32,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:32,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:33,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:13:33,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:33,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492335417] [2023-08-26 21:13:33,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492335417] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:33,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:33,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:13:33,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063258535] [2023-08-26 21:13:33,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:33,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:13:33,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:33,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:13:33,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:13:33,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 266 [2023-08-26 21:13:33,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 68 transitions, 520 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:33,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:33,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 266 [2023-08-26 21:13:33,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:34,432 INFO L124 PetriNetUnfolderBase]: 8539/13180 cut-off events. [2023-08-26 21:13:34,432 INFO L125 PetriNetUnfolderBase]: For 45956/46213 co-relation queries the response was YES. [2023-08-26 21:13:34,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56721 conditions, 13180 events. 8539/13180 cut-off events. For 45956/46213 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 89030 event pairs, 1559 based on Foata normal form. 123/12951 useless extension candidates. Maximal degree in co-relation 56691. Up to 6253 conditions per place. [2023-08-26 21:13:34,509 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 74 selfloop transitions, 1 changer transitions 74/153 dead transitions. [2023-08-26 21:13:34,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 153 transitions, 1541 flow [2023-08-26 21:13:34,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:13:34,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:13:34,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 512 transitions. [2023-08-26 21:13:34,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48120300751879697 [2023-08-26 21:13:34,510 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 512 transitions. [2023-08-26 21:13:34,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 512 transitions. [2023-08-26 21:13:34,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:34,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 512 transitions. [2023-08-26 21:13:34,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:34,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:34,513 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:34,513 INFO L175 Difference]: Start difference. First operand has 85 places, 68 transitions, 520 flow. Second operand 4 states and 512 transitions. [2023-08-26 21:13:34,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 153 transitions, 1541 flow [2023-08-26 21:13:35,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 153 transitions, 1193 flow, removed 40 selfloop flow, removed 14 redundant places. [2023-08-26 21:13:35,399 INFO L231 Difference]: Finished difference. Result has 73 places, 61 transitions, 334 flow [2023-08-26 21:13:35,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=334, PETRI_PLACES=73, PETRI_TRANSITIONS=61} [2023-08-26 21:13:35,400 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places. [2023-08-26 21:13:35,400 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 61 transitions, 334 flow [2023-08-26 21:13:35,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:35,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:35,400 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:35,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 21:13:35,400 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:13:35,401 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:35,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1194068862, now seen corresponding path program 2 times [2023-08-26 21:13:35,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:35,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705361153] [2023-08-26 21:13:35,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:35,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:35,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:35,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:13:35,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:35,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705361153] [2023-08-26 21:13:35,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705361153] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:35,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:35,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:13:35,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278317611] [2023-08-26 21:13:35,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:35,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:13:35,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:35,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:13:35,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:13:35,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 266 [2023-08-26 21:13:35,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 61 transitions, 334 flow. Second operand has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:35,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:35,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 266 [2023-08-26 21:13:35,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:36,476 INFO L124 PetriNetUnfolderBase]: 5114/8351 cut-off events. [2023-08-26 21:13:36,476 INFO L125 PetriNetUnfolderBase]: For 13606/14030 co-relation queries the response was YES. [2023-08-26 21:13:36,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29025 conditions, 8351 events. 5114/8351 cut-off events. For 13606/14030 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 55674 event pairs, 1178 based on Foata normal form. 59/8274 useless extension candidates. Maximal degree in co-relation 29003. Up to 4333 conditions per place. [2023-08-26 21:13:36,521 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 47 selfloop transitions, 1 changer transitions 81/133 dead transitions. [2023-08-26 21:13:36,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 133 transitions, 1005 flow [2023-08-26 21:13:36,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:13:36,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:13:36,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 518 transitions. [2023-08-26 21:13:36,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579 [2023-08-26 21:13:36,523 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 518 transitions. [2023-08-26 21:13:36,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 518 transitions. [2023-08-26 21:13:36,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:36,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 518 transitions. [2023-08-26 21:13:36,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:36,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:36,527 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:36,527 INFO L175 Difference]: Start difference. First operand has 73 places, 61 transitions, 334 flow. Second operand 4 states and 518 transitions. [2023-08-26 21:13:36,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 133 transitions, 1005 flow [2023-08-26 21:13:36,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 133 transitions, 996 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-26 21:13:36,654 INFO L231 Difference]: Finished difference. Result has 73 places, 44 transitions, 230 flow [2023-08-26 21:13:36,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=230, PETRI_PLACES=73, PETRI_TRANSITIONS=44} [2023-08-26 21:13:36,655 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places. [2023-08-26 21:13:36,655 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 44 transitions, 230 flow [2023-08-26 21:13:36,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:36,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:36,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:36,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 21:13:36,656 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:13:36,656 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:36,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1777438934, now seen corresponding path program 3 times [2023-08-26 21:13:36,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:36,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73924647] [2023-08-26 21:13:36,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:36,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:37,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:13:37,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:37,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73924647] [2023-08-26 21:13:37,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73924647] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:37,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:37,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:13:37,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994273418] [2023-08-26 21:13:37,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:37,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 21:13:37,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:37,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 21:13:37,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-26 21:13:37,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 266 [2023-08-26 21:13:37,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 44 transitions, 230 flow. Second operand has 8 states, 8 states have (on average 112.0) internal successors, (896), 8 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:37,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:37,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 266 [2023-08-26 21:13:37,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:38,035 INFO L124 PetriNetUnfolderBase]: 966/1683 cut-off events. [2023-08-26 21:13:38,035 INFO L125 PetriNetUnfolderBase]: For 2284/2354 co-relation queries the response was YES. [2023-08-26 21:13:38,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5950 conditions, 1683 events. 966/1683 cut-off events. For 2284/2354 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8593 event pairs, 77 based on Foata normal form. 1/1676 useless extension candidates. Maximal degree in co-relation 5928. Up to 701 conditions per place. [2023-08-26 21:13:38,044 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 79 selfloop transitions, 5 changer transitions 48/137 dead transitions. [2023-08-26 21:13:38,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 137 transitions, 1004 flow [2023-08-26 21:13:38,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:13:38,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:13:38,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 839 transitions. [2023-08-26 21:13:38,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4505907626208378 [2023-08-26 21:13:38,046 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 839 transitions. [2023-08-26 21:13:38,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 839 transitions. [2023-08-26 21:13:38,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:38,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 839 transitions. [2023-08-26 21:13:38,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.85714285714286) internal successors, (839), 7 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:38,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:38,052 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:38,052 INFO L175 Difference]: Start difference. First operand has 73 places, 44 transitions, 230 flow. Second operand 7 states and 839 transitions. [2023-08-26 21:13:38,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 137 transitions, 1004 flow [2023-08-26 21:13:38,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 137 transitions, 935 flow, removed 29 selfloop flow, removed 10 redundant places. [2023-08-26 21:13:38,067 INFO L231 Difference]: Finished difference. Result has 64 places, 46 transitions, 236 flow [2023-08-26 21:13:38,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=236, PETRI_PLACES=64, PETRI_TRANSITIONS=46} [2023-08-26 21:13:38,068 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2023-08-26 21:13:38,068 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 236 flow [2023-08-26 21:13:38,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 112.0) internal successors, (896), 8 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:38,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:38,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:38,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 21:13:38,069 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:13:38,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:38,069 INFO L85 PathProgramCache]: Analyzing trace with hash 728492214, now seen corresponding path program 4 times [2023-08-26 21:13:38,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:38,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22567286] [2023-08-26 21:13:38,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:38,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:13:38,125 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 21:13:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:13:38,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 21:13:38,230 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 21:13:38,230 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (22 of 23 remaining) [2023-08-26 21:13:38,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (21 of 23 remaining) [2023-08-26 21:13:38,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2023-08-26 21:13:38,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2023-08-26 21:13:38,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2023-08-26 21:13:38,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2023-08-26 21:13:38,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2023-08-26 21:13:38,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 23 remaining) [2023-08-26 21:13:38,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2023-08-26 21:13:38,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2023-08-26 21:13:38,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2023-08-26 21:13:38,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2023-08-26 21:13:38,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2023-08-26 21:13:38,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2023-08-26 21:13:38,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (8 of 23 remaining) [2023-08-26 21:13:38,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2023-08-26 21:13:38,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 23 remaining) [2023-08-26 21:13:38,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2023-08-26 21:13:38,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2023-08-26 21:13:38,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2023-08-26 21:13:38,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 23 remaining) [2023-08-26 21:13:38,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2023-08-26 21:13:38,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2023-08-26 21:13:38,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 21:13:38,237 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:38,242 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 21:13:38,243 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 21:13:38,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:13:38 BasicIcfg [2023-08-26 21:13:38,352 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 21:13:38,353 INFO L158 Benchmark]: Toolchain (without parser) took 56735.74ms. Allocated memory was 352.3MB in the beginning and 8.6GB in the end (delta: 8.2GB). Free memory was 326.6MB in the beginning and 5.7GB in the end (delta: -5.4GB). Peak memory consumption was 2.8GB. Max. memory is 16.0GB. [2023-08-26 21:13:38,353 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 352.3MB. Free memory is still 328.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 21:13:38,353 INFO L158 Benchmark]: CACSL2BoogieTranslator took 582.69ms. Allocated memory is still 352.3MB. Free memory was 326.1MB in the beginning and 302.1MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 21:13:38,353 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.72ms. Allocated memory is still 352.3MB. Free memory was 302.1MB in the beginning and 299.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 21:13:38,354 INFO L158 Benchmark]: Boogie Preprocessor took 32.16ms. Allocated memory is still 352.3MB. Free memory was 299.3MB in the beginning and 297.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:13:38,354 INFO L158 Benchmark]: RCFGBuilder took 712.76ms. Allocated memory is still 352.3MB. Free memory was 297.2MB in the beginning and 305.3MB in the end (delta: -8.0MB). Peak memory consumption was 25.0MB. Max. memory is 16.0GB. [2023-08-26 21:13:38,354 INFO L158 Benchmark]: TraceAbstraction took 55332.55ms. Allocated memory was 352.3MB in the beginning and 8.6GB in the end (delta: 8.2GB). Free memory was 304.2MB in the beginning and 5.7GB in the end (delta: -5.4GB). Peak memory consumption was 2.8GB. Max. memory is 16.0GB. [2023-08-26 21:13:38,355 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.14ms. Allocated memory is still 352.3MB. Free memory is still 328.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 582.69ms. Allocated memory is still 352.3MB. Free memory was 326.1MB in the beginning and 302.1MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 70.72ms. Allocated memory is still 352.3MB. Free memory was 302.1MB in the beginning and 299.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 32.16ms. Allocated memory is still 352.3MB. Free memory was 299.3MB in the beginning and 297.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 712.76ms. Allocated memory is still 352.3MB. Free memory was 297.2MB in the beginning and 305.3MB in the end (delta: -8.0MB). Peak memory consumption was 25.0MB. Max. memory is 16.0GB. * TraceAbstraction took 55332.55ms. Allocated memory was 352.3MB in the beginning and 8.6GB in the end (delta: 8.2GB). Free memory was 304.2MB in the beginning and 5.7GB in the end (delta: -5.4GB). Peak memory consumption was 2.8GB. 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.5s, 151 PlacesBefore, 52 PlacesAfterwards, 141 TransitionsBefore, 40 TransitionsAfterwards, 4696 CoEnabledTransitionPairs, 8 FixpointIterations, 44 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 17 ConcurrentYvCompositions, 2 ChoiceCompositions, 121 TotalNumberOfCompositions, 19688 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7211, independent: 6764, independent conditional: 0, independent unconditional: 6764, dependent: 447, dependent conditional: 0, dependent unconditional: 447, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2548, independent: 2467, independent conditional: 0, independent unconditional: 2467, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7211, independent: 4297, independent conditional: 0, independent unconditional: 4297, dependent: 366, dependent conditional: 0, dependent unconditional: 366, unknown: 2548, unknown conditional: 0, unknown unconditional: 2548] , Statistics on independence cache: Total cache size (in pairs): 248, Positive cache size: 219, Positive conditional cache size: 0, Positive unconditional cache size: 219, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, 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_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t353; [L872] FCALL, FORK 0 pthread_create(&t353, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=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(&t353, ((void *)0), P0, ((void *)0))=-3, t353={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t354; [L874] FCALL, FORK 0 pthread_create(&t354, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t354, ((void *)0), P1, ((void *)0))=-2, t353={5:0}, t354={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t355; [L876] FCALL, FORK 0 pthread_create(&t355, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t355, ((void *)0), P2, ((void *)0))=-1, t353={5:0}, t354={6:0}, t355={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t356; [L878] FCALL, FORK 0 pthread_create(&t356, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=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, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t356, ((void *)0), P3, ((void *)0))=0, t353={5:0}, t354={6:0}, t355={7:0}, t356={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=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, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=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, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=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=0, z=0] [L787] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=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=0, z=0] [L790] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=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=0, z=0] [L807] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=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, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L810] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=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, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=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=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=1] [L793] 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) [L794] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L795] 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 [L796] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L797] 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=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=1] [L800] EXPR 2 __unbuffered_cnt + 1 [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L813] 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) [L814] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L815] 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 [L816] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L817] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 a$flush_delayed = weak$$choice2 [L836] 4 a$mem_tmp = a [L837] 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) [L838] 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)) [L839] 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)) [L840] 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)) [L841] 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)) [L842] 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)) [L843] 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)) [L844] 4 __unbuffered_p3_EBX = a [L845] 4 a = a$flush_delayed ? a$mem_tmp : a [L846] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=0, x=2, y=1, z=1] [L849] 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) [L850] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L851] 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 [L852] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L853] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=0, x=2, y=1, z=1] [L770] 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) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 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 [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=0, x=2, y=1, z=1] [L777] EXPR 1 __unbuffered_cnt + 1 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L820] EXPR 3 __unbuffered_cnt + 1 [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L856] EXPR 4 __unbuffered_cnt + 1 [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 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) [L885] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L886] 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 [L887] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L888] 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_p2_EAX=0, __unbuffered_p3_EAX=1, __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, t353={5:0}, t354={6:0}, t355={7:0}, t356={3:0}, weak$$choice2=0, x=2, y=1, z=1] [L891] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] 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", "mix014_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_p2_EAX=0, __unbuffered_p3_EAX=1, __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=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 777]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 777]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 800]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 800]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 820]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 820]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 878]: 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: 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. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 190 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: 55.1s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 45.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 687 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 687 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1998 IncrementalHoareTripleChecker+Invalid, 2082 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 12 mSDtfsCounter, 1998 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=533occurred in iteration=13, InterpolantAutomatonStates: 83, 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.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 332 NumberOfCodeBlocks, 332 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 286 ConstructedInterpolants, 0 QuantifiedInterpolants, 1964 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 21:13:38,373 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...