/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.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 21:12:37,576 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 21:12:37,654 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:37,657 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 21:12:37,658 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 21:12:37,675 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 21:12:37,676 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 21:12:37,676 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 21:12:37,676 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 21:12:37,677 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 21:12:37,677 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 21:12:37,677 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 21:12:37,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 21:12:37,678 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 21:12:37,678 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 21:12:37,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 21:12:37,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 21:12:37,679 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 21:12:37,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 21:12:37,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 21:12:37,680 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 21:12:37,683 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 21:12:37,683 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 21:12:37,684 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 21:12:37,685 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 21:12:37,685 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 21:12:37,685 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 21:12:37,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:12:37,686 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 21:12:37,686 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 21:12:37,686 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 21:12:37,687 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 21:12:37,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 21:12:37,687 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 21:12:37,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 21:12:37,688 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:38,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 21:12:38,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 21:12:38,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 21:12:38,046 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 21:12:38,046 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 21:12:38,047 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix014.opt.i [2023-08-26 21:12:39,209 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 21:12:39,514 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 21:12:39,515 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix014.opt.i [2023-08-26 21:12:39,537 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24730727d/ae5768310f1a4179bb62532965edf525/FLAGdd0340bf0 [2023-08-26 21:12:39,603 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24730727d/ae5768310f1a4179bb62532965edf525 [2023-08-26 21:12:39,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 21:12:39,609 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 21:12:39,611 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 21:12:39,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 21:12:39,613 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 21:12:39,615 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:12:39" (1/1) ... [2023-08-26 21:12:39,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eee5866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:12:39, skipping insertion in model container [2023-08-26 21:12:39,616 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:12:39" (1/1) ... [2023-08-26 21:12:39,668 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 21:12:40,062 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:12:40,076 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 21:12:40,092 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:12:40,094 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:12:40,121 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:12:40,146 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:12:40,147 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:12:40,153 INFO L206 MainTranslator]: Completed translation [2023-08-26 21:12:40,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:12:40 WrapperNode [2023-08-26 21:12:40,154 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 21:12:40,155 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 21:12:40,155 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 21:12:40,155 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 21:12:40,161 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:40" (1/1) ... [2023-08-26 21:12:40,191 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:40" (1/1) ... [2023-08-26 21:12:40,234 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 174 [2023-08-26 21:12:40,234 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 21:12:40,235 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 21:12:40,235 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 21:12:40,235 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 21:12:40,242 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:40" (1/1) ... [2023-08-26 21:12:40,243 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:40" (1/1) ... [2023-08-26 21:12:40,257 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:40" (1/1) ... [2023-08-26 21:12:40,257 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:40" (1/1) ... [2023-08-26 21:12:40,265 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:40" (1/1) ... [2023-08-26 21:12:40,266 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:40" (1/1) ... [2023-08-26 21:12:40,284 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:40" (1/1) ... [2023-08-26 21:12:40,286 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:40" (1/1) ... [2023-08-26 21:12:40,289 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 21:12:40,290 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 21:12:40,290 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 21:12:40,290 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 21:12:40,291 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:12:40" (1/1) ... [2023-08-26 21:12:40,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:12:40,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 21:12:40,326 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:40,338 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:40,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 21:12:40,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 21:12:40,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 21:12:40,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 21:12:40,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 21:12:40,362 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 21:12:40,362 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 21:12:40,362 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 21:12:40,362 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 21:12:40,362 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 21:12:40,362 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 21:12:40,362 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 21:12:40,362 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 21:12:40,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 21:12:40,363 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 21:12:40,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 21:12:40,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 21:12:40,365 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:40,515 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 21:12:40,517 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 21:12:40,843 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 21:12:41,031 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 21:12:41,032 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 21:12:41,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:12:41 BoogieIcfgContainer [2023-08-26 21:12:41,035 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 21:12:41,038 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 21:12:41,038 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 21:12:41,041 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 21:12:41,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:12:39" (1/3) ... [2023-08-26 21:12:41,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d4afe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:12:41, skipping insertion in model container [2023-08-26 21:12:41,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:12:40" (2/3) ... [2023-08-26 21:12:41,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d4afe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:12:41, skipping insertion in model container [2023-08-26 21:12:41,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:12:41" (3/3) ... [2023-08-26 21:12:41,044 INFO L112 eAbstractionObserver]: Analyzing ICFG mix014.opt.i [2023-08-26 21:12:41,059 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 21:12:41,060 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 21:12:41,060 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 21:12:41,127 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 21:12:41,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 142 transitions, 304 flow [2023-08-26 21:12:41,209 INFO L124 PetriNetUnfolderBase]: 3/138 cut-off events. [2023-08-26 21:12:41,209 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:12:41,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 3/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-26 21:12:41,217 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 142 transitions, 304 flow [2023-08-26 21:12:41,220 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 138 transitions, 288 flow [2023-08-26 21:12:41,223 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 21:12:41,235 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 138 transitions, 288 flow [2023-08-26 21:12:41,238 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 138 transitions, 288 flow [2023-08-26 21:12:41,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 138 transitions, 288 flow [2023-08-26 21:12:41,287 INFO L124 PetriNetUnfolderBase]: 3/138 cut-off events. [2023-08-26 21:12:41,287 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:12:41,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 3/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-26 21:12:41,293 INFO L119 LiptonReduction]: Number of co-enabled transitions 4186 [2023-08-26 21:12:45,410 INFO L134 LiptonReduction]: Checked pairs total: 15036 [2023-08-26 21:12:45,410 INFO L136 LiptonReduction]: Total number of compositions: 119 [2023-08-26 21:12:45,422 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 21:12:45,427 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;@462fb512, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 21:12:45,427 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-26 21:12:45,429 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 21:12:45,430 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-26 21:12:45,430 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:12:45,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:12:45,431 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 21:12:45,431 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:12:45,435 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:12:45,435 INFO L85 PathProgramCache]: Analyzing trace with hash 607198290, now seen corresponding path program 1 times [2023-08-26 21:12:45,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:12:45,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969603185] [2023-08-26 21:12:45,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:12:45,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:12:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:12:45,677 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:45,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:12:45,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969603185] [2023-08-26 21:12:45,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969603185] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:12:45,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:12:45,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:12:45,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172708066] [2023-08-26 21:12:45,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:12:45,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:12:45,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:12:45,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:12:45,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:12:45,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 261 [2023-08-26 21:12:45,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states 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:45,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:12:45,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 261 [2023-08-26 21:12:45,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:12:47,218 INFO L124 PetriNetUnfolderBase]: 11479/15921 cut-off events. [2023-08-26 21:12:47,219 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2023-08-26 21:12:47,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32001 conditions, 15921 events. 11479/15921 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 1098. Compared 96874 event pairs, 3065 based on Foata normal form. 0/10290 useless extension candidates. Maximal degree in co-relation 31989. Up to 14601 conditions per place. [2023-08-26 21:12:47,418 INFO L140 encePairwiseOnDemand]: 247/261 looper letters, 51 selfloop transitions, 5 changer transitions 0/60 dead transitions. [2023-08-26 21:12:47,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 60 transitions, 253 flow [2023-08-26 21:12:47,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:12:47,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:12:47,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2023-08-26 21:12:47,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5210727969348659 [2023-08-26 21:12:47,430 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 408 transitions. [2023-08-26 21:12:47,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 408 transitions. [2023-08-26 21:12:47,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:12:47,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 408 transitions. [2023-08-26 21:12:47,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states 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:47,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states 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:47,440 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states 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:47,442 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 88 flow. Second operand 3 states and 408 transitions. [2023-08-26 21:12:47,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 60 transitions, 253 flow [2023-08-26 21:12:47,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 246 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 21:12:47,448 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 129 flow [2023-08-26 21:12:47,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2023-08-26 21:12:47,452 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2023-08-26 21:12:47,452 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 129 flow [2023-08-26 21:12:47,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states 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:47,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:12:47,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:12:47,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 21:12:47,453 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:12:47,454 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:12:47,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1425432623, now seen corresponding path program 1 times [2023-08-26 21:12:47,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:12:47,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845652653] [2023-08-26 21:12:47,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:12:47,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:12:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:12:47,711 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:47,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:12:47,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845652653] [2023-08-26 21:12:47,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845652653] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:12:47,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:12:47,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:12:47,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665993336] [2023-08-26 21:12:47,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:12:47,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:12:47,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:12:47,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:12:47,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:12:47,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 261 [2023-08-26 21:12:47,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 129 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:47,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:12:47,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 261 [2023-08-26 21:12:47,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:12:48,826 INFO L124 PetriNetUnfolderBase]: 7858/11729 cut-off events. [2023-08-26 21:12:48,826 INFO L125 PetriNetUnfolderBase]: For 1459/2034 co-relation queries the response was YES. [2023-08-26 21:12:48,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28400 conditions, 11729 events. 7858/11729 cut-off events. For 1459/2034 co-relation queries the response was YES. Maximal size of possible extension queue 1022. Compared 82448 event pairs, 1775 based on Foata normal form. 1/8777 useless extension candidates. Maximal degree in co-relation 28389. Up to 8472 conditions per place. [2023-08-26 21:12:48,922 INFO L140 encePairwiseOnDemand]: 258/261 looper letters, 48 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-08-26 21:12:48,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 58 transitions, 284 flow [2023-08-26 21:12:48,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:12:48,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:12:48,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2023-08-26 21:12:48,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51213282247765 [2023-08-26 21:12:48,925 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions. [2023-08-26 21:12:48,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions. [2023-08-26 21:12:48,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:12:48,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions. [2023-08-26 21:12:48,927 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:48,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states 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,930 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states 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,930 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 129 flow. Second operand 3 states and 401 transitions. [2023-08-26 21:12:48,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 58 transitions, 284 flow [2023-08-26 21:12:48,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 276 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:12:48,932 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 126 flow [2023-08-26 21:12:48,933 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-08-26 21:12:48,933 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2023-08-26 21:12:48,934 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 126 flow [2023-08-26 21:12:48,934 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:48,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:12:48,934 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:12:48,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 21:12:48,935 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:12:48,935 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:12:48,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1204858446, now seen corresponding path program 1 times [2023-08-26 21:12:48,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:12:48,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886220694] [2023-08-26 21:12:48,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:12:48,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:12:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:12:48,983 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,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:12:48,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886220694] [2023-08-26 21:12:48,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886220694] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:12:48,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:12:48,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:12:48,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024574468] [2023-08-26 21:12:48,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:12:48,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:12:48,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:12:48,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:12:48,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:12:48,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 261 [2023-08-26 21:12:48,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:12:48,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:12:48,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 261 [2023-08-26 21:12:48,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:12:49,871 INFO L124 PetriNetUnfolderBase]: 5765/8039 cut-off events. [2023-08-26 21:12:49,871 INFO L125 PetriNetUnfolderBase]: For 780/787 co-relation queries the response was YES. [2023-08-26 21:12:49,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19695 conditions, 8039 events. 5765/8039 cut-off events. For 780/787 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 43690 event pairs, 1355 based on Foata normal form. 4/6336 useless extension candidates. Maximal degree in co-relation 19683. Up to 6970 conditions per place. [2023-08-26 21:12:49,919 INFO L140 encePairwiseOnDemand]: 252/261 looper letters, 45 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2023-08-26 21:12:49,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 54 transitions, 254 flow [2023-08-26 21:12:49,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:12:49,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:12:49,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 510 transitions. [2023-08-26 21:12:49,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4885057471264368 [2023-08-26 21:12:49,922 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 510 transitions. [2023-08-26 21:12:49,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 510 transitions. [2023-08-26 21:12:49,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:12:49,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 510 transitions. [2023-08-26 21:12:49,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:12:49,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 261.0) internal successors, (1305), 5 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states 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:49,926 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 261.0) internal successors, (1305), 5 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states 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:49,926 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 126 flow. Second operand 4 states and 510 transitions. [2023-08-26 21:12:49,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 54 transitions, 254 flow [2023-08-26 21:12:49,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 248 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:12:49,931 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 116 flow [2023-08-26 21:12:49,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2023-08-26 21:12:49,932 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2023-08-26 21:12:49,932 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 116 flow [2023-08-26 21:12:49,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:12:49,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:12:49,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:12:49,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 21:12:49,936 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:12:49,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:12:49,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1527576771, now seen corresponding path program 1 times [2023-08-26 21:12:49,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:12:49,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763462417] [2023-08-26 21:12:49,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:12:49,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:12:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:12:50,021 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,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:12:50,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763462417] [2023-08-26 21:12:50,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763462417] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:12:50,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:12:50,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:12:50,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168952650] [2023-08-26 21:12:50,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:12:50,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:12:50,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:12:50,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:12:50,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:12:50,026 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 261 [2023-08-26 21:12:50,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:12:50,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:12:50,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 261 [2023-08-26 21:12:50,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:12:50,629 INFO L124 PetriNetUnfolderBase]: 3568/5054 cut-off events. [2023-08-26 21:12:50,629 INFO L125 PetriNetUnfolderBase]: For 1408/1415 co-relation queries the response was YES. [2023-08-26 21:12:50,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12329 conditions, 5054 events. 3568/5054 cut-off events. For 1408/1415 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 25308 event pairs, 765 based on Foata normal form. 4/4516 useless extension candidates. Maximal degree in co-relation 12317. Up to 2186 conditions per place. [2023-08-26 21:12:50,655 INFO L140 encePairwiseOnDemand]: 252/261 looper letters, 61 selfloop transitions, 9 changer transitions 0/74 dead transitions. [2023-08-26 21:12:50,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 74 transitions, 350 flow [2023-08-26 21:12:50,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:12:50,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:12:50,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 530 transitions. [2023-08-26 21:12:50,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5076628352490421 [2023-08-26 21:12:50,658 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 530 transitions. [2023-08-26 21:12:50,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 530 transitions. [2023-08-26 21:12:50,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:12:50,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 530 transitions. [2023-08-26 21:12:50,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states 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,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 261.0) internal successors, (1305), 5 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states 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,663 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 261.0) internal successors, (1305), 5 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states 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,663 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 116 flow. Second operand 4 states and 530 transitions. [2023-08-26 21:12:50,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 74 transitions, 350 flow [2023-08-26 21:12:50,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 74 transitions, 344 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:12:50,667 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 168 flow [2023-08-26 21:12:50,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=168, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-08-26 21:12:50,668 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2023-08-26 21:12:50,669 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 168 flow [2023-08-26 21:12:50,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:12:50,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:12:50,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:12:50,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 21:12:50,670 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:12:50,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:12:50,670 INFO L85 PathProgramCache]: Analyzing trace with hash -719785854, now seen corresponding path program 1 times [2023-08-26 21:12:50,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:12:50,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961253422] [2023-08-26 21:12:50,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:12:50,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:12:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:12:50,874 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,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:12:50,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961253422] [2023-08-26 21:12:50,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961253422] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:12:50,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:12:50,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:12:50,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291878146] [2023-08-26 21:12:50,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:12:50,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:12:50,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:12:50,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:12:50,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:12:50,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 261 [2023-08-26 21:12:50,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:12:50,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:12:50,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 261 [2023-08-26 21:12:50,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:12:52,606 INFO L124 PetriNetUnfolderBase]: 16253/22242 cut-off events. [2023-08-26 21:12:52,606 INFO L125 PetriNetUnfolderBase]: For 16473/16473 co-relation queries the response was YES. [2023-08-26 21:12:52,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61033 conditions, 22242 events. 16253/22242 cut-off events. For 16473/16473 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 117561 event pairs, 4454 based on Foata normal form. 0/20618 useless extension candidates. Maximal degree in co-relation 61020. Up to 11370 conditions per place. [2023-08-26 21:12:52,767 INFO L140 encePairwiseOnDemand]: 250/261 looper letters, 114 selfloop transitions, 18 changer transitions 0/132 dead transitions. [2023-08-26 21:12:52,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 132 transitions, 848 flow [2023-08-26 21:12:52,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:12:52,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:12:52,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 632 transitions. [2023-08-26 21:12:52,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4842911877394636 [2023-08-26 21:12:52,770 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 632 transitions. [2023-08-26 21:12:52,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 632 transitions. [2023-08-26 21:12:52,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:12:52,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 632 transitions. [2023-08-26 21:12:52,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states 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,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states 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,776 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states 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,776 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 168 flow. Second operand 5 states and 632 transitions. [2023-08-26 21:12:52,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 132 transitions, 848 flow [2023-08-26 21:12:52,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 132 transitions, 782 flow, removed 16 selfloop flow, removed 2 redundant places. [2023-08-26 21:12:52,793 INFO L231 Difference]: Finished difference. Result has 54 places, 57 transitions, 294 flow [2023-08-26 21:12:52,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=294, PETRI_PLACES=54, PETRI_TRANSITIONS=57} [2023-08-26 21:12:52,795 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2023-08-26 21:12:52,795 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 57 transitions, 294 flow [2023-08-26 21:12:52,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:12:52,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:12:52,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:12:52,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 21:12:52,796 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:12:52,797 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:12:52,797 INFO L85 PathProgramCache]: Analyzing trace with hash -838579841, now seen corresponding path program 1 times [2023-08-26 21:12:52,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:12:52,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981652812] [2023-08-26 21:12:52,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:12:52,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:12:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:12:52,961 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,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:12:52,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981652812] [2023-08-26 21:12:52,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981652812] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:12:52,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:12:52,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:12:52,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188216629] [2023-08-26 21:12:52,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:12:52,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:12:52,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:12:52,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:12:52,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:12:52,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 261 [2023-08-26 21:12:52,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 57 transitions, 294 flow. Second operand has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states 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,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:12:52,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 261 [2023-08-26 21:12:52,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:12:54,545 INFO L124 PetriNetUnfolderBase]: 13777/19814 cut-off events. [2023-08-26 21:12:54,545 INFO L125 PetriNetUnfolderBase]: For 25611/26777 co-relation queries the response was YES. [2023-08-26 21:12:54,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67446 conditions, 19814 events. 13777/19814 cut-off events. For 25611/26777 co-relation queries the response was YES. Maximal size of possible extension queue 823. Compared 120505 event pairs, 3095 based on Foata normal form. 870/19125 useless extension candidates. Maximal degree in co-relation 67429. Up to 8093 conditions per place. [2023-08-26 21:12:54,674 INFO L140 encePairwiseOnDemand]: 256/261 looper letters, 110 selfloop transitions, 11 changer transitions 0/133 dead transitions. [2023-08-26 21:12:54,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 133 transitions, 940 flow [2023-08-26 21:12:54,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:12:54,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:12:54,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 650 transitions. [2023-08-26 21:12:54,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49808429118773945 [2023-08-26 21:12:54,676 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 650 transitions. [2023-08-26 21:12:54,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 650 transitions. [2023-08-26 21:12:54,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:12:54,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 650 transitions. [2023-08-26 21:12:54,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 0 states 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:54,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states 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:54,681 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states 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:54,681 INFO L175 Difference]: Start difference. First operand has 54 places, 57 transitions, 294 flow. Second operand 5 states and 650 transitions. [2023-08-26 21:12:54,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 133 transitions, 940 flow [2023-08-26 21:12:54,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 133 transitions, 940 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 21:12:54,701 INFO L231 Difference]: Finished difference. Result has 62 places, 64 transitions, 392 flow [2023-08-26 21:12:54,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=392, PETRI_PLACES=62, PETRI_TRANSITIONS=64} [2023-08-26 21:12:54,701 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 12 predicate places. [2023-08-26 21:12:54,702 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 64 transitions, 392 flow [2023-08-26 21:12:54,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states 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:54,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:12:54,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:12:54,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 21:12:54,702 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:12:54,703 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:12:54,703 INFO L85 PathProgramCache]: Analyzing trace with hash -279248356, now seen corresponding path program 1 times [2023-08-26 21:12:54,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:12:54,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171135443] [2023-08-26 21:12:54,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:12:54,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:12:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:12:54,851 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:54,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:12:54,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171135443] [2023-08-26 21:12:54,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171135443] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:12:54,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:12:54,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:12:54,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008467507] [2023-08-26 21:12:54,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:12:54,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:12:54,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:12:54,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:12:54,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:12:54,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 261 [2023-08-26 21:12:54,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 64 transitions, 392 flow. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:12:54,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:12:54,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 261 [2023-08-26 21:12:54,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:12:56,889 INFO L124 PetriNetUnfolderBase]: 18876/26696 cut-off events. [2023-08-26 21:12:56,889 INFO L125 PetriNetUnfolderBase]: For 61477/61523 co-relation queries the response was YES. [2023-08-26 21:12:56,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101250 conditions, 26696 events. 18876/26696 cut-off events. For 61477/61523 co-relation queries the response was YES. Maximal size of possible extension queue 927. Compared 156503 event pairs, 4916 based on Foata normal form. 567/25905 useless extension candidates. Maximal degree in co-relation 101227. Up to 14778 conditions per place. [2023-08-26 21:12:57,106 INFO L140 encePairwiseOnDemand]: 255/261 looper letters, 123 selfloop transitions, 19 changer transitions 0/148 dead transitions. [2023-08-26 21:12:57,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 148 transitions, 1154 flow [2023-08-26 21:12:57,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:12:57,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:12:57,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 645 transitions. [2023-08-26 21:12:57,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4942528735632184 [2023-08-26 21:12:57,110 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 645 transitions. [2023-08-26 21:12:57,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 645 transitions. [2023-08-26 21:12:57,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:12:57,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 645 transitions. [2023-08-26 21:12:57,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.0) internal successors, (645), 5 states have internal predecessors, (645), 0 states have call successors, (0), 0 states 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:57,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states 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:57,114 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states 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:57,114 INFO L175 Difference]: Start difference. First operand has 62 places, 64 transitions, 392 flow. Second operand 5 states and 645 transitions. [2023-08-26 21:12:57,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 148 transitions, 1154 flow [2023-08-26 21:12:57,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 148 transitions, 1154 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 21:12:57,199 INFO L231 Difference]: Finished difference. Result has 70 places, 80 transitions, 618 flow [2023-08-26 21:12:57,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=618, PETRI_PLACES=70, PETRI_TRANSITIONS=80} [2023-08-26 21:12:57,200 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 20 predicate places. [2023-08-26 21:12:57,200 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 80 transitions, 618 flow [2023-08-26 21:12:57,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:12:57,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:12:57,201 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:12:57,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 21:12:57,201 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:12:57,201 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:12:57,201 INFO L85 PathProgramCache]: Analyzing trace with hash -66098541, now seen corresponding path program 1 times [2023-08-26 21:12:57,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:12:57,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67435932] [2023-08-26 21:12:57,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:12:57,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:12:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:12:57,448 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:57,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:12:57,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67435932] [2023-08-26 21:12:57,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67435932] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:12:57,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:12:57,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:12:57,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679424538] [2023-08-26 21:12:57,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:12:57,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:12:57,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:12:57,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:12:57,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:12:57,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 261 [2023-08-26 21:12:57,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 80 transitions, 618 flow. Second operand has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 states 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:57,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:12:57,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 261 [2023-08-26 21:12:57,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:00,255 INFO L124 PetriNetUnfolderBase]: 23191/31827 cut-off events. [2023-08-26 21:13:00,256 INFO L125 PetriNetUnfolderBase]: For 122397/122397 co-relation queries the response was YES. [2023-08-26 21:13:00,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135758 conditions, 31827 events. 23191/31827 cut-off events. For 122397/122397 co-relation queries the response was YES. Maximal size of possible extension queue 989. Compared 178688 event pairs, 2445 based on Foata normal form. 505/30871 useless extension candidates. Maximal degree in co-relation 135729. Up to 10895 conditions per place. [2023-08-26 21:13:00,775 INFO L140 encePairwiseOnDemand]: 251/261 looper letters, 201 selfloop transitions, 35 changer transitions 0/236 dead transitions. [2023-08-26 21:13:00,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 236 transitions, 2078 flow [2023-08-26 21:13:00,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:13:00,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:13:00,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 873 transitions. [2023-08-26 21:13:00,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47783251231527096 [2023-08-26 21:13:00,781 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 873 transitions. [2023-08-26 21:13:00,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 873 transitions. [2023-08-26 21:13:00,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:00,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 873 transitions. [2023-08-26 21:13:00,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.71428571428571) internal successors, (873), 7 states have internal predecessors, (873), 0 states have call successors, (0), 0 states 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:00,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 261.0) internal successors, (2088), 8 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states 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:00,787 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 261.0) internal successors, (2088), 8 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states 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:00,787 INFO L175 Difference]: Start difference. First operand has 70 places, 80 transitions, 618 flow. Second operand 7 states and 873 transitions. [2023-08-26 21:13:00,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 236 transitions, 2078 flow [2023-08-26 21:13:00,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 236 transitions, 2076 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-26 21:13:00,986 INFO L231 Difference]: Finished difference. Result has 82 places, 104 transitions, 1010 flow [2023-08-26 21:13:00,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1010, PETRI_PLACES=82, PETRI_TRANSITIONS=104} [2023-08-26 21:13:00,987 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 32 predicate places. [2023-08-26 21:13:00,987 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 104 transitions, 1010 flow [2023-08-26 21:13:00,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 states 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:00,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:00,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:00,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 21:13:00,989 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:13:00,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:00,989 INFO L85 PathProgramCache]: Analyzing trace with hash 2014872226, now seen corresponding path program 1 times [2023-08-26 21:13:00,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:00,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547919866] [2023-08-26 21:13:00,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:00,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:01,051 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:01,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:01,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547919866] [2023-08-26 21:13:01,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547919866] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:01,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:01,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:13:01,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391210476] [2023-08-26 21:13:01,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:01,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:13:01,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:01,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:13:01,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:13:01,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 261 [2023-08-26 21:13:01,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 104 transitions, 1010 flow. Second operand has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states 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:01,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:01,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 261 [2023-08-26 21:13:01,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:03,149 INFO L124 PetriNetUnfolderBase]: 15580/21933 cut-off events. [2023-08-26 21:13:03,149 INFO L125 PetriNetUnfolderBase]: For 139636/145283 co-relation queries the response was YES. [2023-08-26 21:13:03,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101150 conditions, 21933 events. 15580/21933 cut-off events. For 139636/145283 co-relation queries the response was YES. Maximal size of possible extension queue 1160. Compared 137103 event pairs, 2219 based on Foata normal form. 1896/22747 useless extension candidates. Maximal degree in co-relation 101113. Up to 8315 conditions per place. [2023-08-26 21:13:03,346 INFO L140 encePairwiseOnDemand]: 252/261 looper letters, 226 selfloop transitions, 13 changer transitions 0/264 dead transitions. [2023-08-26 21:13:03,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 264 transitions, 3156 flow [2023-08-26 21:13:03,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:13:03,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:13:03,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 662 transitions. [2023-08-26 21:13:03,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5072796934865901 [2023-08-26 21:13:03,348 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 662 transitions. [2023-08-26 21:13:03,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 662 transitions. [2023-08-26 21:13:03,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:03,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 662 transitions. [2023-08-26 21:13:03,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 0 states 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:03,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states 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:03,352 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states 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:03,352 INFO L175 Difference]: Start difference. First operand has 82 places, 104 transitions, 1010 flow. Second operand 5 states and 662 transitions. [2023-08-26 21:13:03,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 264 transitions, 3156 flow [2023-08-26 21:13:03,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 264 transitions, 3142 flow, removed 7 selfloop flow, removed 0 redundant places. [2023-08-26 21:13:03,730 INFO L231 Difference]: Finished difference. Result has 87 places, 108 transitions, 1076 flow [2023-08-26 21:13:03,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=1002, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1076, PETRI_PLACES=87, PETRI_TRANSITIONS=108} [2023-08-26 21:13:03,730 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 37 predicate places. [2023-08-26 21:13:03,731 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 108 transitions, 1076 flow [2023-08-26 21:13:03,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states 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:03,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:03,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:03,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 21:13:03,731 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:13:03,732 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:03,732 INFO L85 PathProgramCache]: Analyzing trace with hash 537737117, now seen corresponding path program 1 times [2023-08-26 21:13:03,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:03,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938452842] [2023-08-26 21:13:03,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:03,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:03,867 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:03,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:03,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938452842] [2023-08-26 21:13:03,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938452842] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:03,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:03,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:13:03,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784084525] [2023-08-26 21:13:03,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:03,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:13:03,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:03,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:13:03,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:13:03,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 261 [2023-08-26 21:13:03,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 108 transitions, 1076 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states 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:03,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:03,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 261 [2023-08-26 21:13:03,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:04,993 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([557] L776-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_79 (+ v_~__unbuffered_cnt~0_80 1)) (= |v_P1Thread1of1ForFork1_#res.base_7| 0) (<= 0 (+ 2147483649 v_~__unbuffered_cnt~0_80)) (<= v_~__unbuffered_cnt~0_80 2147483646)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base][35], [139#$Ultimate##0true, Black: 186#true, 189#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 191#(and (= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 188#(= ~__unbuffered_p3_EAX~0 0), 102#P1EXITtrue, Black: 199#(= ~x~0 0), Black: 202#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 167#(<= 1 ~__unbuffered_cnt~0), Black: 197#true, P3Thread1of1ForFork0InUse, 231#true, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, Black: 211#(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: 214#(and (= ~__unbuffered_p1_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 208#true, 228#(<= ~__unbuffered_cnt~0 2), Black: 210#(= ~__unbuffered_p1_EAX~0 0), Black: 216#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (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: 157#(= ~__unbuffered_cnt~0 0), 120#P0EXITtrue, 3#ULTIMATE.startEXITtrue, 36#L842true, Black: 172#(<= ~__unbuffered_cnt~0 1), 200#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 177#(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: 175#true, Black: 180#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (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)))), 212#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 178#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))]) [2023-08-26 21:13:04,993 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:13:04,993 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:13:04,993 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:13:04,994 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:13:05,159 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([469] L788-->L804: Formula: (let ((.cse5 (= (mod v_~z$r_buff1_thd3~0_44 256) 0)) (.cse10 (= (mod v_~z$r_buff0_thd3~0_44 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse2 (and .cse5 .cse10)) (.cse3 (and .cse10 (= (mod v_~z$w_buff1_used~0_103 256) 0)))) (let ((.cse8 (or .cse12 .cse2 .cse3)) (.cse9 (and (not .cse12) .cse11))) (let ((.cse7 (ite .cse8 v_~z~0_112 (ite .cse9 v_~z$w_buff0~0_47 v_~z$w_buff1~0_50))) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_115 256) 0))) (and (= v_~z$w_buff1_used~0_102 (ite .cse0 v_~z$w_buff1_used~0_103 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_103 0))) (= v_~z$r_buff1_thd3~0_43 (ite .cse0 v_~z$r_buff1_thd3~0_44 (ite (let ((.cse4 (= (mod v_~z$r_buff0_thd3~0_43 256) 0))) (or .cse1 (and .cse4 .cse5) (and .cse4 .cse6))) v_~z$r_buff1_thd3~0_44 0))) (= v_~z$mem_tmp~0_46 v_~z~0_112) (= .cse7 v_~__unbuffered_p2_EAX~0_14) (= v_~z$w_buff1~0_49 v_~z$w_buff1~0_50) (= v_~z$w_buff0_used~0_115 (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse8 v_~z$w_buff0_used~0_116 (ite .cse9 0 v_~z$w_buff0_used~0_116)))) (= (ite .cse0 v_~z$mem_tmp~0_46 .cse7) v_~z~0_110) (= v_~z$flush_delayed~0_66 0) (= v_~z$r_buff0_thd3~0_43 (ite .cse0 v_~z$r_buff0_thd3~0_44 (ite (or (and .cse6 .cse10) .cse1 .cse2) v_~z$r_buff0_thd3~0_44 (ite (and .cse11 (not .cse1)) 0 v_~z$r_buff0_thd3~0_44)))) (= v_~z$w_buff0~0_47 v_~z$w_buff0~0_46)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_103, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_112} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_46, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_46, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_102, ~z$w_buff1~0=v_~z$w_buff1~0_49, P2Thread1of1ForFork2_#t~nondet4=|v_P2Thread1of1ForFork2_#t~nondet4_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, P2Thread1of1ForFork2_#t~nondet3=|v_P2Thread1of1ForFork2_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_18, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~z~0=v_~z~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_62} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork2_#t~nondet4, ~z$flush_delayed~0, P2Thread1of1ForFork2_#t~nondet3, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0][55], [Black: 186#true, 189#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 191#(and (= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 188#(= ~__unbuffered_p3_EAX~0 0), Black: 199#(= ~x~0 0), Black: 202#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 167#(<= 1 ~__unbuffered_cnt~0), 119#L776true, Black: 197#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 231#true, P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, Black: 211#(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: 214#(and (= ~__unbuffered_p1_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 208#true, Black: 210#(= ~__unbuffered_p1_EAX~0 0), Black: 216#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (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: 157#(= ~__unbuffered_cnt~0 0), 120#P0EXITtrue, 172#(<= ~__unbuffered_cnt~0 1), Black: 228#(<= ~__unbuffered_cnt~0 2), 3#ULTIMATE.startEXITtrue, 36#L842true, 227#(<= ~__unbuffered_cnt~0 1), 200#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 177#(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: 175#true, Black: 180#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (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)))), 127#L804true, 212#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 178#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))]) [2023-08-26 21:13:05,159 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 21:13:05,159 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:13:05,160 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:13:05,160 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:13:05,160 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([557] L776-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_79 (+ v_~__unbuffered_cnt~0_80 1)) (= |v_P1Thread1of1ForFork1_#res.base_7| 0) (<= 0 (+ 2147483649 v_~__unbuffered_cnt~0_80)) (<= v_~__unbuffered_cnt~0_80 2147483646)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base][35], [30#L788true, Black: 186#true, 189#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 191#(and (= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 188#(= ~__unbuffered_p3_EAX~0 0), 102#P1EXITtrue, Black: 199#(= ~x~0 0), Black: 202#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 167#(<= 1 ~__unbuffered_cnt~0), Black: 197#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 231#true, P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, Black: 211#(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: 214#(and (= ~__unbuffered_p1_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 208#true, Black: 210#(= ~__unbuffered_p1_EAX~0 0), 228#(<= ~__unbuffered_cnt~0 2), Black: 216#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (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: 157#(= ~__unbuffered_cnt~0 0), 120#P0EXITtrue, 3#ULTIMATE.startEXITtrue, 36#L842true, Black: 172#(<= ~__unbuffered_cnt~0 1), 200#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 177#(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: 175#true, Black: 180#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (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)))), 212#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 178#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))]) [2023-08-26 21:13:05,160 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 21:13:05,160 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:13:05,160 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:13:05,160 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:13:05,161 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([557] L776-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_79 (+ v_~__unbuffered_cnt~0_80 1)) (= |v_P1Thread1of1ForFork1_#res.base_7| 0) (<= 0 (+ 2147483649 v_~__unbuffered_cnt~0_80)) (<= v_~__unbuffered_cnt~0_80 2147483646)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base][81], [Black: 189#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 186#true, Black: 188#(= ~__unbuffered_p3_EAX~0 0), 44#P2EXITtrue, 102#P1EXITtrue, Black: 199#(= ~x~0 0), Black: 202#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 167#(<= 1 ~__unbuffered_cnt~0), Black: 197#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 231#true, P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, Black: 211#(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))), 46#$Ultimate##0true, Black: 214#(and (= ~__unbuffered_p1_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 208#true, Black: 210#(= ~__unbuffered_p1_EAX~0 0), Black: 216#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (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: 157#(= ~__unbuffered_cnt~0 0), 120#P0EXITtrue, 224#true, Black: 228#(<= ~__unbuffered_cnt~0 2), 3#ULTIMATE.startEXITtrue, 191#(and (= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 172#(<= ~__unbuffered_cnt~0 1), 200#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 177#(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: 175#true, Black: 180#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (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)))), 178#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 212#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))]) [2023-08-26 21:13:05,161 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 21:13:05,161 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:13:05,161 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:13:05,161 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:13:05,324 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([478] L826-->L842: Formula: (let ((.cse7 (= 0 (mod v_~z$r_buff1_thd4~0_56 256))) (.cse4 (= (mod v_~z$r_buff0_thd4~0_67 256) 0))) (let ((.cse5 (not .cse4)) (.cse1 (and .cse4 .cse7)) (.cse11 (= (mod v_~z$w_buff0_used~0_122 256) 0)) (.cse10 (and .cse4 (= (mod v_~z$w_buff1_used~0_109 256) 0)))) (let ((.cse3 (= (mod v_~z$w_buff1_used~0_108 256) 0)) (.cse2 (= (mod v_~z$w_buff0_used~0_121 256) 0)) (.cse0 (not (= 0 (mod v_~weak$$choice2~0_66 256)))) (.cse8 (or .cse1 .cse11 .cse10)) (.cse9 (and .cse5 (not .cse11)))) (and (= v_~z$mem_tmp~0_50 v_~z~0_122) (= v_~z$r_buff0_thd4~0_66 (ite .cse0 v_~z$r_buff0_thd4~0_67 (ite (or .cse1 .cse2 (and .cse3 .cse4)) v_~z$r_buff0_thd4~0_67 (ite (and (not .cse2) .cse5) 0 v_~z$r_buff0_thd4~0_67)))) (= (ite .cse0 v_~z$r_buff1_thd4~0_56 (ite (let ((.cse6 (= (mod v_~z$r_buff0_thd4~0_66 256) 0))) (or .cse2 (and .cse6 .cse3) (and .cse6 .cse7))) v_~z$r_buff1_thd4~0_56 0)) v_~z$r_buff1_thd4~0_55) (= v_~z$w_buff0_used~0_121 (ite .cse0 v_~z$w_buff0_used~0_122 (ite .cse8 v_~z$w_buff0_used~0_122 (ite .cse9 0 v_~z$w_buff0_used~0_122)))) (= v_~z$w_buff0~0_55 v_~z$w_buff0~0_54) (= v_~z$w_buff1_used~0_108 (ite .cse0 v_~z$w_buff1_used~0_109 (ite (or .cse1 .cse2 .cse10) v_~z$w_buff1_used~0_109 0))) (= (ite .cse0 v_~z$mem_tmp~0_50 v_~__unbuffered_p3_EAX~0_14) v_~z~0_120) (= (ite .cse8 v_~z~0_122 (ite .cse9 v_~z$w_buff0~0_55 v_~z$w_buff1~0_56)) v_~__unbuffered_p3_EAX~0_14) (= v_~z$w_buff1~0_56 v_~z$w_buff1~0_55) (= v_~z$flush_delayed~0_72 0))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_56, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_122, ~z$w_buff0~0=v_~z$w_buff0~0_55, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_67, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_109, ~z$w_buff1~0=v_~z$w_buff1~0_56, ~z~0=v_~z~0_122} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_50, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_55, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_121, ~z$w_buff0~0=v_~z$w_buff0~0_54, P3Thread1of1ForFork0_#t~nondet6#1=|v_P3Thread1of1ForFork0_#t~nondet6#1_1|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_108, ~z$w_buff1~0=v_~z$w_buff1~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_72, P3Thread1of1ForFork0_#t~nondet5#1=|v_P3Thread1of1ForFork0_#t~nondet5#1_1|, ~weak$$choice0~0=v_~weak$$choice0~0_22, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_66, ~z~0=v_~z~0_120, ~weak$$choice2~0=v_~weak$$choice2~0_66} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, P3Thread1of1ForFork0_#t~nondet6#1, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, P3Thread1of1ForFork0_#t~nondet5#1, ~weak$$choice0~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~z~0, ~weak$$choice2~0][119], [Black: 186#true, 189#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 191#(and (= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 188#(= ~__unbuffered_p3_EAX~0 0), 44#P2EXITtrue, Black: 199#(= ~x~0 0), Black: 202#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 167#(<= 1 ~__unbuffered_cnt~0), Black: 197#true, 119#L776true, P3Thread1of1ForFork0InUse, 231#true, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, Black: 211#(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: 214#(and (= ~__unbuffered_p1_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 208#true, Black: 210#(= ~__unbuffered_p1_EAX~0 0), 228#(<= ~__unbuffered_cnt~0 2), Black: 216#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (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: 157#(= ~__unbuffered_cnt~0 0), 120#P0EXITtrue, 3#ULTIMATE.startEXITtrue, 36#L842true, Black: 172#(<= ~__unbuffered_cnt~0 1), 200#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 177#(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: 175#true, Black: 180#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (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)))), 212#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 178#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))]) [2023-08-26 21:13:05,324 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-26 21:13:05,324 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:13:05,325 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:13:05,325 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:13:05,325 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([557] L776-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_79 (+ v_~__unbuffered_cnt~0_80 1)) (= |v_P1Thread1of1ForFork1_#res.base_7| 0) (<= 0 (+ 2147483649 v_~__unbuffered_cnt~0_80)) (<= v_~__unbuffered_cnt~0_80 2147483646)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base][81], [Black: 189#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 186#true, Black: 188#(= ~__unbuffered_p3_EAX~0 0), 44#P2EXITtrue, 102#P1EXITtrue, Black: 199#(= ~x~0 0), Black: 202#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 167#(<= 1 ~__unbuffered_cnt~0), Black: 197#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 231#true, P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, Black: 211#(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: 214#(and (= ~__unbuffered_p1_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 208#true, Black: 210#(= ~__unbuffered_p1_EAX~0 0), Black: 216#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (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: 157#(= ~__unbuffered_cnt~0 0), 120#P0EXITtrue, 224#true, Black: 228#(<= ~__unbuffered_cnt~0 2), 3#ULTIMATE.startEXITtrue, 191#(and (= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 172#(<= ~__unbuffered_cnt~0 1), 200#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 177#(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: 175#true, Black: 180#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (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)))), 123#L826true, 212#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 178#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))]) [2023-08-26 21:13:05,325 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-26 21:13:05,325 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:13:05,325 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:13:05,325 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:13:05,328 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([469] L788-->L804: Formula: (let ((.cse5 (= (mod v_~z$r_buff1_thd3~0_44 256) 0)) (.cse10 (= (mod v_~z$r_buff0_thd3~0_44 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse2 (and .cse5 .cse10)) (.cse3 (and .cse10 (= (mod v_~z$w_buff1_used~0_103 256) 0)))) (let ((.cse8 (or .cse12 .cse2 .cse3)) (.cse9 (and (not .cse12) .cse11))) (let ((.cse7 (ite .cse8 v_~z~0_112 (ite .cse9 v_~z$w_buff0~0_47 v_~z$w_buff1~0_50))) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_115 256) 0))) (and (= v_~z$w_buff1_used~0_102 (ite .cse0 v_~z$w_buff1_used~0_103 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_103 0))) (= v_~z$r_buff1_thd3~0_43 (ite .cse0 v_~z$r_buff1_thd3~0_44 (ite (let ((.cse4 (= (mod v_~z$r_buff0_thd3~0_43 256) 0))) (or .cse1 (and .cse4 .cse5) (and .cse4 .cse6))) v_~z$r_buff1_thd3~0_44 0))) (= v_~z$mem_tmp~0_46 v_~z~0_112) (= .cse7 v_~__unbuffered_p2_EAX~0_14) (= v_~z$w_buff1~0_49 v_~z$w_buff1~0_50) (= v_~z$w_buff0_used~0_115 (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse8 v_~z$w_buff0_used~0_116 (ite .cse9 0 v_~z$w_buff0_used~0_116)))) (= (ite .cse0 v_~z$mem_tmp~0_46 .cse7) v_~z~0_110) (= v_~z$flush_delayed~0_66 0) (= v_~z$r_buff0_thd3~0_43 (ite .cse0 v_~z$r_buff0_thd3~0_44 (ite (or (and .cse6 .cse10) .cse1 .cse2) v_~z$r_buff0_thd3~0_44 (ite (and .cse11 (not .cse1)) 0 v_~z$r_buff0_thd3~0_44)))) (= v_~z$w_buff0~0_47 v_~z$w_buff0~0_46)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_103, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_112} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_46, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_46, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_102, ~z$w_buff1~0=v_~z$w_buff1~0_49, P2Thread1of1ForFork2_#t~nondet4=|v_P2Thread1of1ForFork2_#t~nondet4_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, P2Thread1of1ForFork2_#t~nondet3=|v_P2Thread1of1ForFork2_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_18, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~z~0=v_~z~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_62} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork2_#t~nondet4, ~z$flush_delayed~0, P2Thread1of1ForFork2_#t~nondet3, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0][55], [Black: 186#true, Black: 191#(and (= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 189#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 188#(= ~__unbuffered_p3_EAX~0 0), 91#L845true, Black: 199#(= ~x~0 0), Black: 202#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 167#(<= 1 ~__unbuffered_cnt~0), Black: 197#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 231#true, P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, Black: 211#(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: 214#(and (= ~__unbuffered_p1_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 208#true, Black: 210#(= ~__unbuffered_p1_EAX~0 0), Black: 216#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (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: 157#(= ~__unbuffered_cnt~0 0), 120#P0EXITtrue, 172#(<= ~__unbuffered_cnt~0 1), Black: 228#(<= ~__unbuffered_cnt~0 2), 3#ULTIMATE.startEXITtrue, 227#(<= ~__unbuffered_cnt~0 1), 200#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 177#(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: 175#true, Black: 180#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (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)))), 127#L804true, 212#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 178#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 55#L773true]) [2023-08-26 21:13:05,328 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2023-08-26 21:13:05,328 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-08-26 21:13:05,329 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-08-26 21:13:05,329 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-08-26 21:13:05,343 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([469] L788-->L804: Formula: (let ((.cse5 (= (mod v_~z$r_buff1_thd3~0_44 256) 0)) (.cse10 (= (mod v_~z$r_buff0_thd3~0_44 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse2 (and .cse5 .cse10)) (.cse3 (and .cse10 (= (mod v_~z$w_buff1_used~0_103 256) 0)))) (let ((.cse8 (or .cse12 .cse2 .cse3)) (.cse9 (and (not .cse12) .cse11))) (let ((.cse7 (ite .cse8 v_~z~0_112 (ite .cse9 v_~z$w_buff0~0_47 v_~z$w_buff1~0_50))) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_115 256) 0))) (and (= v_~z$w_buff1_used~0_102 (ite .cse0 v_~z$w_buff1_used~0_103 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_103 0))) (= v_~z$r_buff1_thd3~0_43 (ite .cse0 v_~z$r_buff1_thd3~0_44 (ite (let ((.cse4 (= (mod v_~z$r_buff0_thd3~0_43 256) 0))) (or .cse1 (and .cse4 .cse5) (and .cse4 .cse6))) v_~z$r_buff1_thd3~0_44 0))) (= v_~z$mem_tmp~0_46 v_~z~0_112) (= .cse7 v_~__unbuffered_p2_EAX~0_14) (= v_~z$w_buff1~0_49 v_~z$w_buff1~0_50) (= v_~z$w_buff0_used~0_115 (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse8 v_~z$w_buff0_used~0_116 (ite .cse9 0 v_~z$w_buff0_used~0_116)))) (= (ite .cse0 v_~z$mem_tmp~0_46 .cse7) v_~z~0_110) (= v_~z$flush_delayed~0_66 0) (= v_~z$r_buff0_thd3~0_43 (ite .cse0 v_~z$r_buff0_thd3~0_44 (ite (or (and .cse6 .cse10) .cse1 .cse2) v_~z$r_buff0_thd3~0_44 (ite (and .cse11 (not .cse1)) 0 v_~z$r_buff0_thd3~0_44)))) (= v_~z$w_buff0~0_47 v_~z$w_buff0~0_46)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_103, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_112} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_46, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_46, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_102, ~z$w_buff1~0=v_~z$w_buff1~0_49, P2Thread1of1ForFork2_#t~nondet4=|v_P2Thread1of1ForFork2_#t~nondet4_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, P2Thread1of1ForFork2_#t~nondet3=|v_P2Thread1of1ForFork2_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_18, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~z~0=v_~z~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_62} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork2_#t~nondet4, ~z$flush_delayed~0, P2Thread1of1ForFork2_#t~nondet3, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0][55], [Black: 186#true, Black: 191#(and (= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 189#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 188#(= ~__unbuffered_p3_EAX~0 0), 91#L845true, Black: 199#(= ~x~0 0), Black: 202#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 167#(<= 1 ~__unbuffered_cnt~0), Black: 197#true, 119#L776true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 231#true, P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, Black: 211#(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: 214#(and (= ~__unbuffered_p1_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 208#true, Black: 210#(= ~__unbuffered_p1_EAX~0 0), Black: 216#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (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: 157#(= ~__unbuffered_cnt~0 0), 120#P0EXITtrue, 172#(<= ~__unbuffered_cnt~0 1), Black: 228#(<= ~__unbuffered_cnt~0 2), 3#ULTIMATE.startEXITtrue, 227#(<= ~__unbuffered_cnt~0 1), 200#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 177#(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: 175#true, Black: 180#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (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)))), 127#L804true, 178#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 212#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))]) [2023-08-26 21:13:05,343 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-26 21:13:05,343 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:13:05,343 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:13:05,343 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:13:05,399 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([452] L755-->L758: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0][135], [Black: 186#true, Black: 191#(and (= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 189#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 188#(= ~__unbuffered_p3_EAX~0 0), 44#P2EXITtrue, 91#L845true, Black: 199#(= ~x~0 0), Black: 202#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 167#(<= 1 ~__unbuffered_cnt~0), Black: 197#true, 119#L776true, P3Thread1of1ForFork0InUse, 231#true, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, 180#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (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)))), P1Thread1of1ForFork1InUse, Black: 211#(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: 214#(and (= ~__unbuffered_p1_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 208#true, Black: 210#(= ~__unbuffered_p1_EAX~0 0), Black: 212#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 23#L758true, Black: 157#(= ~__unbuffered_cnt~0 0), 172#(<= ~__unbuffered_cnt~0 1), Black: 228#(<= ~__unbuffered_cnt~0 2), 3#ULTIMATE.startEXITtrue, 227#(<= ~__unbuffered_cnt~0 1), 200#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 177#(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: 175#true, Black: 178#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 216#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (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))))]) [2023-08-26 21:13:05,399 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-26 21:13:05,399 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:13:05,399 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:13:05,399 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:13:05,662 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([469] L788-->L804: Formula: (let ((.cse5 (= (mod v_~z$r_buff1_thd3~0_44 256) 0)) (.cse10 (= (mod v_~z$r_buff0_thd3~0_44 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse2 (and .cse5 .cse10)) (.cse3 (and .cse10 (= (mod v_~z$w_buff1_used~0_103 256) 0)))) (let ((.cse8 (or .cse12 .cse2 .cse3)) (.cse9 (and (not .cse12) .cse11))) (let ((.cse7 (ite .cse8 v_~z~0_112 (ite .cse9 v_~z$w_buff0~0_47 v_~z$w_buff1~0_50))) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_115 256) 0))) (and (= v_~z$w_buff1_used~0_102 (ite .cse0 v_~z$w_buff1_used~0_103 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_103 0))) (= v_~z$r_buff1_thd3~0_43 (ite .cse0 v_~z$r_buff1_thd3~0_44 (ite (let ((.cse4 (= (mod v_~z$r_buff0_thd3~0_43 256) 0))) (or .cse1 (and .cse4 .cse5) (and .cse4 .cse6))) v_~z$r_buff1_thd3~0_44 0))) (= v_~z$mem_tmp~0_46 v_~z~0_112) (= .cse7 v_~__unbuffered_p2_EAX~0_14) (= v_~z$w_buff1~0_49 v_~z$w_buff1~0_50) (= v_~z$w_buff0_used~0_115 (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse8 v_~z$w_buff0_used~0_116 (ite .cse9 0 v_~z$w_buff0_used~0_116)))) (= (ite .cse0 v_~z$mem_tmp~0_46 .cse7) v_~z~0_110) (= v_~z$flush_delayed~0_66 0) (= v_~z$r_buff0_thd3~0_43 (ite .cse0 v_~z$r_buff0_thd3~0_44 (ite (or (and .cse6 .cse10) .cse1 .cse2) v_~z$r_buff0_thd3~0_44 (ite (and .cse11 (not .cse1)) 0 v_~z$r_buff0_thd3~0_44)))) (= v_~z$w_buff0~0_47 v_~z$w_buff0~0_46)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_103, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_112} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_46, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_46, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_102, ~z$w_buff1~0=v_~z$w_buff1~0_49, P2Thread1of1ForFork2_#t~nondet4=|v_P2Thread1of1ForFork2_#t~nondet4_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, P2Thread1of1ForFork2_#t~nondet3=|v_P2Thread1of1ForFork2_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_18, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~z~0=v_~z~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_62} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork2_#t~nondet4, ~z$flush_delayed~0, P2Thread1of1ForFork2_#t~nondet3, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0][55], [Black: 186#true, Black: 191#(and (= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 189#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 188#(= ~__unbuffered_p3_EAX~0 0), 91#L845true, Black: 199#(= ~x~0 0), Black: 202#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 167#(<= 1 ~__unbuffered_cnt~0), Black: 197#true, 119#L776true, P3Thread1of1ForFork0InUse, 231#true, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, Black: 211#(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: 214#(and (= ~__unbuffered_p1_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 208#true, Black: 210#(= ~__unbuffered_p1_EAX~0 0), Black: 216#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (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: 157#(= ~__unbuffered_cnt~0 0), 120#P0EXITtrue, 172#(<= ~__unbuffered_cnt~0 1), Black: 228#(<= ~__unbuffered_cnt~0 2), 3#ULTIMATE.startEXITtrue, 227#(<= ~__unbuffered_cnt~0 1), 200#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 177#(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: 175#true, Black: 180#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (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)))), 127#L804true, 212#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 178#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))]) [2023-08-26 21:13:05,662 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is not cut-off event [2023-08-26 21:13:05,662 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-08-26 21:13:05,662 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-08-26 21:13:05,662 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-08-26 21:13:05,662 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-08-26 21:13:05,663 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([480] L845-->L852: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_83 256) 0))) (.cse4 (not (= (mod v_~z$r_buff1_thd4~0_44 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_53 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_84 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse4)) (.cse2 (and .cse3 .cse5))) (and (= v_~z~0_72 (ite .cse0 v_~z$w_buff0~0_26 (ite .cse1 v_~z$w_buff1~0_29 v_~z~0_73))) (= v_~z$r_buff0_thd4~0_52 (ite .cse2 0 v_~z$r_buff0_thd4~0_53)) (= (ite .cse0 0 v_~z$w_buff0_used~0_84) v_~z$w_buff0_used~0_83) (= (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd4~0_52 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse4)) 0 v_~z$r_buff1_thd4~0_44) v_~z$r_buff1_thd4~0_43) (= (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) v_~z$w_buff1_used~0_72)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_44, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_84, ~z$w_buff0~0=v_~z$w_buff0~0_26, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_53, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_29, ~z~0=v_~z~0_73} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_43, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_83, ~z$w_buff0~0=v_~z$w_buff0~0_26, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_52, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_29, ~z~0=v_~z~0_72} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][86], [Black: 186#true, Black: 191#(and (= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 189#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 188#(= ~__unbuffered_p3_EAX~0 0), Black: 199#(= ~x~0 0), Black: 202#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 167#(<= 1 ~__unbuffered_cnt~0), Black: 197#true, 119#L776true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 231#true, P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, Black: 211#(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: 214#(and (= ~__unbuffered_p1_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 208#true, Black: 210#(= ~__unbuffered_p1_EAX~0 0), Black: 216#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (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: 157#(= ~__unbuffered_cnt~0 0), 120#P0EXITtrue, 172#(<= ~__unbuffered_cnt~0 1), Black: 228#(<= ~__unbuffered_cnt~0 2), 3#ULTIMATE.startEXITtrue, 5#L852true, 227#(<= ~__unbuffered_cnt~0 1), 200#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 177#(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: 175#true, Black: 180#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (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)))), 127#L804true, 212#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 178#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))]) [2023-08-26 21:13:05,663 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-26 21:13:05,663 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-26 21:13:05,663 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-26 21:13:05,663 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-26 21:13:05,738 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([480] L845-->L852: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_83 256) 0))) (.cse4 (not (= (mod v_~z$r_buff1_thd4~0_44 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_53 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_84 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse4)) (.cse2 (and .cse3 .cse5))) (and (= v_~z~0_72 (ite .cse0 v_~z$w_buff0~0_26 (ite .cse1 v_~z$w_buff1~0_29 v_~z~0_73))) (= v_~z$r_buff0_thd4~0_52 (ite .cse2 0 v_~z$r_buff0_thd4~0_53)) (= (ite .cse0 0 v_~z$w_buff0_used~0_84) v_~z$w_buff0_used~0_83) (= (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd4~0_52 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse4)) 0 v_~z$r_buff1_thd4~0_44) v_~z$r_buff1_thd4~0_43) (= (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) v_~z$w_buff1_used~0_72)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_44, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_84, ~z$w_buff0~0=v_~z$w_buff0~0_26, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_53, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_29, ~z~0=v_~z~0_73} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_43, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_83, ~z$w_buff0~0=v_~z$w_buff0~0_26, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_52, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_29, ~z~0=v_~z~0_72} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][86], [Black: 186#true, Black: 191#(and (= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 189#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 188#(= ~__unbuffered_p3_EAX~0 0), 44#P2EXITtrue, Black: 199#(= ~x~0 0), Black: 202#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 167#(<= 1 ~__unbuffered_cnt~0), Black: 197#true, 119#L776true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 231#true, P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, Black: 211#(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: 214#(and (= ~__unbuffered_p1_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 208#true, Black: 210#(= ~__unbuffered_p1_EAX~0 0), 228#(<= ~__unbuffered_cnt~0 2), Black: 216#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (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: 157#(= ~__unbuffered_cnt~0 0), 120#P0EXITtrue, 3#ULTIMATE.startEXITtrue, Black: 172#(<= ~__unbuffered_cnt~0 1), 5#L852true, 200#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 177#(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: 175#true, Black: 180#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (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)))), 212#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 178#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))]) [2023-08-26 21:13:05,739 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-26 21:13:05,739 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-26 21:13:05,739 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-26 21:13:05,739 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-26 21:13:05,820 INFO L124 PetriNetUnfolderBase]: 9266/13814 cut-off events. [2023-08-26 21:13:05,820 INFO L125 PetriNetUnfolderBase]: For 85359/88151 co-relation queries the response was YES. [2023-08-26 21:13:05,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64648 conditions, 13814 events. 9266/13814 cut-off events. For 85359/88151 co-relation queries the response was YES. Maximal size of possible extension queue 735. Compared 87615 event pairs, 1612 based on Foata normal form. 1193/14176 useless extension candidates. Maximal degree in co-relation 64608. Up to 10260 conditions per place. [2023-08-26 21:13:05,937 INFO L140 encePairwiseOnDemand]: 254/261 looper letters, 133 selfloop transitions, 10 changer transitions 4/171 dead transitions. [2023-08-26 21:13:05,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 171 transitions, 1810 flow [2023-08-26 21:13:05,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:13:05,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:13:05,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2023-08-26 21:13:05,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48582375478927203 [2023-08-26 21:13:05,939 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 634 transitions. [2023-08-26 21:13:05,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 634 transitions. [2023-08-26 21:13:05,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:05,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 634 transitions. [2023-08-26 21:13:05,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states 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,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states 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,943 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states 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,943 INFO L175 Difference]: Start difference. First operand has 87 places, 108 transitions, 1076 flow. Second operand 5 states and 634 transitions. [2023-08-26 21:13:05,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 171 transitions, 1810 flow [2023-08-26 21:13:06,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 171 transitions, 1742 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-08-26 21:13:06,323 INFO L231 Difference]: Finished difference. Result has 91 places, 109 transitions, 1063 flow [2023-08-26 21:13:06,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=992, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1063, PETRI_PLACES=91, PETRI_TRANSITIONS=109} [2023-08-26 21:13:06,324 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 41 predicate places. [2023-08-26 21:13:06,324 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 109 transitions, 1063 flow [2023-08-26 21:13:06,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states 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:06,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:06,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:06,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 21:13:06,325 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:13:06,325 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:06,325 INFO L85 PathProgramCache]: Analyzing trace with hash 822367787, now seen corresponding path program 1 times [2023-08-26 21:13:06,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:06,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325099051] [2023-08-26 21:13:06,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:06,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:06,477 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:06,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:06,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325099051] [2023-08-26 21:13:06,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325099051] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:06,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:06,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:13:06,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045855715] [2023-08-26 21:13:06,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:06,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:13:06,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:06,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:13:06,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:13:06,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 261 [2023-08-26 21:13:06,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 109 transitions, 1063 flow. Second operand has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 states 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:06,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:06,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 261 [2023-08-26 21:13:06,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:07,275 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([557] L776-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_79 (+ v_~__unbuffered_cnt~0_80 1)) (= |v_P1Thread1of1ForFork1_#res.base_7| 0) (<= 0 (+ 2147483649 v_~__unbuffered_cnt~0_80)) (<= v_~__unbuffered_cnt~0_80 2147483646)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base][89], [Black: 189#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 186#true, Black: 188#(= ~__unbuffered_p3_EAX~0 0), 44#P2EXITtrue, 102#P1EXITtrue, Black: 199#(= ~x~0 0), Black: 202#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 167#(<= 1 ~__unbuffered_cnt~0), Black: 197#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 231#true, P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, 46#$Ultimate##0true, Black: 211#(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: 214#(and (= ~__unbuffered_p1_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 208#true, Black: 210#(= ~__unbuffered_p1_EAX~0 0), Black: 216#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (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: 157#(= ~__unbuffered_cnt~0 0), 120#P0EXITtrue, Black: 228#(<= ~__unbuffered_cnt~0 2), 3#ULTIMATE.startEXITtrue, 191#(and (= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 236#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 172#(<= ~__unbuffered_cnt~0 1), Black: 233#(= ~__unbuffered_cnt~0 0), Black: 234#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 200#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 241#true, Black: 177#(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: 175#true, Black: 180#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (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)))), 212#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 178#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))]) [2023-08-26 21:13:07,276 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 21:13:07,276 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:13:07,276 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:13:07,276 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:13:07,347 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([478] L826-->L842: Formula: (let ((.cse7 (= 0 (mod v_~z$r_buff1_thd4~0_56 256))) (.cse4 (= (mod v_~z$r_buff0_thd4~0_67 256) 0))) (let ((.cse5 (not .cse4)) (.cse1 (and .cse4 .cse7)) (.cse11 (= (mod v_~z$w_buff0_used~0_122 256) 0)) (.cse10 (and .cse4 (= (mod v_~z$w_buff1_used~0_109 256) 0)))) (let ((.cse3 (= (mod v_~z$w_buff1_used~0_108 256) 0)) (.cse2 (= (mod v_~z$w_buff0_used~0_121 256) 0)) (.cse0 (not (= 0 (mod v_~weak$$choice2~0_66 256)))) (.cse8 (or .cse1 .cse11 .cse10)) (.cse9 (and .cse5 (not .cse11)))) (and (= v_~z$mem_tmp~0_50 v_~z~0_122) (= v_~z$r_buff0_thd4~0_66 (ite .cse0 v_~z$r_buff0_thd4~0_67 (ite (or .cse1 .cse2 (and .cse3 .cse4)) v_~z$r_buff0_thd4~0_67 (ite (and (not .cse2) .cse5) 0 v_~z$r_buff0_thd4~0_67)))) (= (ite .cse0 v_~z$r_buff1_thd4~0_56 (ite (let ((.cse6 (= (mod v_~z$r_buff0_thd4~0_66 256) 0))) (or .cse2 (and .cse6 .cse3) (and .cse6 .cse7))) v_~z$r_buff1_thd4~0_56 0)) v_~z$r_buff1_thd4~0_55) (= v_~z$w_buff0_used~0_121 (ite .cse0 v_~z$w_buff0_used~0_122 (ite .cse8 v_~z$w_buff0_used~0_122 (ite .cse9 0 v_~z$w_buff0_used~0_122)))) (= v_~z$w_buff0~0_55 v_~z$w_buff0~0_54) (= v_~z$w_buff1_used~0_108 (ite .cse0 v_~z$w_buff1_used~0_109 (ite (or .cse1 .cse2 .cse10) v_~z$w_buff1_used~0_109 0))) (= (ite .cse0 v_~z$mem_tmp~0_50 v_~__unbuffered_p3_EAX~0_14) v_~z~0_120) (= (ite .cse8 v_~z~0_122 (ite .cse9 v_~z$w_buff0~0_55 v_~z$w_buff1~0_56)) v_~__unbuffered_p3_EAX~0_14) (= v_~z$w_buff1~0_56 v_~z$w_buff1~0_55) (= v_~z$flush_delayed~0_72 0))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_56, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_122, ~z$w_buff0~0=v_~z$w_buff0~0_55, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_67, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_109, ~z$w_buff1~0=v_~z$w_buff1~0_56, ~z~0=v_~z~0_122} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_50, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_55, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_121, ~z$w_buff0~0=v_~z$w_buff0~0_54, P3Thread1of1ForFork0_#t~nondet6#1=|v_P3Thread1of1ForFork0_#t~nondet6#1_1|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_108, ~z$w_buff1~0=v_~z$w_buff1~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_72, P3Thread1of1ForFork0_#t~nondet5#1=|v_P3Thread1of1ForFork0_#t~nondet5#1_1|, ~weak$$choice0~0=v_~weak$$choice0~0_22, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_66, ~z~0=v_~z~0_120, ~weak$$choice2~0=v_~weak$$choice2~0_66} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, P3Thread1of1ForFork0_#t~nondet6#1, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, P3Thread1of1ForFork0_#t~nondet5#1, ~weak$$choice0~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~z~0, ~weak$$choice2~0][145], [Black: 186#true, 189#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 191#(and (= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 188#(= ~__unbuffered_p3_EAX~0 0), 44#P2EXITtrue, Black: 199#(= ~x~0 0), 167#(<= 1 ~__unbuffered_cnt~0), Black: 202#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 197#true, 119#L776true, P3Thread1of1ForFork0InUse, 231#true, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, Black: 211#(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: 214#(and (= ~__unbuffered_p1_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 208#true, Black: 210#(= ~__unbuffered_p1_EAX~0 0), 228#(<= ~__unbuffered_cnt~0 2), Black: 216#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (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: 157#(= ~__unbuffered_cnt~0 0), 120#P0EXITtrue, 3#ULTIMATE.startEXITtrue, 36#L842true, Black: 172#(<= ~__unbuffered_cnt~0 1), Black: 236#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 233#(= ~__unbuffered_cnt~0 0), Black: 234#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 200#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 177#(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))), 241#true, Black: 175#true, Black: 180#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (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)))), 212#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 178#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))]) [2023-08-26 21:13:07,348 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-26 21:13:07,348 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:13:07,348 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:13:07,348 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:13:07,348 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([557] L776-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_79 (+ v_~__unbuffered_cnt~0_80 1)) (= |v_P1Thread1of1ForFork1_#res.base_7| 0) (<= 0 (+ 2147483649 v_~__unbuffered_cnt~0_80)) (<= v_~__unbuffered_cnt~0_80 2147483646)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base][89], [Black: 189#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 186#true, Black: 188#(= ~__unbuffered_p3_EAX~0 0), 44#P2EXITtrue, 102#P1EXITtrue, Black: 199#(= ~x~0 0), 167#(<= 1 ~__unbuffered_cnt~0), Black: 202#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 197#true, P3Thread1of1ForFork0InUse, 231#true, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, Black: 211#(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: 214#(and (= ~__unbuffered_p1_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 208#true, Black: 210#(= ~__unbuffered_p1_EAX~0 0), Black: 216#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (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: 157#(= ~__unbuffered_cnt~0 0), 120#P0EXITtrue, Black: 228#(<= ~__unbuffered_cnt~0 2), 3#ULTIMATE.startEXITtrue, 191#(and (= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 172#(<= ~__unbuffered_cnt~0 1), Black: 236#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 233#(= ~__unbuffered_cnt~0 0), Black: 234#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 200#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 177#(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))), 241#true, Black: 175#true, Black: 180#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (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)))), 123#L826true, 212#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 178#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))]) [2023-08-26 21:13:07,348 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-26 21:13:07,348 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:13:07,348 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:13:07,348 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:13:07,377 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([557] L776-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_79 (+ v_~__unbuffered_cnt~0_80 1)) (= |v_P1Thread1of1ForFork1_#res.base_7| 0) (<= 0 (+ 2147483649 v_~__unbuffered_cnt~0_80)) (<= v_~__unbuffered_cnt~0_80 2147483646)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base][89], [Black: 186#true, 189#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 191#(and (= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 188#(= ~__unbuffered_p3_EAX~0 0), 44#P2EXITtrue, 102#P1EXITtrue, Black: 199#(= ~x~0 0), Black: 202#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 167#(<= 1 ~__unbuffered_cnt~0), Black: 197#true, P3Thread1of1ForFork0InUse, 231#true, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, Black: 211#(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: 214#(and (= ~__unbuffered_p1_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 208#true, Black: 210#(= ~__unbuffered_p1_EAX~0 0), Black: 216#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (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: 157#(= ~__unbuffered_cnt~0 0), 120#P0EXITtrue, Black: 228#(<= ~__unbuffered_cnt~0 2), 3#ULTIMATE.startEXITtrue, 36#L842true, Black: 236#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 172#(<= ~__unbuffered_cnt~0 1), Black: 233#(= ~__unbuffered_cnt~0 0), Black: 234#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 200#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 241#true, Black: 177#(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: 175#true, Black: 180#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (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)))), 212#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 178#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))]) [2023-08-26 21:13:07,377 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-26 21:13:07,377 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-26 21:13:07,377 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-26 21:13:07,377 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-26 21:13:07,493 INFO L124 PetriNetUnfolderBase]: 4880/7662 cut-off events. [2023-08-26 21:13:07,493 INFO L125 PetriNetUnfolderBase]: For 36602/38331 co-relation queries the response was YES. [2023-08-26 21:13:07,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33491 conditions, 7662 events. 4880/7662 cut-off events. For 36602/38331 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 48204 event pairs, 575 based on Foata normal form. 894/8067 useless extension candidates. Maximal degree in co-relation 33448. Up to 3035 conditions per place. [2023-08-26 21:13:07,555 INFO L140 encePairwiseOnDemand]: 254/261 looper letters, 148 selfloop transitions, 19 changer transitions 4/194 dead transitions. [2023-08-26 21:13:07,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 194 transitions, 1947 flow [2023-08-26 21:13:07,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:13:07,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:13:07,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 885 transitions. [2023-08-26 21:13:07,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48440065681444994 [2023-08-26 21:13:07,558 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 885 transitions. [2023-08-26 21:13:07,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 885 transitions. [2023-08-26 21:13:07,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:07,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 885 transitions. [2023-08-26 21:13:07,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.42857142857143) internal successors, (885), 7 states have internal predecessors, (885), 0 states have call successors, (0), 0 states 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,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 261.0) internal successors, (2088), 8 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states 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,563 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 261.0) internal successors, (2088), 8 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states 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,564 INFO L175 Difference]: Start difference. First operand has 91 places, 109 transitions, 1063 flow. Second operand 7 states and 885 transitions. [2023-08-26 21:13:07,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 194 transitions, 1947 flow [2023-08-26 21:13:07,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 194 transitions, 1929 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-26 21:13:07,727 INFO L231 Difference]: Finished difference. Result has 98 places, 106 transitions, 1043 flow [2023-08-26 21:13:07,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=949, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1043, PETRI_PLACES=98, PETRI_TRANSITIONS=106} [2023-08-26 21:13:07,727 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 48 predicate places. [2023-08-26 21:13:07,728 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 106 transitions, 1043 flow [2023-08-26 21:13:07,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 states 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,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:07,728 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:07,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 21:13:07,728 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:13:07,729 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:07,729 INFO L85 PathProgramCache]: Analyzing trace with hash -674434278, now seen corresponding path program 1 times [2023-08-26 21:13:07,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:07,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196844795] [2023-08-26 21:13:07,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:07,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:07,906 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,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:07,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196844795] [2023-08-26 21:13:07,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196844795] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:07,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:07,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:13:07,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242515000] [2023-08-26 21:13:07,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:07,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:13:07,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:07,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:13:07,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:13:07,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 261 [2023-08-26 21:13:07,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 106 transitions, 1043 flow. Second operand has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states 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,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:07,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 261 [2023-08-26 21:13:07,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:08,737 INFO L124 PetriNetUnfolderBase]: 3700/5802 cut-off events. [2023-08-26 21:13:08,738 INFO L125 PetriNetUnfolderBase]: For 27280/29015 co-relation queries the response was YES. [2023-08-26 21:13:08,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27116 conditions, 5802 events. 3700/5802 cut-off events. For 27280/29015 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 35841 event pairs, 368 based on Foata normal form. 676/6069 useless extension candidates. Maximal degree in co-relation 27070. Up to 1759 conditions per place. [2023-08-26 21:13:08,777 INFO L140 encePairwiseOnDemand]: 254/261 looper letters, 150 selfloop transitions, 28 changer transitions 4/198 dead transitions. [2023-08-26 21:13:08,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 198 transitions, 1939 flow [2023-08-26 21:13:08,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 21:13:08,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 21:13:08,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1134 transitions. [2023-08-26 21:13:08,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4827586206896552 [2023-08-26 21:13:08,780 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1134 transitions. [2023-08-26 21:13:08,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1134 transitions. [2023-08-26 21:13:08,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:08,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1134 transitions. [2023-08-26 21:13:08,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 126.0) internal successors, (1134), 9 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states 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,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 261.0) internal successors, (2610), 10 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states 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,786 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 261.0) internal successors, (2610), 10 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states 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,786 INFO L175 Difference]: Start difference. First operand has 98 places, 106 transitions, 1043 flow. Second operand 9 states and 1134 transitions. [2023-08-26 21:13:08,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 198 transitions, 1939 flow [2023-08-26 21:13:08,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 198 transitions, 1847 flow, removed 10 selfloop flow, removed 7 redundant places. [2023-08-26 21:13:08,996 INFO L231 Difference]: Finished difference. Result has 101 places, 92 transitions, 861 flow [2023-08-26 21:13:08,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=861, PETRI_PLACES=101, PETRI_TRANSITIONS=92} [2023-08-26 21:13:08,997 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 51 predicate places. [2023-08-26 21:13:08,997 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 92 transitions, 861 flow [2023-08-26 21:13:08,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states 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,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:08,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:08,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 21:13:08,998 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:13:08,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:08,998 INFO L85 PathProgramCache]: Analyzing trace with hash 2021419179, now seen corresponding path program 1 times [2023-08-26 21:13:08,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:08,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676718688] [2023-08-26 21:13:08,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:08,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:09,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:09,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:09,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676718688] [2023-08-26 21:13:09,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676718688] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:09,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:09,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:13:09,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466144747] [2023-08-26 21:13:09,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:09,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:13:09,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:09,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:13:09,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:13:09,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 261 [2023-08-26 21:13:09,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 92 transitions, 861 flow. Second operand has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states 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,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:09,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 261 [2023-08-26 21:13:09,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:09,773 INFO L124 PetriNetUnfolderBase]: 3562/5615 cut-off events. [2023-08-26 21:13:09,773 INFO L125 PetriNetUnfolderBase]: For 26373/27849 co-relation queries the response was YES. [2023-08-26 21:13:09,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27299 conditions, 5615 events. 3562/5615 cut-off events. For 26373/27849 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 34849 event pairs, 600 based on Foata normal form. 355/5658 useless extension candidates. Maximal degree in co-relation 27253. Up to 2032 conditions per place. [2023-08-26 21:13:09,806 INFO L140 encePairwiseOnDemand]: 252/261 looper letters, 81 selfloop transitions, 27 changer transitions 28/147 dead transitions. [2023-08-26 21:13:09,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 147 transitions, 1517 flow [2023-08-26 21:13:09,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:13:09,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:13:09,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 765 transitions. [2023-08-26 21:13:09,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4885057471264368 [2023-08-26 21:13:09,808 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 765 transitions. [2023-08-26 21:13:09,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 765 transitions. [2023-08-26 21:13:09,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:09,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 765 transitions. [2023-08-26 21:13:09,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states 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,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 261.0) internal successors, (1827), 7 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states 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,813 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 261.0) internal successors, (1827), 7 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states 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,813 INFO L175 Difference]: Start difference. First operand has 101 places, 92 transitions, 861 flow. Second operand 6 states and 765 transitions. [2023-08-26 21:13:09,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 147 transitions, 1517 flow [2023-08-26 21:13:10,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 147 transitions, 1463 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-08-26 21:13:10,080 INFO L231 Difference]: Finished difference. Result has 96 places, 67 transitions, 594 flow [2023-08-26 21:13:10,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=594, PETRI_PLACES=96, PETRI_TRANSITIONS=67} [2023-08-26 21:13:10,081 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 46 predicate places. [2023-08-26 21:13:10,081 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 67 transitions, 594 flow [2023-08-26 21:13:10,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states 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,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:10,081 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:10,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 21:13:10,081 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:13:10,082 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:10,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1157076512, now seen corresponding path program 1 times [2023-08-26 21:13:10,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:10,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866739745] [2023-08-26 21:13:10,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:10,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:10,269 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:10,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:10,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866739745] [2023-08-26 21:13:10,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866739745] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:10,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:10,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:13:10,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356661065] [2023-08-26 21:13:10,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:10,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:13:10,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:10,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:13:10,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:13:10,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 261 [2023-08-26 21:13:10,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 67 transitions, 594 flow. Second operand has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 0 states 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,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:10,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 261 [2023-08-26 21:13:10,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:11,171 INFO L124 PetriNetUnfolderBase]: 5694/8558 cut-off events. [2023-08-26 21:13:11,171 INFO L125 PetriNetUnfolderBase]: For 42966/42966 co-relation queries the response was YES. [2023-08-26 21:13:11,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41827 conditions, 8558 events. 5694/8558 cut-off events. For 42966/42966 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 48504 event pairs, 298 based on Foata normal form. 16/8574 useless extension candidates. Maximal degree in co-relation 41781. Up to 4204 conditions per place. [2023-08-26 21:13:11,216 INFO L140 encePairwiseOnDemand]: 249/261 looper letters, 104 selfloop transitions, 30 changer transitions 73/207 dead transitions. [2023-08-26 21:13:11,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 207 transitions, 2212 flow [2023-08-26 21:13:11,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 21:13:11,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 21:13:11,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 942 transitions. [2023-08-26 21:13:11,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4511494252873563 [2023-08-26 21:13:11,219 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 942 transitions. [2023-08-26 21:13:11,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 942 transitions. [2023-08-26 21:13:11,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:11,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 942 transitions. [2023-08-26 21:13:11,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 117.75) internal successors, (942), 8 states have internal predecessors, (942), 0 states have call successors, (0), 0 states 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,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 261.0) internal successors, (2349), 9 states have internal predecessors, (2349), 0 states have call successors, (0), 0 states 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,224 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 261.0) internal successors, (2349), 9 states have internal predecessors, (2349), 0 states have call successors, (0), 0 states 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,224 INFO L175 Difference]: Start difference. First operand has 96 places, 67 transitions, 594 flow. Second operand 8 states and 942 transitions. [2023-08-26 21:13:11,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 207 transitions, 2212 flow [2023-08-26 21:13:11,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 207 transitions, 1764 flow, removed 66 selfloop flow, removed 15 redundant places. [2023-08-26 21:13:11,512 INFO L231 Difference]: Finished difference. Result has 89 places, 70 transitions, 636 flow [2023-08-26 21:13:11,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=636, PETRI_PLACES=89, PETRI_TRANSITIONS=70} [2023-08-26 21:13:11,512 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 39 predicate places. [2023-08-26 21:13:11,512 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 70 transitions, 636 flow [2023-08-26 21:13:11,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 0 states 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,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:11,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:11,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 21:13:11,513 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:13:11,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:11,513 INFO L85 PathProgramCache]: Analyzing trace with hash 658003028, now seen corresponding path program 2 times [2023-08-26 21:13:11,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:11,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239144229] [2023-08-26 21:13:11,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:11,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:11,722 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:11,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:11,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239144229] [2023-08-26 21:13:11,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239144229] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:11,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:11,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:13:11,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364179855] [2023-08-26 21:13:11,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:11,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:13:11,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:11,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:13:11,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:13:11,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 261 [2023-08-26 21:13:11,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 70 transitions, 636 flow. Second operand has 7 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 0 states 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,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:11,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 261 [2023-08-26 21:13:11,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:12,179 INFO L124 PetriNetUnfolderBase]: 1731/2759 cut-off events. [2023-08-26 21:13:12,179 INFO L125 PetriNetUnfolderBase]: For 11238/11899 co-relation queries the response was YES. [2023-08-26 21:13:12,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12511 conditions, 2759 events. 1731/2759 cut-off events. For 11238/11899 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 15403 event pairs, 236 based on Foata normal form. 205/2837 useless extension candidates. Maximal degree in co-relation 12471. Up to 1032 conditions per place. [2023-08-26 21:13:12,202 INFO L140 encePairwiseOnDemand]: 254/261 looper letters, 97 selfloop transitions, 18 changer transitions 14/150 dead transitions. [2023-08-26 21:13:12,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 150 transitions, 1506 flow [2023-08-26 21:13:12,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 21:13:12,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 21:13:12,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 978 transitions. [2023-08-26 21:13:12,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46839080459770116 [2023-08-26 21:13:12,205 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 978 transitions. [2023-08-26 21:13:12,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 978 transitions. [2023-08-26 21:13:12,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:12,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 978 transitions. [2023-08-26 21:13:12,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 122.25) internal successors, (978), 8 states have internal predecessors, (978), 0 states have call successors, (0), 0 states 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,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 261.0) internal successors, (2349), 9 states have internal predecessors, (2349), 0 states have call successors, (0), 0 states 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,210 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 261.0) internal successors, (2349), 9 states have internal predecessors, (2349), 0 states have call successors, (0), 0 states 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,210 INFO L175 Difference]: Start difference. First operand has 89 places, 70 transitions, 636 flow. Second operand 8 states and 978 transitions. [2023-08-26 21:13:12,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 150 transitions, 1506 flow [2023-08-26 21:13:12,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 150 transitions, 1298 flow, removed 43 selfloop flow, removed 15 redundant places. [2023-08-26 21:13:12,262 INFO L231 Difference]: Finished difference. Result has 70 places, 71 transitions, 575 flow [2023-08-26 21:13:12,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=575, PETRI_PLACES=70, PETRI_TRANSITIONS=71} [2023-08-26 21:13:12,263 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 20 predicate places. [2023-08-26 21:13:12,263 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 71 transitions, 575 flow [2023-08-26 21:13:12,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 0 states 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,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:12,264 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:12,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 21:13:12,264 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:13:12,264 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:12,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1482834681, now seen corresponding path program 1 times [2023-08-26 21:13:12,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:12,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101649557] [2023-08-26 21:13:12,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:12,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:12,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:13:12,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:12,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101649557] [2023-08-26 21:13:12,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101649557] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:12,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:12,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:13:12,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267428472] [2023-08-26 21:13:12,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:12,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:13:12,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:12,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:13:12,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:13:12,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 261 [2023-08-26 21:13:12,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 71 transitions, 575 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states 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,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:12,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 261 [2023-08-26 21:13:12,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:12,937 INFO L124 PetriNetUnfolderBase]: 2343/3822 cut-off events. [2023-08-26 21:13:12,937 INFO L125 PetriNetUnfolderBase]: For 14903/15251 co-relation queries the response was YES. [2023-08-26 21:13:12,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18023 conditions, 3822 events. 2343/3822 cut-off events. For 14903/15251 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 22658 event pairs, 387 based on Foata normal form. 28/3761 useless extension candidates. Maximal degree in co-relation 17993. Up to 2051 conditions per place. [2023-08-26 21:13:12,953 INFO L140 encePairwiseOnDemand]: 257/261 looper letters, 54 selfloop transitions, 1 changer transitions 65/134 dead transitions. [2023-08-26 21:13:12,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 134 transitions, 1281 flow [2023-08-26 21:13:12,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:13:12,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:13:12,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 618 transitions. [2023-08-26 21:13:12,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4735632183908046 [2023-08-26 21:13:12,955 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 618 transitions. [2023-08-26 21:13:12,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 618 transitions. [2023-08-26 21:13:12,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:12,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 618 transitions. [2023-08-26 21:13:12,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.6) internal successors, (618), 5 states have internal predecessors, (618), 0 states have call successors, (0), 0 states 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,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states 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,958 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states 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,958 INFO L175 Difference]: Start difference. First operand has 70 places, 71 transitions, 575 flow. Second operand 5 states and 618 transitions. [2023-08-26 21:13:12,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 134 transitions, 1281 flow [2023-08-26 21:13:13,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 134 transitions, 1139 flow, removed 29 selfloop flow, removed 7 redundant places. [2023-08-26 21:13:13,007 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 429 flow [2023-08-26 21:13:13,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=429, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2023-08-26 21:13:13,008 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 19 predicate places. [2023-08-26 21:13:13,008 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 429 flow [2023-08-26 21:13:13,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states 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:13,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:13,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:13,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 21:13:13,009 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:13:13,009 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:13,009 INFO L85 PathProgramCache]: Analyzing trace with hash -538683153, now seen corresponding path program 2 times [2023-08-26 21:13:13,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:13,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471398463] [2023-08-26 21:13:13,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:13,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:13,191 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:13,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:13,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471398463] [2023-08-26 21:13:13,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471398463] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:13,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:13,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:13:13,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159693284] [2023-08-26 21:13:13,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:13,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:13:13,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:13,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:13:13,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:13:13,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 261 [2023-08-26 21:13:13,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 429 flow. Second operand has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states 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:13,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:13,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 261 [2023-08-26 21:13:13,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:13,571 INFO L124 PetriNetUnfolderBase]: 1887/3057 cut-off events. [2023-08-26 21:13:13,571 INFO L125 PetriNetUnfolderBase]: For 8039/8114 co-relation queries the response was YES. [2023-08-26 21:13:13,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12599 conditions, 3057 events. 1887/3057 cut-off events. For 8039/8114 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 16686 event pairs, 656 based on Foata normal form. 1/3006 useless extension candidates. Maximal degree in co-relation 12577. Up to 1540 conditions per place. [2023-08-26 21:13:13,582 INFO L140 encePairwiseOnDemand]: 257/261 looper letters, 44 selfloop transitions, 4 changer transitions 44/95 dead transitions. [2023-08-26 21:13:13,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 95 transitions, 801 flow [2023-08-26 21:13:13,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:13:13,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:13:13,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 496 transitions. [2023-08-26 21:13:13,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47509578544061304 [2023-08-26 21:13:13,584 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 496 transitions. [2023-08-26 21:13:13,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 496 transitions. [2023-08-26 21:13:13,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:13,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 496 transitions. [2023-08-26 21:13:13,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states 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:13,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 261.0) internal successors, (1305), 5 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states 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:13,587 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 261.0) internal successors, (1305), 5 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states 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:13,587 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 429 flow. Second operand 4 states and 496 transitions. [2023-08-26 21:13:13,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 95 transitions, 801 flow [2023-08-26 21:13:13,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 95 transitions, 790 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-26 21:13:13,635 INFO L231 Difference]: Finished difference. Result has 67 places, 45 transitions, 281 flow [2023-08-26 21:13:13,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=281, PETRI_PLACES=67, PETRI_TRANSITIONS=45} [2023-08-26 21:13:13,636 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 17 predicate places. [2023-08-26 21:13:13,636 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 45 transitions, 281 flow [2023-08-26 21:13:13,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states 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:13,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:13,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:13,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 21:13:13,637 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:13:13,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:13,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1724766127, now seen corresponding path program 3 times [2023-08-26 21:13:13,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:13,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006979697] [2023-08-26 21:13:13,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:13,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:13,845 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:13,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:13,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006979697] [2023-08-26 21:13:13,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006979697] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:13,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:13,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:13:13,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132184433] [2023-08-26 21:13:13,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:13,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:13:13,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:13,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:13:13,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:13:13,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 261 [2023-08-26 21:13:13,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 45 transitions, 281 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states 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:13,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:13,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 261 [2023-08-26 21:13:13,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:14,022 INFO L124 PetriNetUnfolderBase]: 333/622 cut-off events. [2023-08-26 21:13:14,022 INFO L125 PetriNetUnfolderBase]: For 1358/1365 co-relation queries the response was YES. [2023-08-26 21:13:14,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2562 conditions, 622 events. 333/622 cut-off events. For 1358/1365 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2724 event pairs, 47 based on Foata normal form. 1/619 useless extension candidates. Maximal degree in co-relation 2541. Up to 303 conditions per place. [2023-08-26 21:13:14,025 INFO L140 encePairwiseOnDemand]: 257/261 looper letters, 45 selfloop transitions, 1 changer transitions 30/79 dead transitions. [2023-08-26 21:13:14,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 79 transitions, 616 flow [2023-08-26 21:13:14,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:13:14,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:13:14,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2023-08-26 21:13:14,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4674329501915709 [2023-08-26 21:13:14,028 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 610 transitions. [2023-08-26 21:13:14,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 610 transitions. [2023-08-26 21:13:14,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:14,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 610 transitions. [2023-08-26 21:13:14,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 states 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,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states 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,032 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states 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,032 INFO L175 Difference]: Start difference. First operand has 67 places, 45 transitions, 281 flow. Second operand 5 states and 610 transitions. [2023-08-26 21:13:14,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 79 transitions, 616 flow [2023-08-26 21:13:14,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 79 transitions, 565 flow, removed 9 selfloop flow, removed 11 redundant places. [2023-08-26 21:13:14,037 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 197 flow [2023-08-26 21:13:14,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=197, PETRI_PLACES=60, PETRI_TRANSITIONS=39} [2023-08-26 21:13:14,038 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2023-08-26 21:13:14,038 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 197 flow [2023-08-26 21:13:14,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states 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,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:14,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:14,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 21:13:14,039 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:13:14,039 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:14,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1866280663, now seen corresponding path program 4 times [2023-08-26 21:13:14,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:14,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597193161] [2023-08-26 21:13:14,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:14,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:14,998 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:14,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:14,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597193161] [2023-08-26 21:13:14,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597193161] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:14,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:14,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:13:14,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414509279] [2023-08-26 21:13:14,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:14,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 21:13:15,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:15,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 21:13:15,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-26 21:13:15,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 261 [2023-08-26 21:13:15,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 39 transitions, 197 flow. Second operand has 8 states, 8 states have (on average 109.875) internal successors, (879), 8 states have internal predecessors, (879), 0 states have call successors, (0), 0 states 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:15,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:15,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 261 [2023-08-26 21:13:15,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:15,266 INFO L124 PetriNetUnfolderBase]: 181/377 cut-off events. [2023-08-26 21:13:15,266 INFO L125 PetriNetUnfolderBase]: For 652/666 co-relation queries the response was YES. [2023-08-26 21:13:15,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1435 conditions, 377 events. 181/377 cut-off events. For 652/666 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1578 event pairs, 34 based on Foata normal form. 5/373 useless extension candidates. Maximal degree in co-relation 1418. Up to 136 conditions per place. [2023-08-26 21:13:15,268 INFO L140 encePairwiseOnDemand]: 253/261 looper letters, 35 selfloop transitions, 4 changer transitions 37/80 dead transitions. [2023-08-26 21:13:15,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 80 transitions, 582 flow [2023-08-26 21:13:15,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 21:13:15,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 21:13:15,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1008 transitions. [2023-08-26 21:13:15,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42911877394636017 [2023-08-26 21:13:15,272 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1008 transitions. [2023-08-26 21:13:15,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1008 transitions. [2023-08-26 21:13:15,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:15,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1008 transitions. [2023-08-26 21:13:15,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 112.0) internal successors, (1008), 9 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states 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:15,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 261.0) internal successors, (2610), 10 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states 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:15,278 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 261.0) internal successors, (2610), 10 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states 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:15,278 INFO L175 Difference]: Start difference. First operand has 60 places, 39 transitions, 197 flow. Second operand 9 states and 1008 transitions. [2023-08-26 21:13:15,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 80 transitions, 582 flow [2023-08-26 21:13:15,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 80 transitions, 565 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-26 21:13:15,283 INFO L231 Difference]: Finished difference. Result has 65 places, 39 transitions, 204 flow [2023-08-26 21:13:15,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=204, PETRI_PLACES=65, PETRI_TRANSITIONS=39} [2023-08-26 21:13:15,284 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 15 predicate places. [2023-08-26 21:13:15,284 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 39 transitions, 204 flow [2023-08-26 21:13:15,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.875) internal successors, (879), 8 states have internal predecessors, (879), 0 states have call successors, (0), 0 states 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:15,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:15,284 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:15,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 21:13:15,285 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:13:15,285 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:15,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1713742317, now seen corresponding path program 5 times [2023-08-26 21:13:15,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:15,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011866666] [2023-08-26 21:13:15,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:15,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:13:15,336 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 21:13:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:13:15,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 21:13:15,437 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 21:13:15,438 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (22 of 23 remaining) [2023-08-26 21:13:15,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 23 remaining) [2023-08-26 21:13:15,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2023-08-26 21:13:15,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2023-08-26 21:13:15,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2023-08-26 21:13:15,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2023-08-26 21:13:15,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2023-08-26 21:13:15,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (15 of 23 remaining) [2023-08-26 21:13:15,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2023-08-26 21:13:15,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2023-08-26 21:13:15,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2023-08-26 21:13:15,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2023-08-26 21:13:15,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2023-08-26 21:13:15,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2023-08-26 21:13:15,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 23 remaining) [2023-08-26 21:13:15,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2023-08-26 21:13:15,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 23 remaining) [2023-08-26 21:13:15,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2023-08-26 21:13:15,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2023-08-26 21:13:15,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2023-08-26 21:13:15,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (2 of 23 remaining) [2023-08-26 21:13:15,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2023-08-26 21:13:15,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2023-08-26 21:13:15,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 21:13:15,445 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:15,451 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 21:13:15,451 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 21:13:15,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:13:15 BasicIcfg [2023-08-26 21:13:15,564 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 21:13:15,564 INFO L158 Benchmark]: Toolchain (without parser) took 35955.84ms. Allocated memory was 346.0MB in the beginning and 6.1GB in the end (delta: 5.8GB). Free memory was 320.8MB in the beginning and 5.0GB in the end (delta: -4.7GB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. [2023-08-26 21:13:15,564 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 346.0MB. Free memory is still 322.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 21:13:15,565 INFO L158 Benchmark]: CACSL2BoogieTranslator took 543.35ms. Allocated memory is still 346.0MB. Free memory was 320.8MB in the beginning and 296.8MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 21:13:15,565 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.59ms. Allocated memory is still 346.0MB. Free memory was 296.8MB in the beginning and 293.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 21:13:15,565 INFO L158 Benchmark]: Boogie Preprocessor took 54.72ms. Allocated memory is still 346.0MB. Free memory was 293.5MB in the beginning and 291.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:13:15,565 INFO L158 Benchmark]: RCFGBuilder took 745.21ms. Allocated memory is still 346.0MB. Free memory was 291.4MB in the beginning and 301.7MB in the end (delta: -10.3MB). Peak memory consumption was 27.4MB. Max. memory is 16.0GB. [2023-08-26 21:13:15,566 INFO L158 Benchmark]: TraceAbstraction took 34525.72ms. Allocated memory was 346.0MB in the beginning and 6.1GB in the end (delta: 5.8GB). Free memory was 300.8MB in the beginning and 5.0GB in the end (delta: -4.7GB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. [2023-08-26 21:13:15,567 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.12ms. Allocated memory is still 346.0MB. Free memory is still 322.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 543.35ms. Allocated memory is still 346.0MB. Free memory was 320.8MB in the beginning and 296.8MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 79.59ms. Allocated memory is still 346.0MB. Free memory was 296.8MB in the beginning and 293.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 54.72ms. Allocated memory is still 346.0MB. Free memory was 293.5MB in the beginning and 291.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 745.21ms. Allocated memory is still 346.0MB. Free memory was 291.4MB in the beginning and 301.7MB in the end (delta: -10.3MB). Peak memory consumption was 27.4MB. Max. memory is 16.0GB. * TraceAbstraction took 34525.72ms. Allocated memory was 346.0MB in the beginning and 6.1GB in the end (delta: 5.8GB). Free memory was 300.8MB in the beginning and 5.0GB in the end (delta: -4.7GB). Peak memory consumption was 1.0GB. 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.2s, 148 PlacesBefore, 50 PlacesAfterwards, 138 TransitionsBefore, 38 TransitionsAfterwards, 4186 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 2 ChoiceCompositions, 119 TotalNumberOfCompositions, 15036 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5973, independent: 5636, independent conditional: 0, independent unconditional: 5636, dependent: 337, dependent conditional: 0, dependent unconditional: 337, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2283, independent: 2231, independent conditional: 0, independent unconditional: 2231, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5973, independent: 3405, independent conditional: 0, independent unconditional: 3405, dependent: 285, dependent conditional: 0, dependent unconditional: 285, unknown: 2283, unknown conditional: 0, unknown unconditional: 2283] , Statistics on independence cache: Total cache size (in pairs): 265, Positive cache size: 243, Positive conditional cache size: 0, Positive unconditional cache size: 243, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, 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 main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L869] 0 pthread_t t357; [L870] FCALL, FORK 0 pthread_create(&t357, ((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=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t357, ((void *)0), P0, ((void *)0))=-1, t357={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L871] 0 pthread_t t358; [L872] FCALL, FORK 0 pthread_create(&t358, ((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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t358, ((void *)0), P1, ((void *)0))=0, t357={5:0}, t358={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L873] 0 pthread_t t359; [L874] FCALL, FORK 0 pthread_create(&t359, ((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=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t359, ((void *)0), P2, ((void *)0))=1, t357={5:0}, t358={6:0}, t359={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L875] 0 pthread_t t360; [L876] FCALL, FORK 0 pthread_create(&t360, ((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=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t360, ((void *)0), P3, ((void *)0))=2, t357={5:0}, t358={6:0}, t359={7:0}, t360={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L815] 4 z$w_buff1 = z$w_buff0 [L816] 4 z$w_buff0 = 1 [L817] 4 z$w_buff1_used = z$w_buff0_used [L818] 4 z$w_buff0_used = (_Bool)1 [L819] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L819] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L820] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L821] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L822] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L823] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L824] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = (_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=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 z$flush_delayed = weak$$choice2 [L831] 4 z$mem_tmp = z [L832] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L833] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L834] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L835] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L836] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L838] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EAX = z [L840] 4 z = z$flush_delayed ? z$mem_tmp : z [L841] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L844] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] EXPR 1 __unbuffered_cnt + 1 [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L769] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 __unbuffered_p1_EAX = x 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=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 __unbuffered_p1_EBX = y 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=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 3 y = 1 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=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 z$flush_delayed = weak$$choice2 [L793] 3 z$mem_tmp = z [L794] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L795] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L796] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L797] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L798] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L800] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = z [L802] 3 z = z$flush_delayed ? z$mem_tmp : z [L803] 3 z$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=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L847] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L848] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L849] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L850] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L851] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$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=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L854] EXPR 4 __unbuffered_cnt + 1 [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L780] EXPR 2 __unbuffered_cnt + 1 [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 2 return 0; [L808] EXPR 3 __unbuffered_cnt + 1 [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L883] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L884] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L885] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L886] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$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=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, t357={5:0}, t358={6:0}, t359={7:0}, t360={3:0}, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L889] 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) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix014.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={50:49}, \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=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 762]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 762]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 780]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 780]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 808]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 808]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 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. - UnprovableResult [Line: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 184 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: 34.3s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 25.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 775 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 775 mSDsluCounter, 79 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2326 IncrementalHoareTripleChecker+Invalid, 2414 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 46 mSDtfsCounter, 2326 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1076occurred in iteration=9, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 367 NumberOfCodeBlocks, 367 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 321 ConstructedInterpolants, 0 QuantifiedInterpolants, 1764 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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:15,592 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...