/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 10:07:13,919 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 10:07:13,984 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-27 10:07:13,987 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 10:07:13,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 10:07:14,011 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 10:07:14,012 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 10:07:14,012 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 10:07:14,012 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 10:07:14,015 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 10:07:14,015 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 10:07:14,015 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 10:07:14,016 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 10:07:14,017 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 10:07:14,017 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 10:07:14,017 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 10:07:14,017 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 10:07:14,017 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 10:07:14,017 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 10:07:14,017 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 10:07:14,017 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 10:07:14,018 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 10:07:14,018 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 10:07:14,018 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 10:07:14,018 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 10:07:14,018 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 10:07:14,019 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 10:07:14,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:07:14,019 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 10:07:14,019 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 10:07:14,020 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 10:07:14,020 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 10:07:14,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 10:07:14,020 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 10:07:14,020 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 10:07:14,020 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 10:07:14,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 10:07:14,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 10:07:14,286 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 10:07:14,287 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 10:07:14,288 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 10:07:14,289 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i [2023-08-27 10:07:15,289 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 10:07:15,496 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 10:07:15,497 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i [2023-08-27 10:07:15,509 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba07331c0/073e13816ca84b8f90391ed8fad5e464/FLAG35d8ce80f [2023-08-27 10:07:15,521 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba07331c0/073e13816ca84b8f90391ed8fad5e464 [2023-08-27 10:07:15,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 10:07:15,526 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 10:07:15,527 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 10:07:15,527 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 10:07:15,529 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 10:07:15,530 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:07:15" (1/1) ... [2023-08-27 10:07:15,531 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@696b7385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:07:15, skipping insertion in model container [2023-08-27 10:07:15,531 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:07:15" (1/1) ... [2023-08-27 10:07:15,577 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 10:07:15,858 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:07:15,865 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 10:07:15,881 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 10:07:15,882 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 10:07:15,905 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:07:15,926 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:07:15,926 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:07:15,930 INFO L206 MainTranslator]: Completed translation [2023-08-27 10:07:15,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:07:15 WrapperNode [2023-08-27 10:07:15,931 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 10:07:15,932 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 10:07:15,932 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 10:07:15,932 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 10:07:15,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:07:15" (1/1) ... [2023-08-27 10:07:15,946 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:07:15" (1/1) ... [2023-08-27 10:07:15,963 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 154 [2023-08-27 10:07:15,964 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 10:07:15,964 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 10:07:15,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 10:07:15,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 10:07:15,970 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:07:15" (1/1) ... [2023-08-27 10:07:15,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:07:15" (1/1) ... [2023-08-27 10:07:15,974 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:07:15" (1/1) ... [2023-08-27 10:07:15,974 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:07:15" (1/1) ... [2023-08-27 10:07:15,979 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:07:15" (1/1) ... [2023-08-27 10:07:15,980 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:07:15" (1/1) ... [2023-08-27 10:07:15,982 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:07:15" (1/1) ... [2023-08-27 10:07:15,983 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:07:15" (1/1) ... [2023-08-27 10:07:15,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 10:07:15,986 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 10:07:15,986 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 10:07:15,986 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 10:07:15,987 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:07:15" (1/1) ... [2023-08-27 10:07:16,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:07:16,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 10:07:16,025 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-27 10:07:16,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-27 10:07:16,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 10:07:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 10:07:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 10:07:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 10:07:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 10:07:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 10:07:16,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 10:07:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 10:07:16,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 10:07:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 10:07:16,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 10:07:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-27 10:07:16,047 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-27 10:07:16,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 10:07:16,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 10:07:16,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 10:07:16,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 10:07:16,048 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 10:07:16,153 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 10:07:16,154 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 10:07:16,427 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 10:07:16,513 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 10:07:16,513 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 10:07:16,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:07:16 BoogieIcfgContainer [2023-08-27 10:07:16,515 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 10:07:16,517 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 10:07:16,517 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 10:07:16,519 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 10:07:16,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 10:07:15" (1/3) ... [2023-08-27 10:07:16,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78861117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:07:16, skipping insertion in model container [2023-08-27 10:07:16,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:07:15" (2/3) ... [2023-08-27 10:07:16,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78861117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:07:16, skipping insertion in model container [2023-08-27 10:07:16,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:07:16" (3/3) ... [2023-08-27 10:07:16,521 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037_power.oepc_pso.oepc_rmo.oepc.i [2023-08-27 10:07:16,531 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 10:07:16,531 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-27 10:07:16,532 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 10:07:16,580 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 10:07:16,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 145 transitions, 310 flow [2023-08-27 10:07:16,651 INFO L124 PetriNetUnfolderBase]: 3/141 cut-off events. [2023-08-27 10:07:16,651 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:07:16,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 3/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 111 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-27 10:07:16,656 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 145 transitions, 310 flow [2023-08-27 10:07:16,661 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 141 transitions, 294 flow [2023-08-27 10:07:16,663 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 10:07:16,671 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 141 transitions, 294 flow [2023-08-27 10:07:16,674 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 141 transitions, 294 flow [2023-08-27 10:07:16,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 141 transitions, 294 flow [2023-08-27 10:07:16,712 INFO L124 PetriNetUnfolderBase]: 3/141 cut-off events. [2023-08-27 10:07:16,712 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:07:16,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 3/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 111 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-27 10:07:16,716 INFO L119 LiptonReduction]: Number of co-enabled transitions 4666 [2023-08-27 10:07:20,085 INFO L134 LiptonReduction]: Checked pairs total: 17674 [2023-08-27 10:07:20,085 INFO L136 LiptonReduction]: Total number of compositions: 123 [2023-08-27 10:07:20,094 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 10:07:20,097 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;@514373d6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 10:07:20,097 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-27 10:07:20,099 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 10:07:20,099 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-27 10:07:20,099 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:07:20,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:20,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-27 10:07:20,100 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:07:20,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:20,116 INFO L85 PathProgramCache]: Analyzing trace with hash 632718, now seen corresponding path program 1 times [2023-08-27 10:07:20,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:20,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292447758] [2023-08-27 10:07:20,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:20,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:07:20,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:07:20,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:07:20,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292447758] [2023-08-27 10:07:20,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292447758] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:07:20,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:07:20,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:07:20,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392742609] [2023-08-27 10:07:20,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:07:20,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:07:20,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:07:20,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:07:20,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:07:20,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 268 [2023-08-27 10:07:20,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:20,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:07:20,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 268 [2023-08-27 10:07:20,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:07:21,826 INFO L124 PetriNetUnfolderBase]: 12064/17903 cut-off events. [2023-08-27 10:07:21,826 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2023-08-27 10:07:21,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34346 conditions, 17903 events. 12064/17903 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 827. Compared 122022 event pairs, 1764 based on Foata normal form. 0/14083 useless extension candidates. Maximal degree in co-relation 34334. Up to 13549 conditions per place. [2023-08-27 10:07:21,926 INFO L140 encePairwiseOnDemand]: 264/268 looper letters, 50 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-08-27 10:07:21,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 60 transitions, 245 flow [2023-08-27 10:07:21,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:07:21,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:07:21,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-08-27 10:07:21,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5161691542288557 [2023-08-27 10:07:21,937 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-08-27 10:07:21,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-08-27 10:07:21,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:07:21,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-08-27 10:07:21,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:21,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:21,947 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:21,948 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 3 states and 415 transitions. [2023-08-27 10:07:21,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 60 transitions, 245 flow [2023-08-27 10:07:21,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 238 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 10:07:21,952 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 86 flow [2023-08-27 10:07:21,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2023-08-27 10:07:21,955 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2023-08-27 10:07:21,955 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 86 flow [2023-08-27 10:07:21,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:21,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:21,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 10:07:21,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 10:07:21,956 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:07:21,956 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:21,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1669907442, now seen corresponding path program 1 times [2023-08-27 10:07:21,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:21,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336527950] [2023-08-27 10:07:21,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:21,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:07:22,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:07:22,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:07:22,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336527950] [2023-08-27 10:07:22,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336527950] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:07:22,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:07:22,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:07:22,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393942255] [2023-08-27 10:07:22,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:07:22,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:07:22,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:07:22,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:07:22,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:07:22,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 268 [2023-08-27 10:07:22,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:22,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:07:22,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 268 [2023-08-27 10:07:22,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:07:23,214 INFO L124 PetriNetUnfolderBase]: 12064/16219 cut-off events. [2023-08-27 10:07:23,215 INFO L125 PetriNetUnfolderBase]: For 811/811 co-relation queries the response was YES. [2023-08-27 10:07:23,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33472 conditions, 16219 events. 12064/16219 cut-off events. For 811/811 co-relation queries the response was YES. Maximal size of possible extension queue 668. Compared 85246 event pairs, 12064 based on Foata normal form. 0/12266 useless extension candidates. Maximal degree in co-relation 33462. Up to 16125 conditions per place. [2023-08-27 10:07:23,389 INFO L140 encePairwiseOnDemand]: 263/268 looper letters, 28 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2023-08-27 10:07:23,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 33 transitions, 136 flow [2023-08-27 10:07:23,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:07:23,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:07:23,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2023-08-27 10:07:23,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4701492537313433 [2023-08-27 10:07:23,392 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2023-08-27 10:07:23,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2023-08-27 10:07:23,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:07:23,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2023-08-27 10:07:23,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:23,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:23,395 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:23,395 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 86 flow. Second operand 3 states and 378 transitions. [2023-08-27 10:07:23,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 33 transitions, 136 flow [2023-08-27 10:07:23,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 33 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:07:23,396 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 76 flow [2023-08-27 10:07:23,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2023-08-27 10:07:23,396 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -7 predicate places. [2023-08-27 10:07:23,396 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 76 flow [2023-08-27 10:07:23,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:23,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:23,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 10:07:23,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 10:07:23,397 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:07:23,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:23,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1669907443, now seen corresponding path program 1 times [2023-08-27 10:07:23,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:23,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057356539] [2023-08-27 10:07:23,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:23,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:07:23,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:07:23,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:07:23,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057356539] [2023-08-27 10:07:23,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057356539] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:07:23,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:07:23,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:07:23,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198067935] [2023-08-27 10:07:23,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:07:23,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:07:23,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:07:23,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:07:23,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:07:23,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 268 [2023-08-27 10:07:23,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:23,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:07:23,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 268 [2023-08-27 10:07:23,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:07:24,129 INFO L124 PetriNetUnfolderBase]: 7784/10735 cut-off events. [2023-08-27 10:07:24,129 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:07:24,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21656 conditions, 10735 events. 7784/10735 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 57641 event pairs, 2133 based on Foata normal form. 0/8735 useless extension candidates. Maximal degree in co-relation 21650. Up to 8563 conditions per place. [2023-08-27 10:07:24,177 INFO L140 encePairwiseOnDemand]: 259/268 looper letters, 47 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2023-08-27 10:07:24,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 56 transitions, 232 flow [2023-08-27 10:07:24,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:07:24,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:07:24,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2023-08-27 10:07:24,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4987562189054726 [2023-08-27 10:07:24,179 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions. [2023-08-27 10:07:24,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions. [2023-08-27 10:07:24,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:07:24,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions. [2023-08-27 10:07:24,180 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-27 10:07:24,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:24,182 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:24,182 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 76 flow. Second operand 3 states and 401 transitions. [2023-08-27 10:07:24,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 56 transitions, 232 flow [2023-08-27 10:07:24,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 231 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:07:24,183 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 114 flow [2023-08-27 10:07:24,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2023-08-27 10:07:24,183 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2023-08-27 10:07:24,184 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 114 flow [2023-08-27 10:07:24,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:24,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:24,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:07:24,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 10:07:24,184 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:07:24,185 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:24,185 INFO L85 PathProgramCache]: Analyzing trace with hash 437072231, now seen corresponding path program 1 times [2023-08-27 10:07:24,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:24,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056467115] [2023-08-27 10:07:24,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:24,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:07:24,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:07:24,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:07:24,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056467115] [2023-08-27 10:07:24,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056467115] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:07:24,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:07:24,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:07:24,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517758845] [2023-08-27 10:07:24,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:07:24,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:07:24,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:07:24,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:07:24,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:07:24,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 268 [2023-08-27 10:07:24,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:24,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:07:24,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 268 [2023-08-27 10:07:24,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:07:26,670 INFO L124 PetriNetUnfolderBase]: 26769/36638 cut-off events. [2023-08-27 10:07:26,670 INFO L125 PetriNetUnfolderBase]: For 3536/3536 co-relation queries the response was YES. [2023-08-27 10:07:26,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87024 conditions, 36638 events. 26769/36638 cut-off events. For 3536/3536 co-relation queries the response was YES. Maximal size of possible extension queue 1047. Compared 207558 event pairs, 9976 based on Foata normal form. 0/31754 useless extension candidates. Maximal degree in co-relation 87016. Up to 22931 conditions per place. [2023-08-27 10:07:26,827 INFO L140 encePairwiseOnDemand]: 259/268 looper letters, 61 selfloop transitions, 8 changer transitions 0/69 dead transitions. [2023-08-27 10:07:26,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 69 transitions, 348 flow [2023-08-27 10:07:26,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:07:26,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:07:26,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2023-08-27 10:07:26,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48756218905472637 [2023-08-27 10:07:26,828 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 392 transitions. [2023-08-27 10:07:26,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 392 transitions. [2023-08-27 10:07:26,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:07:26,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 392 transitions. [2023-08-27 10:07:26,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:26,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:26,831 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:26,831 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 114 flow. Second operand 3 states and 392 transitions. [2023-08-27 10:07:26,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 69 transitions, 348 flow [2023-08-27 10:07:26,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 69 transitions, 339 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:07:26,835 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 171 flow [2023-08-27 10:07:26,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=171, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2023-08-27 10:07:26,836 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2023-08-27 10:07:26,836 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 171 flow [2023-08-27 10:07:26,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:26,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:26,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:07:26,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 10:07:26,837 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:07:26,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:26,837 INFO L85 PathProgramCache]: Analyzing trace with hash -179656066, now seen corresponding path program 1 times [2023-08-27 10:07:26,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:26,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218525823] [2023-08-27 10:07:26,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:26,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:07:26,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:07:26,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:07:26,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218525823] [2023-08-27 10:07:26,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218525823] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:07:26,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:07:26,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:07:26,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479844807] [2023-08-27 10:07:26,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:07:26,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:07:26,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:07:26,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:07:26,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:07:26,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 268 [2023-08-27 10:07:26,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:26,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:07:26,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 268 [2023-08-27 10:07:26,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:07:28,862 INFO L124 PetriNetUnfolderBase]: 15441/21800 cut-off events. [2023-08-27 10:07:28,863 INFO L125 PetriNetUnfolderBase]: For 8885/9323 co-relation queries the response was YES. [2023-08-27 10:07:28,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56870 conditions, 21800 events. 15441/21800 cut-off events. For 8885/9323 co-relation queries the response was YES. Maximal size of possible extension queue 977. Compared 135360 event pairs, 3998 based on Foata normal form. 12/20154 useless extension candidates. Maximal degree in co-relation 56859. Up to 8412 conditions per place. [2023-08-27 10:07:28,946 INFO L140 encePairwiseOnDemand]: 259/268 looper letters, 73 selfloop transitions, 9 changer transitions 0/90 dead transitions. [2023-08-27 10:07:28,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 90 transitions, 485 flow [2023-08-27 10:07:28,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:07:28,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:07:28,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 537 transitions. [2023-08-27 10:07:28,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5009328358208955 [2023-08-27 10:07:28,948 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 537 transitions. [2023-08-27 10:07:28,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 537 transitions. [2023-08-27 10:07:28,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:07:28,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 537 transitions. [2023-08-27 10:07:28,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:28,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:28,951 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:28,951 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 171 flow. Second operand 4 states and 537 transitions. [2023-08-27 10:07:28,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 90 transitions, 485 flow [2023-08-27 10:07:28,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 90 transitions, 457 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:07:28,970 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 213 flow [2023-08-27 10:07:28,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=213, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2023-08-27 10:07:28,972 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2023-08-27 10:07:28,972 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 213 flow [2023-08-27 10:07:28,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:28,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:28,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:07:28,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 10:07:28,972 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:07:28,973 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:28,973 INFO L85 PathProgramCache]: Analyzing trace with hash -512668572, now seen corresponding path program 1 times [2023-08-27 10:07:28,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:28,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025779933] [2023-08-27 10:07:28,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:28,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:07:29,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:07:29,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:07:29,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025779933] [2023-08-27 10:07:29,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025779933] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:07:29,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:07:29,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:07:29,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344271144] [2023-08-27 10:07:29,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:07:29,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:07:29,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:07:29,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:07:29,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:07:29,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 268 [2023-08-27 10:07:29,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 213 flow. Second operand has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:29,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:07:29,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 268 [2023-08-27 10:07:29,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:07:30,683 INFO L124 PetriNetUnfolderBase]: 18782/25685 cut-off events. [2023-08-27 10:07:30,684 INFO L125 PetriNetUnfolderBase]: For 21794/21794 co-relation queries the response was YES. [2023-08-27 10:07:30,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74035 conditions, 25685 events. 18782/25685 cut-off events. For 21794/21794 co-relation queries the response was YES. Maximal size of possible extension queue 756. Compared 135615 event pairs, 4775 based on Foata normal form. 0/24484 useless extension candidates. Maximal degree in co-relation 74023. Up to 11907 conditions per place. [2023-08-27 10:07:30,802 INFO L140 encePairwiseOnDemand]: 259/268 looper letters, 92 selfloop transitions, 9 changer transitions 0/101 dead transitions. [2023-08-27 10:07:30,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 101 transitions, 667 flow [2023-08-27 10:07:30,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:07:30,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:07:30,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 514 transitions. [2023-08-27 10:07:30,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47947761194029853 [2023-08-27 10:07:30,803 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 514 transitions. [2023-08-27 10:07:30,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 514 transitions. [2023-08-27 10:07:30,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:07:30,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 514 transitions. [2023-08-27 10:07:30,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:30,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:30,806 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:30,806 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 213 flow. Second operand 4 states and 514 transitions. [2023-08-27 10:07:30,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 101 transitions, 667 flow [2023-08-27 10:07:30,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 101 transitions, 621 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-08-27 10:07:30,822 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 263 flow [2023-08-27 10:07:30,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=263, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2023-08-27 10:07:30,823 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2023-08-27 10:07:30,823 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 263 flow [2023-08-27 10:07:30,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:30,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:30,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:07:30,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 10:07:30,824 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:07:30,824 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:30,824 INFO L85 PathProgramCache]: Analyzing trace with hash -885552175, now seen corresponding path program 1 times [2023-08-27 10:07:30,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:30,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922025053] [2023-08-27 10:07:30,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:30,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:07:30,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:07:30,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:07:30,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922025053] [2023-08-27 10:07:30,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922025053] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:07:30,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:07:30,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:07:30,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037038801] [2023-08-27 10:07:30,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:07:30,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:07:30,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:07:30,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:07:30,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:07:30,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 268 [2023-08-27 10:07:30,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 263 flow. Second operand has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:30,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:07:30,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 268 [2023-08-27 10:07:30,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:07:32,710 INFO L124 PetriNetUnfolderBase]: 18504/25304 cut-off events. [2023-08-27 10:07:32,710 INFO L125 PetriNetUnfolderBase]: For 25120/25120 co-relation queries the response was YES. [2023-08-27 10:07:32,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77219 conditions, 25304 events. 18504/25304 cut-off events. For 25120/25120 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 135926 event pairs, 3874 based on Foata normal form. 40/24701 useless extension candidates. Maximal degree in co-relation 77204. Up to 15401 conditions per place. [2023-08-27 10:07:32,818 INFO L140 encePairwiseOnDemand]: 259/268 looper letters, 96 selfloop transitions, 19 changer transitions 0/115 dead transitions. [2023-08-27 10:07:32,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 115 transitions, 763 flow [2023-08-27 10:07:32,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:07:32,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:07:32,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 523 transitions. [2023-08-27 10:07:32,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4878731343283582 [2023-08-27 10:07:32,820 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 523 transitions. [2023-08-27 10:07:32,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 523 transitions. [2023-08-27 10:07:32,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:07:32,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 523 transitions. [2023-08-27 10:07:32,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:32,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:32,822 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:32,822 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 263 flow. Second operand 4 states and 523 transitions. [2023-08-27 10:07:32,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 115 transitions, 763 flow [2023-08-27 10:07:32,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 115 transitions, 758 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:07:32,863 INFO L231 Difference]: Finished difference. Result has 60 places, 65 transitions, 433 flow [2023-08-27 10:07:32,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=433, PETRI_PLACES=60, PETRI_TRANSITIONS=65} [2023-08-27 10:07:32,864 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2023-08-27 10:07:32,864 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 65 transitions, 433 flow [2023-08-27 10:07:32,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:32,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:32,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:07:32,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 10:07:32,865 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:07:32,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:32,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1682291036, now seen corresponding path program 1 times [2023-08-27 10:07:32,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:32,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678868437] [2023-08-27 10:07:32,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:32,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:07:32,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:07:32,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:07:32,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678868437] [2023-08-27 10:07:32,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678868437] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:07:32,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:07:32,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:07:32,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93706113] [2023-08-27 10:07:32,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:07:32,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:07:32,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:07:32,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:07:32,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:07:32,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 268 [2023-08-27 10:07:32,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 65 transitions, 433 flow. Second operand has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:32,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:07:32,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 268 [2023-08-27 10:07:32,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:07:34,358 INFO L124 PetriNetUnfolderBase]: 11199/16671 cut-off events. [2023-08-27 10:07:34,359 INFO L125 PetriNetUnfolderBase]: For 23460/24510 co-relation queries the response was YES. [2023-08-27 10:07:34,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52060 conditions, 16671 events. 11199/16671 cut-off events. For 23460/24510 co-relation queries the response was YES. Maximal size of possible extension queue 745. Compared 107585 event pairs, 1697 based on Foata normal form. 1441/16848 useless extension candidates. Maximal degree in co-relation 52041. Up to 8671 conditions per place. [2023-08-27 10:07:34,442 INFO L140 encePairwiseOnDemand]: 261/268 looper letters, 88 selfloop transitions, 6 changer transitions 0/111 dead transitions. [2023-08-27 10:07:34,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 111 transitions, 847 flow [2023-08-27 10:07:34,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:07:34,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:07:34,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 520 transitions. [2023-08-27 10:07:34,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48507462686567165 [2023-08-27 10:07:34,444 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 520 transitions. [2023-08-27 10:07:34,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 520 transitions. [2023-08-27 10:07:34,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:07:34,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 520 transitions. [2023-08-27 10:07:34,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:34,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:34,447 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:34,447 INFO L175 Difference]: Start difference. First operand has 60 places, 65 transitions, 433 flow. Second operand 4 states and 520 transitions. [2023-08-27 10:07:34,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 111 transitions, 847 flow [2023-08-27 10:07:34,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 111 transitions, 847 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 10:07:34,499 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 463 flow [2023-08-27 10:07:34,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=463, PETRI_PLACES=65, PETRI_TRANSITIONS=66} [2023-08-27 10:07:34,499 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2023-08-27 10:07:34,499 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 463 flow [2023-08-27 10:07:34,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:34,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:34,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:07:34,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 10:07:34,500 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:07:34,500 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:34,500 INFO L85 PathProgramCache]: Analyzing trace with hash 860670259, now seen corresponding path program 1 times [2023-08-27 10:07:34,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:34,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099829274] [2023-08-27 10:07:34,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:34,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:07:34,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:07:34,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:07:34,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099829274] [2023-08-27 10:07:34,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099829274] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:07:34,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:07:34,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:07:34,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37652255] [2023-08-27 10:07:34,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:07:34,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:07:34,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:07:34,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:07:34,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:07:34,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 268 [2023-08-27 10:07:34,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 463 flow. Second operand has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:34,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:07:34,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 268 [2023-08-27 10:07:34,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:07:35,930 INFO L124 PetriNetUnfolderBase]: 8113/12586 cut-off events. [2023-08-27 10:07:35,930 INFO L125 PetriNetUnfolderBase]: For 24019/24644 co-relation queries the response was YES. [2023-08-27 10:07:35,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43028 conditions, 12586 events. 8113/12586 cut-off events. For 24019/24644 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 82921 event pairs, 1558 based on Foata normal form. 953/12274 useless extension candidates. Maximal degree in co-relation 43005. Up to 3886 conditions per place. [2023-08-27 10:07:36,013 INFO L140 encePairwiseOnDemand]: 261/268 looper letters, 95 selfloop transitions, 10 changer transitions 0/121 dead transitions. [2023-08-27 10:07:36,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 121 transitions, 926 flow [2023-08-27 10:07:36,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:07:36,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:07:36,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 651 transitions. [2023-08-27 10:07:36,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48582089552238805 [2023-08-27 10:07:36,016 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 651 transitions. [2023-08-27 10:07:36,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 651 transitions. [2023-08-27 10:07:36,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:07:36,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 651 transitions. [2023-08-27 10:07:36,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:36,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 268.0) internal successors, (1608), 6 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:36,020 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 268.0) internal successors, (1608), 6 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:36,020 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 463 flow. Second operand 5 states and 651 transitions. [2023-08-27 10:07:36,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 121 transitions, 926 flow [2023-08-27 10:07:36,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 121 transitions, 918 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:07:36,052 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 471 flow [2023-08-27 10:07:36,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=471, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2023-08-27 10:07:36,053 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2023-08-27 10:07:36,053 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 471 flow [2023-08-27 10:07:36,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:36,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:36,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:07:36,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 10:07:36,061 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:07:36,061 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:36,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1383063193, now seen corresponding path program 1 times [2023-08-27 10:07:36,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:36,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264781256] [2023-08-27 10:07:36,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:36,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:36,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:07:36,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:07:36,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:07:36,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264781256] [2023-08-27 10:07:36,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264781256] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:07:36,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:07:36,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:07:36,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454038550] [2023-08-27 10:07:36,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:07:36,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:07:36,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:07:36,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:07:36,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:07:36,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 268 [2023-08-27 10:07:36,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 471 flow. Second operand has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:36,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:07:36,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 268 [2023-08-27 10:07:36,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:07:37,302 INFO L124 PetriNetUnfolderBase]: 7132/10887 cut-off events. [2023-08-27 10:07:37,302 INFO L125 PetriNetUnfolderBase]: For 28138/28692 co-relation queries the response was YES. [2023-08-27 10:07:37,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40329 conditions, 10887 events. 7132/10887 cut-off events. For 28138/28692 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 69158 event pairs, 1474 based on Foata normal form. 181/10591 useless extension candidates. Maximal degree in co-relation 40304. Up to 3886 conditions per place. [2023-08-27 10:07:37,372 INFO L140 encePairwiseOnDemand]: 259/268 looper letters, 94 selfloop transitions, 13 changer transitions 0/123 dead transitions. [2023-08-27 10:07:37,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 123 transitions, 976 flow [2023-08-27 10:07:37,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:07:37,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:07:37,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 665 transitions. [2023-08-27 10:07:37,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4962686567164179 [2023-08-27 10:07:37,374 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 665 transitions. [2023-08-27 10:07:37,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 665 transitions. [2023-08-27 10:07:37,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:07:37,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 665 transitions. [2023-08-27 10:07:37,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:37,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 268.0) internal successors, (1608), 6 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:37,378 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 268.0) internal successors, (1608), 6 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:37,378 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 471 flow. Second operand 5 states and 665 transitions. [2023-08-27 10:07:37,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 123 transitions, 976 flow [2023-08-27 10:07:37,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 123 transitions, 960 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 10:07:37,405 INFO L231 Difference]: Finished difference. Result has 71 places, 68 transitions, 530 flow [2023-08-27 10:07:37,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=530, PETRI_PLACES=71, PETRI_TRANSITIONS=68} [2023-08-27 10:07:37,405 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 20 predicate places. [2023-08-27 10:07:37,405 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 68 transitions, 530 flow [2023-08-27 10:07:37,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:37,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:37,406 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-27 10:07:37,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 10:07:37,406 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:07:37,406 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:37,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1678890527, now seen corresponding path program 1 times [2023-08-27 10:07:37,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:37,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667039458] [2023-08-27 10:07:37,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:37,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:07:37,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:07:37,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:07:37,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667039458] [2023-08-27 10:07:37,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667039458] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:07:37,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:07:37,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:07:37,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692157293] [2023-08-27 10:07:37,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:07:37,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:07:37,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:07:37,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:07:37,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:07:37,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 268 [2023-08-27 10:07:37,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 530 flow. Second operand has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:37,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:07:37,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 268 [2023-08-27 10:07:37,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:07:38,436 INFO L124 PetriNetUnfolderBase]: 6294/9605 cut-off events. [2023-08-27 10:07:38,437 INFO L125 PetriNetUnfolderBase]: For 28526/29033 co-relation queries the response was YES. [2023-08-27 10:07:38,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36953 conditions, 9605 events. 6294/9605 cut-off events. For 28526/29033 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 60583 event pairs, 1442 based on Foata normal form. 371/9513 useless extension candidates. Maximal degree in co-relation 36927. Up to 3886 conditions per place. [2023-08-27 10:07:38,489 INFO L140 encePairwiseOnDemand]: 261/268 looper letters, 105 selfloop transitions, 14 changer transitions 0/135 dead transitions. [2023-08-27 10:07:38,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 135 transitions, 1080 flow [2023-08-27 10:07:38,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:07:38,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:07:38,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 780 transitions. [2023-08-27 10:07:38,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48507462686567165 [2023-08-27 10:07:38,491 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 780 transitions. [2023-08-27 10:07:38,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 780 transitions. [2023-08-27 10:07:38,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:07:38,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 780 transitions. [2023-08-27 10:07:38,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.0) internal successors, (780), 6 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:38,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 268.0) internal successors, (1876), 7 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:38,494 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 268.0) internal successors, (1876), 7 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:38,494 INFO L175 Difference]: Start difference. First operand has 71 places, 68 transitions, 530 flow. Second operand 6 states and 780 transitions. [2023-08-27 10:07:38,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 135 transitions, 1080 flow [2023-08-27 10:07:38,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 135 transitions, 1019 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-08-27 10:07:38,715 INFO L231 Difference]: Finished difference. Result has 74 places, 67 transitions, 512 flow [2023-08-27 10:07:38,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=512, PETRI_PLACES=74, PETRI_TRANSITIONS=67} [2023-08-27 10:07:38,716 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 23 predicate places. [2023-08-27 10:07:38,716 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 512 flow [2023-08-27 10:07:38,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:38,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:38,716 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-27 10:07:38,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 10:07:38,717 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:07:38,717 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:38,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1425252087, now seen corresponding path program 1 times [2023-08-27 10:07:38,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:38,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872347289] [2023-08-27 10:07:38,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:38,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:07:39,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:07:39,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:07:39,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872347289] [2023-08-27 10:07:39,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872347289] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:07:39,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:07:39,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:07:39,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627205407] [2023-08-27 10:07:39,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:07:39,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 10:07:39,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:07:39,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 10:07:39,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-27 10:07:39,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 268 [2023-08-27 10:07:39,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 67 transitions, 512 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-27 10:07:39,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:07:39,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 268 [2023-08-27 10:07:39,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:07:40,221 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_60 256) 0)) (.cse6 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse6)) (.cse7 (and .cse6 .cse4)) (.cse12 (= (mod v_~b$w_buff0_used~0_150 256) 0)) (.cse9 (and .cse6 (= (mod v_~b$w_buff1_used~0_133 256) 0)))) (let ((.cse10 (or .cse7 .cse12 .cse9)) (.cse11 (and (not .cse12) .cse8))) (let ((.cse2 (= (mod v_~b$w_buff1_used~0_132 256) 0)) (.cse5 (ite .cse10 v_~b~0_93 (ite .cse11 v_~b$w_buff0~0_61 v_~b$w_buff1~0_64))) (.cse3 (= (mod v_~b$w_buff0_used~0_149 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0)))) (and (= v_~b$w_buff0~0_61 v_~b$w_buff0~0_60) (= (ite .cse0 v_~b$r_buff1_thd4~0_60 (ite (let ((.cse1 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse1 .cse4))) v_~b$r_buff1_thd4~0_60 0)) v_~b$r_buff1_thd4~0_59) (= v_~b~0_92 (ite .cse0 v_~b$mem_tmp~0_18 .cse5)) (= v_~b$flush_delayed~0_25 0) (= (ite .cse0 v_~b$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse2) .cse7 .cse3) v_~b$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse3)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= .cse5 v_~__unbuffered_p3_EBX~0_10) (= v_~b$mem_tmp~0_18 v_~b~0_93) (= v_~b$w_buff1_used~0_132 (ite .cse0 v_~b$w_buff1_used~0_133 (ite (or .cse7 .cse3 .cse9) v_~b$w_buff1_used~0_133 0))) (= v_~b$w_buff1~0_64 v_~b$w_buff1~0_63) (= (ite .cse0 v_~b$w_buff0_used~0_150 (ite .cse10 v_~b$w_buff0_used~0_150 (ite .cse11 0 v_~b$w_buff0_used~0_150))) v_~b$w_buff0_used~0_149)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_150, ~b~0=v_~b~0_93, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_133, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_60, ~b$w_buff1~0=v_~b$w_buff1~0_64, ~b$w_buff0~0=v_~b$w_buff0~0_61, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_149, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_92, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_132, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_59, ~b$w_buff1~0=v_~b$w_buff1~0_63, ~b$w_buff0~0=v_~b$w_buff0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][87], [Black: 194#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 193#(= ~x~0 0), 164#(<= 0 ~__unbuffered_cnt~0), 79#L878-3true, 102#L847true, 50#L795true, Black: 204#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 0)), 183#true, 236#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, Black: 212#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), P2Thread1of1ForFork2InUse, 202#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), 120#P0EXITtrue, Black: 224#(<= ~__unbuffered_cnt~0 2), Black: 168#(<= ~__unbuffered_cnt~0 0), 191#true, 252#(and (= ~b$r_buff0_thd4~0 0) (<= ~b$w_buff0_used~0 0) (< 0 (+ (div ~b$w_buff1_used~0 256) 1)) (= ~__unbuffered_p3_EBX~0 1) (= 0 ~b$r_buff1_thd4~0) (<= ~b$w_buff1_used~0 (* 256 (div ~b$w_buff1_used~0 256))) (= ~b~0 1) (= ~b$w_buff0~0 1) (<= 0 ~b$w_buff0_used~0)), 52#L808true, Black: 238#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 2)), Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 232#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), 216#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), Black: 185#(= ~__unbuffered_p3_EAX~0 0), Black: 186#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))]) [2023-08-27 10:07:40,222 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is not cut-off event [2023-08-27 10:07:40,222 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-27 10:07:40,222 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-27 10:07:40,222 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-27 10:07:40,366 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_60 256) 0)) (.cse6 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse6)) (.cse7 (and .cse6 .cse4)) (.cse12 (= (mod v_~b$w_buff0_used~0_150 256) 0)) (.cse9 (and .cse6 (= (mod v_~b$w_buff1_used~0_133 256) 0)))) (let ((.cse10 (or .cse7 .cse12 .cse9)) (.cse11 (and (not .cse12) .cse8))) (let ((.cse2 (= (mod v_~b$w_buff1_used~0_132 256) 0)) (.cse5 (ite .cse10 v_~b~0_93 (ite .cse11 v_~b$w_buff0~0_61 v_~b$w_buff1~0_64))) (.cse3 (= (mod v_~b$w_buff0_used~0_149 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0)))) (and (= v_~b$w_buff0~0_61 v_~b$w_buff0~0_60) (= (ite .cse0 v_~b$r_buff1_thd4~0_60 (ite (let ((.cse1 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse1 .cse4))) v_~b$r_buff1_thd4~0_60 0)) v_~b$r_buff1_thd4~0_59) (= v_~b~0_92 (ite .cse0 v_~b$mem_tmp~0_18 .cse5)) (= v_~b$flush_delayed~0_25 0) (= (ite .cse0 v_~b$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse2) .cse7 .cse3) v_~b$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse3)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= .cse5 v_~__unbuffered_p3_EBX~0_10) (= v_~b$mem_tmp~0_18 v_~b~0_93) (= v_~b$w_buff1_used~0_132 (ite .cse0 v_~b$w_buff1_used~0_133 (ite (or .cse7 .cse3 .cse9) v_~b$w_buff1_used~0_133 0))) (= v_~b$w_buff1~0_64 v_~b$w_buff1~0_63) (= (ite .cse0 v_~b$w_buff0_used~0_150 (ite .cse10 v_~b$w_buff0_used~0_150 (ite .cse11 0 v_~b$w_buff0_used~0_150))) v_~b$w_buff0_used~0_149)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_150, ~b~0=v_~b~0_93, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_133, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_60, ~b$w_buff1~0=v_~b$w_buff1~0_64, ~b$w_buff0~0=v_~b$w_buff0~0_61, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_149, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_92, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_132, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_59, ~b$w_buff1~0=v_~b$w_buff1~0_63, ~b$w_buff0~0=v_~b$w_buff0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][87], [114#L881true, Black: 194#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 193#(= ~x~0 0), 164#(<= 0 ~__unbuffered_cnt~0), 102#L847true, 50#L795true, Black: 204#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 0)), 183#true, P1Thread1of1ForFork1InUse, 236#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, Black: 212#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), P2Thread1of1ForFork2InUse, 202#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), 120#P0EXITtrue, Black: 224#(<= ~__unbuffered_cnt~0 2), 191#true, Black: 168#(<= ~__unbuffered_cnt~0 0), 252#(and (= ~b$r_buff0_thd4~0 0) (<= ~b$w_buff0_used~0 0) (< 0 (+ (div ~b$w_buff1_used~0 256) 1)) (= ~__unbuffered_p3_EBX~0 1) (= 0 ~b$r_buff1_thd4~0) (<= ~b$w_buff1_used~0 (* 256 (div ~b$w_buff1_used~0 256))) (= ~b~0 1) (= ~b$w_buff0~0 1) (<= 0 ~b$w_buff0_used~0)), 52#L808true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 238#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 2)), Black: 232#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), Black: 185#(= ~__unbuffered_p3_EAX~0 0), 216#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), Black: 186#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))]) [2023-08-27 10:07:40,366 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2023-08-27 10:07:40,366 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-27 10:07:40,367 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-27 10:07:40,367 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-27 10:07:40,369 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_60 256) 0)) (.cse6 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse6)) (.cse7 (and .cse6 .cse4)) (.cse12 (= (mod v_~b$w_buff0_used~0_150 256) 0)) (.cse9 (and .cse6 (= (mod v_~b$w_buff1_used~0_133 256) 0)))) (let ((.cse10 (or .cse7 .cse12 .cse9)) (.cse11 (and (not .cse12) .cse8))) (let ((.cse2 (= (mod v_~b$w_buff1_used~0_132 256) 0)) (.cse5 (ite .cse10 v_~b~0_93 (ite .cse11 v_~b$w_buff0~0_61 v_~b$w_buff1~0_64))) (.cse3 (= (mod v_~b$w_buff0_used~0_149 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0)))) (and (= v_~b$w_buff0~0_61 v_~b$w_buff0~0_60) (= (ite .cse0 v_~b$r_buff1_thd4~0_60 (ite (let ((.cse1 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse1 .cse4))) v_~b$r_buff1_thd4~0_60 0)) v_~b$r_buff1_thd4~0_59) (= v_~b~0_92 (ite .cse0 v_~b$mem_tmp~0_18 .cse5)) (= v_~b$flush_delayed~0_25 0) (= (ite .cse0 v_~b$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse2) .cse7 .cse3) v_~b$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse3)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= .cse5 v_~__unbuffered_p3_EBX~0_10) (= v_~b$mem_tmp~0_18 v_~b~0_93) (= v_~b$w_buff1_used~0_132 (ite .cse0 v_~b$w_buff1_used~0_133 (ite (or .cse7 .cse3 .cse9) v_~b$w_buff1_used~0_133 0))) (= v_~b$w_buff1~0_64 v_~b$w_buff1~0_63) (= (ite .cse0 v_~b$w_buff0_used~0_150 (ite .cse10 v_~b$w_buff0_used~0_150 (ite .cse11 0 v_~b$w_buff0_used~0_150))) v_~b$w_buff0_used~0_149)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_150, ~b~0=v_~b~0_93, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_133, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_60, ~b$w_buff1~0=v_~b$w_buff1~0_64, ~b$w_buff0~0=v_~b$w_buff0~0_61, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_149, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_92, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_132, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_59, ~b$w_buff1~0=v_~b$w_buff1~0_63, ~b$w_buff0~0=v_~b$w_buff0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][87], [Black: 194#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 193#(= ~x~0 0), 164#(<= 0 ~__unbuffered_cnt~0), 79#L878-3true, 102#L847true, Black: 204#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 0)), 183#true, 101#P1EXITtrue, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, Black: 216#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P2Thread1of1ForFork2InUse, 202#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), 120#P0EXITtrue, 224#(<= ~__unbuffered_cnt~0 2), Black: 168#(<= ~__unbuffered_cnt~0 0), 191#true, 252#(and (= ~b$r_buff0_thd4~0 0) (<= ~b$w_buff0_used~0 0) (< 0 (+ (div ~b$w_buff1_used~0 256) 1)) (= ~__unbuffered_p3_EBX~0 1) (= 0 ~b$r_buff1_thd4~0) (<= ~b$w_buff1_used~0 (* 256 (div ~b$w_buff1_used~0 256))) (= ~b~0 1) (= ~b$w_buff0~0 1) (<= 0 ~b$w_buff0_used~0)), 52#L808true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 232#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), Black: 180#(<= ~__unbuffered_cnt~0 1), 238#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 2)), Black: 185#(= ~__unbuffered_p3_EAX~0 0), Black: 186#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 212#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))]) [2023-08-27 10:07:40,369 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2023-08-27 10:07:40,369 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-27 10:07:40,369 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-27 10:07:40,369 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-27 10:07:40,369 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_60 256) 0)) (.cse6 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse6)) (.cse7 (and .cse6 .cse4)) (.cse12 (= (mod v_~b$w_buff0_used~0_150 256) 0)) (.cse9 (and .cse6 (= (mod v_~b$w_buff1_used~0_133 256) 0)))) (let ((.cse10 (or .cse7 .cse12 .cse9)) (.cse11 (and (not .cse12) .cse8))) (let ((.cse2 (= (mod v_~b$w_buff1_used~0_132 256) 0)) (.cse5 (ite .cse10 v_~b~0_93 (ite .cse11 v_~b$w_buff0~0_61 v_~b$w_buff1~0_64))) (.cse3 (= (mod v_~b$w_buff0_used~0_149 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0)))) (and (= v_~b$w_buff0~0_61 v_~b$w_buff0~0_60) (= (ite .cse0 v_~b$r_buff1_thd4~0_60 (ite (let ((.cse1 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse1 .cse4))) v_~b$r_buff1_thd4~0_60 0)) v_~b$r_buff1_thd4~0_59) (= v_~b~0_92 (ite .cse0 v_~b$mem_tmp~0_18 .cse5)) (= v_~b$flush_delayed~0_25 0) (= (ite .cse0 v_~b$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse2) .cse7 .cse3) v_~b$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse3)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= .cse5 v_~__unbuffered_p3_EBX~0_10) (= v_~b$mem_tmp~0_18 v_~b~0_93) (= v_~b$w_buff1_used~0_132 (ite .cse0 v_~b$w_buff1_used~0_133 (ite (or .cse7 .cse3 .cse9) v_~b$w_buff1_used~0_133 0))) (= v_~b$w_buff1~0_64 v_~b$w_buff1~0_63) (= (ite .cse0 v_~b$w_buff0_used~0_150 (ite .cse10 v_~b$w_buff0_used~0_150 (ite .cse11 0 v_~b$w_buff0_used~0_150))) v_~b$w_buff0_used~0_149)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_150, ~b~0=v_~b~0_93, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_133, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_60, ~b$w_buff1~0=v_~b$w_buff1~0_64, ~b$w_buff0~0=v_~b$w_buff0~0_61, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_149, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_92, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_132, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_59, ~b$w_buff1~0=v_~b$w_buff1~0_63, ~b$w_buff0~0=v_~b$w_buff0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][87], [114#L881true, Black: 194#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 193#(= ~x~0 0), 164#(<= 0 ~__unbuffered_cnt~0), 102#L847true, 50#L795true, Black: 202#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), Black: 204#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 0)), 183#true, 236#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, Black: 212#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), P2Thread1of1ForFork2InUse, 120#P0EXITtrue, Black: 224#(<= ~__unbuffered_cnt~0 2), Black: 168#(<= ~__unbuffered_cnt~0 0), 191#true, 252#(and (= ~b$r_buff0_thd4~0 0) (<= ~b$w_buff0_used~0 0) (< 0 (+ (div ~b$w_buff1_used~0 256) 1)) (= ~__unbuffered_p3_EBX~0 1) (= 0 ~b$r_buff1_thd4~0) (<= ~b$w_buff1_used~0 (* 256 (div ~b$w_buff1_used~0 256))) (= ~b~0 1) (= ~b$w_buff0~0 1) (<= 0 ~b$w_buff0_used~0)), 52#L808true, Black: 238#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 2)), Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 232#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), 216#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), Black: 185#(= ~__unbuffered_p3_EAX~0 0), Black: 186#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))]) [2023-08-27 10:07:40,369 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2023-08-27 10:07:40,370 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-27 10:07:40,370 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-27 10:07:40,370 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-27 10:07:40,498 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_60 256) 0)) (.cse6 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse6)) (.cse7 (and .cse6 .cse4)) (.cse12 (= (mod v_~b$w_buff0_used~0_150 256) 0)) (.cse9 (and .cse6 (= (mod v_~b$w_buff1_used~0_133 256) 0)))) (let ((.cse10 (or .cse7 .cse12 .cse9)) (.cse11 (and (not .cse12) .cse8))) (let ((.cse2 (= (mod v_~b$w_buff1_used~0_132 256) 0)) (.cse5 (ite .cse10 v_~b~0_93 (ite .cse11 v_~b$w_buff0~0_61 v_~b$w_buff1~0_64))) (.cse3 (= (mod v_~b$w_buff0_used~0_149 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0)))) (and (= v_~b$w_buff0~0_61 v_~b$w_buff0~0_60) (= (ite .cse0 v_~b$r_buff1_thd4~0_60 (ite (let ((.cse1 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse1 .cse4))) v_~b$r_buff1_thd4~0_60 0)) v_~b$r_buff1_thd4~0_59) (= v_~b~0_92 (ite .cse0 v_~b$mem_tmp~0_18 .cse5)) (= v_~b$flush_delayed~0_25 0) (= (ite .cse0 v_~b$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse2) .cse7 .cse3) v_~b$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse3)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= .cse5 v_~__unbuffered_p3_EBX~0_10) (= v_~b$mem_tmp~0_18 v_~b~0_93) (= v_~b$w_buff1_used~0_132 (ite .cse0 v_~b$w_buff1_used~0_133 (ite (or .cse7 .cse3 .cse9) v_~b$w_buff1_used~0_133 0))) (= v_~b$w_buff1~0_64 v_~b$w_buff1~0_63) (= (ite .cse0 v_~b$w_buff0_used~0_150 (ite .cse10 v_~b$w_buff0_used~0_150 (ite .cse11 0 v_~b$w_buff0_used~0_150))) v_~b$w_buff0_used~0_149)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_150, ~b~0=v_~b~0_93, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_133, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_60, ~b$w_buff1~0=v_~b$w_buff1~0_64, ~b$w_buff0~0=v_~b$w_buff0~0_61, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_149, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_92, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_132, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_59, ~b$w_buff1~0=v_~b$w_buff1~0_63, ~b$w_buff0~0=v_~b$w_buff0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][87], [114#L881true, Black: 194#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 193#(= ~x~0 0), 164#(<= 0 ~__unbuffered_cnt~0), 102#L847true, Black: 204#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 0)), 183#true, 101#P1EXITtrue, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, Black: 216#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 202#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), 120#P0EXITtrue, 224#(<= ~__unbuffered_cnt~0 2), 191#true, Black: 168#(<= ~__unbuffered_cnt~0 0), 252#(and (= ~b$r_buff0_thd4~0 0) (<= ~b$w_buff0_used~0 0) (< 0 (+ (div ~b$w_buff1_used~0 256) 1)) (= ~__unbuffered_p3_EBX~0 1) (= 0 ~b$r_buff1_thd4~0) (<= ~b$w_buff1_used~0 (* 256 (div ~b$w_buff1_used~0 256))) (= ~b~0 1) (= ~b$w_buff0~0 1) (<= 0 ~b$w_buff0_used~0)), 52#L808true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 232#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), Black: 180#(<= ~__unbuffered_cnt~0 1), 238#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 2)), Black: 185#(= ~__unbuffered_p3_EAX~0 0), Black: 186#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 212#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))]) [2023-08-27 10:07:40,499 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2023-08-27 10:07:40,499 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-08-27 10:07:40,499 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-08-27 10:07:40,499 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-08-27 10:07:40,502 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_60 256) 0)) (.cse6 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse6)) (.cse7 (and .cse6 .cse4)) (.cse12 (= (mod v_~b$w_buff0_used~0_150 256) 0)) (.cse9 (and .cse6 (= (mod v_~b$w_buff1_used~0_133 256) 0)))) (let ((.cse10 (or .cse7 .cse12 .cse9)) (.cse11 (and (not .cse12) .cse8))) (let ((.cse2 (= (mod v_~b$w_buff1_used~0_132 256) 0)) (.cse5 (ite .cse10 v_~b~0_93 (ite .cse11 v_~b$w_buff0~0_61 v_~b$w_buff1~0_64))) (.cse3 (= (mod v_~b$w_buff0_used~0_149 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0)))) (and (= v_~b$w_buff0~0_61 v_~b$w_buff0~0_60) (= (ite .cse0 v_~b$r_buff1_thd4~0_60 (ite (let ((.cse1 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse1 .cse4))) v_~b$r_buff1_thd4~0_60 0)) v_~b$r_buff1_thd4~0_59) (= v_~b~0_92 (ite .cse0 v_~b$mem_tmp~0_18 .cse5)) (= v_~b$flush_delayed~0_25 0) (= (ite .cse0 v_~b$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse2) .cse7 .cse3) v_~b$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse3)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= .cse5 v_~__unbuffered_p3_EBX~0_10) (= v_~b$mem_tmp~0_18 v_~b~0_93) (= v_~b$w_buff1_used~0_132 (ite .cse0 v_~b$w_buff1_used~0_133 (ite (or .cse7 .cse3 .cse9) v_~b$w_buff1_used~0_133 0))) (= v_~b$w_buff1~0_64 v_~b$w_buff1~0_63) (= (ite .cse0 v_~b$w_buff0_used~0_150 (ite .cse10 v_~b$w_buff0_used~0_150 (ite .cse11 0 v_~b$w_buff0_used~0_150))) v_~b$w_buff0_used~0_149)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_150, ~b~0=v_~b~0_93, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_133, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_60, ~b$w_buff1~0=v_~b$w_buff1~0_64, ~b$w_buff0~0=v_~b$w_buff0~0_61, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_149, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_92, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_132, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_59, ~b$w_buff1~0=v_~b$w_buff1~0_63, ~b$w_buff0~0=v_~b$w_buff0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][87], [114#L881true, Black: 194#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 193#(= ~x~0 0), 164#(<= 0 ~__unbuffered_cnt~0), 102#L847true, Black: 202#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), Black: 204#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 0)), 183#true, 101#P1EXITtrue, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, Black: 216#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P2Thread1of1ForFork2InUse, 120#P0EXITtrue, 224#(<= ~__unbuffered_cnt~0 2), Black: 168#(<= ~__unbuffered_cnt~0 0), 191#true, 252#(and (= ~b$r_buff0_thd4~0 0) (<= ~b$w_buff0_used~0 0) (< 0 (+ (div ~b$w_buff1_used~0 256) 1)) (= ~__unbuffered_p3_EBX~0 1) (= 0 ~b$r_buff1_thd4~0) (<= ~b$w_buff1_used~0 (* 256 (div ~b$w_buff1_used~0 256))) (= ~b~0 1) (= ~b$w_buff0~0 1) (<= 0 ~b$w_buff0_used~0)), 52#L808true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 232#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), Black: 180#(<= ~__unbuffered_cnt~0 1), 238#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 2)), Black: 185#(= ~__unbuffered_p3_EAX~0 0), Black: 186#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 212#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))]) [2023-08-27 10:07:40,502 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2023-08-27 10:07:40,503 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-08-27 10:07:40,503 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-08-27 10:07:40,503 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-08-27 10:07:40,503 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_60 256) 0)) (.cse6 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse6)) (.cse7 (and .cse6 .cse4)) (.cse12 (= (mod v_~b$w_buff0_used~0_150 256) 0)) (.cse9 (and .cse6 (= (mod v_~b$w_buff1_used~0_133 256) 0)))) (let ((.cse10 (or .cse7 .cse12 .cse9)) (.cse11 (and (not .cse12) .cse8))) (let ((.cse2 (= (mod v_~b$w_buff1_used~0_132 256) 0)) (.cse5 (ite .cse10 v_~b~0_93 (ite .cse11 v_~b$w_buff0~0_61 v_~b$w_buff1~0_64))) (.cse3 (= (mod v_~b$w_buff0_used~0_149 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0)))) (and (= v_~b$w_buff0~0_61 v_~b$w_buff0~0_60) (= (ite .cse0 v_~b$r_buff1_thd4~0_60 (ite (let ((.cse1 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse1 .cse4))) v_~b$r_buff1_thd4~0_60 0)) v_~b$r_buff1_thd4~0_59) (= v_~b~0_92 (ite .cse0 v_~b$mem_tmp~0_18 .cse5)) (= v_~b$flush_delayed~0_25 0) (= (ite .cse0 v_~b$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse2) .cse7 .cse3) v_~b$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse3)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= .cse5 v_~__unbuffered_p3_EBX~0_10) (= v_~b$mem_tmp~0_18 v_~b~0_93) (= v_~b$w_buff1_used~0_132 (ite .cse0 v_~b$w_buff1_used~0_133 (ite (or .cse7 .cse3 .cse9) v_~b$w_buff1_used~0_133 0))) (= v_~b$w_buff1~0_64 v_~b$w_buff1~0_63) (= (ite .cse0 v_~b$w_buff0_used~0_150 (ite .cse10 v_~b$w_buff0_used~0_150 (ite .cse11 0 v_~b$w_buff0_used~0_150))) v_~b$w_buff0_used~0_149)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_150, ~b~0=v_~b~0_93, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_133, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_60, ~b$w_buff1~0=v_~b$w_buff1~0_64, ~b$w_buff0~0=v_~b$w_buff0~0_61, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_149, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_92, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_132, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_59, ~b$w_buff1~0=v_~b$w_buff1~0_63, ~b$w_buff0~0=v_~b$w_buff0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][87], [114#L881true, Black: 194#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 193#(= ~x~0 0), 164#(<= 0 ~__unbuffered_cnt~0), 102#L847true, Black: 202#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), Black: 204#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 0)), 183#true, 101#P1EXITtrue, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, Black: 216#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), Black: 212#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), P2Thread1of1ForFork2InUse, 120#P0EXITtrue, 224#(<= ~__unbuffered_cnt~0 2), Black: 168#(<= ~__unbuffered_cnt~0 0), 191#true, 252#(and (= ~b$r_buff0_thd4~0 0) (<= ~b$w_buff0_used~0 0) (< 0 (+ (div ~b$w_buff1_used~0 256) 1)) (= ~__unbuffered_p3_EBX~0 1) (= 0 ~b$r_buff1_thd4~0) (<= ~b$w_buff1_used~0 (* 256 (div ~b$w_buff1_used~0 256))) (= ~b~0 1) (= ~b$w_buff0~0 1) (<= 0 ~b$w_buff0_used~0)), 52#L808true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 232#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), Black: 180#(<= ~__unbuffered_cnt~0 1), 238#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 2)), Black: 185#(= ~__unbuffered_p3_EAX~0 0), Black: 186#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))]) [2023-08-27 10:07:40,503 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2023-08-27 10:07:40,503 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-08-27 10:07:40,503 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-08-27 10:07:40,503 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-08-27 10:07:40,759 INFO L124 PetriNetUnfolderBase]: 10661/16951 cut-off events. [2023-08-27 10:07:40,759 INFO L125 PetriNetUnfolderBase]: For 61824/62379 co-relation queries the response was YES. [2023-08-27 10:07:40,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70317 conditions, 16951 events. 10661/16951 cut-off events. For 61824/62379 co-relation queries the response was YES. Maximal size of possible extension queue 890. Compared 122070 event pairs, 1435 based on Foata normal form. 78/16587 useless extension candidates. Maximal degree in co-relation 70290. Up to 5753 conditions per place. [2023-08-27 10:07:40,864 INFO L140 encePairwiseOnDemand]: 260/268 looper letters, 180 selfloop transitions, 8 changer transitions 3/207 dead transitions. [2023-08-27 10:07:40,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 207 transitions, 1933 flow [2023-08-27 10:07:40,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:07:40,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:07:40,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 782 transitions. [2023-08-27 10:07:40,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.486318407960199 [2023-08-27 10:07:40,866 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 782 transitions. [2023-08-27 10:07:40,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 782 transitions. [2023-08-27 10:07:40,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:07:40,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 782 transitions. [2023-08-27 10:07:40,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.33333333333334) internal successors, (782), 6 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:40,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 268.0) internal successors, (1876), 7 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:40,869 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 268.0) internal successors, (1876), 7 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:40,869 INFO L175 Difference]: Start difference. First operand has 74 places, 67 transitions, 512 flow. Second operand 6 states and 782 transitions. [2023-08-27 10:07:40,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 207 transitions, 1933 flow [2023-08-27 10:07:41,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 207 transitions, 1836 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 10:07:41,868 INFO L231 Difference]: Finished difference. Result has 78 places, 73 transitions, 564 flow [2023-08-27 10:07:41,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=564, PETRI_PLACES=78, PETRI_TRANSITIONS=73} [2023-08-27 10:07:41,869 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 27 predicate places. [2023-08-27 10:07:41,869 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 73 transitions, 564 flow [2023-08-27 10:07:41,869 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-27 10:07:41,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:41,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:07:41,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 10:07:41,869 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:07:41,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:41,869 INFO L85 PathProgramCache]: Analyzing trace with hash -2010315890, now seen corresponding path program 1 times [2023-08-27 10:07:41,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:41,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517997298] [2023-08-27 10:07:41,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:41,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:07:41,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:07:41,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:07:41,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517997298] [2023-08-27 10:07:41,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517997298] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:07:41,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:07:41,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:07:41,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305223979] [2023-08-27 10:07:41,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:07:41,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:07:41,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:07:41,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:07:41,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:07:41,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 268 [2023-08-27 10:07:41,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 73 transitions, 564 flow. Second operand has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:41,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:07:41,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 268 [2023-08-27 10:07:41,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:07:44,556 INFO L124 PetriNetUnfolderBase]: 21662/32374 cut-off events. [2023-08-27 10:07:44,556 INFO L125 PetriNetUnfolderBase]: For 118420/118420 co-relation queries the response was YES. [2023-08-27 10:07:44,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142898 conditions, 32374 events. 21662/32374 cut-off events. For 118420/118420 co-relation queries the response was YES. Maximal size of possible extension queue 1258. Compared 222123 event pairs, 2212 based on Foata normal form. 32/32116 useless extension candidates. Maximal degree in co-relation 142868. Up to 12115 conditions per place. [2023-08-27 10:07:44,737 INFO L140 encePairwiseOnDemand]: 258/268 looper letters, 192 selfloop transitions, 35 changer transitions 6/233 dead transitions. [2023-08-27 10:07:44,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 233 transitions, 2232 flow [2023-08-27 10:07:44,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:07:44,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:07:44,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 770 transitions. [2023-08-27 10:07:44,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47885572139303484 [2023-08-27 10:07:44,739 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 770 transitions. [2023-08-27 10:07:44,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 770 transitions. [2023-08-27 10:07:44,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:07:44,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 770 transitions. [2023-08-27 10:07:44,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:44,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 268.0) internal successors, (1876), 7 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:44,742 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 268.0) internal successors, (1876), 7 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:44,742 INFO L175 Difference]: Start difference. First operand has 78 places, 73 transitions, 564 flow. Second operand 6 states and 770 transitions. [2023-08-27 10:07:44,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 233 transitions, 2232 flow [2023-08-27 10:07:46,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 233 transitions, 2214 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:07:46,693 INFO L231 Difference]: Finished difference. Result has 84 places, 97 transitions, 933 flow [2023-08-27 10:07:46,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=933, PETRI_PLACES=84, PETRI_TRANSITIONS=97} [2023-08-27 10:07:46,693 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 33 predicate places. [2023-08-27 10:07:46,693 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 97 transitions, 933 flow [2023-08-27 10:07:46,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:46,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:46,694 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-27 10:07:46,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 10:07:46,694 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:07:46,694 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:46,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1571562895, now seen corresponding path program 2 times [2023-08-27 10:07:46,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:46,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175413696] [2023-08-27 10:07:46,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:46,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:07:46,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:07:46,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:07:46,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175413696] [2023-08-27 10:07:46,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175413696] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:07:46,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:07:46,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 10:07:46,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889251411] [2023-08-27 10:07:46,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:07:46,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 10:07:46,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:07:46,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 10:07:46,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-27 10:07:46,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 268 [2023-08-27 10:07:46,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 97 transitions, 933 flow. Second operand has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:46,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:07:46,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 268 [2023-08-27 10:07:46,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:07:48,925 INFO L124 PetriNetUnfolderBase]: 15229/23896 cut-off events. [2023-08-27 10:07:48,925 INFO L125 PetriNetUnfolderBase]: For 90262/90928 co-relation queries the response was YES. [2023-08-27 10:07:49,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104644 conditions, 23896 events. 15229/23896 cut-off events. For 90262/90928 co-relation queries the response was YES. Maximal size of possible extension queue 1310. Compared 181508 event pairs, 2342 based on Foata normal form. 307/23532 useless extension candidates. Maximal degree in co-relation 104611. Up to 9430 conditions per place. [2023-08-27 10:07:49,079 INFO L140 encePairwiseOnDemand]: 257/268 looper letters, 85 selfloop transitions, 18 changer transitions 48/167 dead transitions. [2023-08-27 10:07:49,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 167 transitions, 1738 flow [2023-08-27 10:07:49,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:07:49,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:07:49,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 877 transitions. [2023-08-27 10:07:49,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46748400852878463 [2023-08-27 10:07:49,081 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 877 transitions. [2023-08-27 10:07:49,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 877 transitions. [2023-08-27 10:07:49,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:07:49,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 877 transitions. [2023-08-27 10:07:49,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:49,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 268.0) internal successors, (2144), 8 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:49,085 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 268.0) internal successors, (2144), 8 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:49,085 INFO L175 Difference]: Start difference. First operand has 84 places, 97 transitions, 933 flow. Second operand 7 states and 877 transitions. [2023-08-27 10:07:49,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 167 transitions, 1738 flow [2023-08-27 10:07:52,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 167 transitions, 1727 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-27 10:07:52,480 INFO L231 Difference]: Finished difference. Result has 87 places, 66 transitions, 596 flow [2023-08-27 10:07:52,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=831, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=596, PETRI_PLACES=87, PETRI_TRANSITIONS=66} [2023-08-27 10:07:52,481 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 36 predicate places. [2023-08-27 10:07:52,481 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 66 transitions, 596 flow [2023-08-27 10:07:52,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:52,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:52,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:07:52,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 10:07:52,481 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:07:52,482 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:52,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1397813496, now seen corresponding path program 1 times [2023-08-27 10:07:52,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:52,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121338796] [2023-08-27 10:07:52,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:52,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:07:52,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:07:52,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:07:52,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121338796] [2023-08-27 10:07:52,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121338796] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:07:52,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:07:52,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:07:52,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865489880] [2023-08-27 10:07:52,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:07:52,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:07:52,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:07:52,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:07:52,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:07:52,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 268 [2023-08-27 10:07:52,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 66 transitions, 596 flow. Second operand has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:52,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:07:52,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 268 [2023-08-27 10:07:52,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:07:54,840 INFO L124 PetriNetUnfolderBase]: 15793/24217 cut-off events. [2023-08-27 10:07:54,840 INFO L125 PetriNetUnfolderBase]: For 134582/134582 co-relation queries the response was YES. [2023-08-27 10:07:54,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116454 conditions, 24217 events. 15793/24217 cut-off events. For 134582/134582 co-relation queries the response was YES. Maximal size of possible extension queue 1088. Compared 167416 event pairs, 1984 based on Foata normal form. 2/24219 useless extension candidates. Maximal degree in co-relation 116418. Up to 8458 conditions per place. [2023-08-27 10:07:54,937 INFO L140 encePairwiseOnDemand]: 259/268 looper letters, 89 selfloop transitions, 13 changer transitions 89/191 dead transitions. [2023-08-27 10:07:54,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 191 transitions, 2049 flow [2023-08-27 10:07:54,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:07:54,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:07:54,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 741 transitions. [2023-08-27 10:07:54,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4608208955223881 [2023-08-27 10:07:54,939 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 741 transitions. [2023-08-27 10:07:54,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 741 transitions. [2023-08-27 10:07:54,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:07:54,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 741 transitions. [2023-08-27 10:07:54,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.5) internal successors, (741), 6 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:54,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 268.0) internal successors, (1876), 7 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:54,942 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 268.0) internal successors, (1876), 7 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:54,942 INFO L175 Difference]: Start difference. First operand has 87 places, 66 transitions, 596 flow. Second operand 6 states and 741 transitions. [2023-08-27 10:07:54,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 191 transitions, 2049 flow [2023-08-27 10:07:56,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 191 transitions, 1769 flow, removed 40 selfloop flow, removed 10 redundant places. [2023-08-27 10:07:56,843 INFO L231 Difference]: Finished difference. Result has 81 places, 54 transitions, 420 flow [2023-08-27 10:07:56,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=420, PETRI_PLACES=81, PETRI_TRANSITIONS=54} [2023-08-27 10:07:56,844 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 30 predicate places. [2023-08-27 10:07:56,844 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 54 transitions, 420 flow [2023-08-27 10:07:56,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:56,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:56,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:07:56,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 10:07:56,844 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:07:56,845 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:56,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1977620364, now seen corresponding path program 2 times [2023-08-27 10:07:56,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:56,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967668544] [2023-08-27 10:07:56,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:56,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:07:57,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:07:57,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:07:57,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967668544] [2023-08-27 10:07:57,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967668544] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:07:57,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:07:57,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 10:07:57,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600511768] [2023-08-27 10:07:57,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:07:57,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 10:07:57,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:07:57,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 10:07:57,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-27 10:07:57,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 268 [2023-08-27 10:07:57,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 54 transitions, 420 flow. Second operand has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:57,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:07:57,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 268 [2023-08-27 10:07:57,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:07:58,013 INFO L124 PetriNetUnfolderBase]: 3397/5876 cut-off events. [2023-08-27 10:07:58,013 INFO L125 PetriNetUnfolderBase]: For 18361/18612 co-relation queries the response was YES. [2023-08-27 10:07:58,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24064 conditions, 5876 events. 3397/5876 cut-off events. For 18361/18612 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 40131 event pairs, 617 based on Foata normal form. 82/5874 useless extension candidates. Maximal degree in co-relation 24033. Up to 2151 conditions per place. [2023-08-27 10:07:58,038 INFO L140 encePairwiseOnDemand]: 260/268 looper letters, 89 selfloop transitions, 7 changer transitions 47/154 dead transitions. [2023-08-27 10:07:58,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 154 transitions, 1411 flow [2023-08-27 10:07:58,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:07:58,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:07:58,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 854 transitions. [2023-08-27 10:07:58,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4552238805970149 [2023-08-27 10:07:58,040 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 854 transitions. [2023-08-27 10:07:58,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 854 transitions. [2023-08-27 10:07:58,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:07:58,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 854 transitions. [2023-08-27 10:07:58,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:58,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 268.0) internal successors, (2144), 8 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:58,043 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 268.0) internal successors, (2144), 8 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:58,044 INFO L175 Difference]: Start difference. First operand has 81 places, 54 transitions, 420 flow. Second operand 7 states and 854 transitions. [2023-08-27 10:07:58,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 154 transitions, 1411 flow [2023-08-27 10:07:58,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 154 transitions, 980 flow, removed 42 selfloop flow, removed 18 redundant places. [2023-08-27 10:07:58,199 INFO L231 Difference]: Finished difference. Result has 71 places, 57 transitions, 336 flow [2023-08-27 10:07:58,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=336, PETRI_PLACES=71, PETRI_TRANSITIONS=57} [2023-08-27 10:07:58,199 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 20 predicate places. [2023-08-27 10:07:58,199 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 57 transitions, 336 flow [2023-08-27 10:07:58,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:07:58,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:58,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:07:58,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 10:07:58,200 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:07:58,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:58,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1067053154, now seen corresponding path program 3 times [2023-08-27 10:07:58,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:58,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879782019] [2023-08-27 10:07:58,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:58,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:07:58,232 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 10:07:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:07:58,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 10:07:58,289 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 10:07:58,289 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (22 of 23 remaining) [2023-08-27 10:07:58,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (21 of 23 remaining) [2023-08-27 10:07:58,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2023-08-27 10:07:58,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2023-08-27 10:07:58,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2023-08-27 10:07:58,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2023-08-27 10:07:58,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2023-08-27 10:07:58,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 23 remaining) [2023-08-27 10:07:58,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2023-08-27 10:07:58,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2023-08-27 10:07:58,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2023-08-27 10:07:58,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2023-08-27 10:07:58,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2023-08-27 10:07:58,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2023-08-27 10:07:58,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (8 of 23 remaining) [2023-08-27 10:07:58,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2023-08-27 10:07:58,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 23 remaining) [2023-08-27 10:07:58,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2023-08-27 10:07:58,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2023-08-27 10:07:58,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2023-08-27 10:07:58,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 23 remaining) [2023-08-27 10:07:58,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2023-08-27 10:07:58,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2023-08-27 10:07:58,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-27 10:07:58,293 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:07:58,296 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 10:07:58,296 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 10:07:58,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 10:07:58 BasicIcfg [2023-08-27 10:07:58,367 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 10:07:58,367 INFO L158 Benchmark]: Toolchain (without parser) took 42841.81ms. Allocated memory was 323.0MB in the beginning and 5.8GB in the end (delta: 5.4GB). Free memory was 298.2MB in the beginning and 3.0GB in the end (delta: -2.7GB). Peak memory consumption was 2.8GB. Max. memory is 16.0GB. [2023-08-27 10:07:58,367 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 323.0MB. Free memory is still 299.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 10:07:58,368 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.66ms. Allocated memory is still 323.0MB. Free memory was 297.7MB in the beginning and 273.7MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 10:07:58,368 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.07ms. Allocated memory is still 323.0MB. Free memory was 273.7MB in the beginning and 271.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-27 10:07:58,368 INFO L158 Benchmark]: Boogie Preprocessor took 21.53ms. Allocated memory is still 323.0MB. Free memory was 271.0MB in the beginning and 268.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:07:58,368 INFO L158 Benchmark]: RCFGBuilder took 529.02ms. Allocated memory is still 323.0MB. Free memory was 268.9MB in the beginning and 275.7MB in the end (delta: -6.8MB). Peak memory consumption was 23.2MB. Max. memory is 16.0GB. [2023-08-27 10:07:58,368 INFO L158 Benchmark]: TraceAbstraction took 41850.34ms. Allocated memory was 323.0MB in the beginning and 5.8GB in the end (delta: 5.4GB). Free memory was 275.7MB in the beginning and 3.0GB in the end (delta: -2.7GB). Peak memory consumption was 2.7GB. Max. memory is 16.0GB. [2023-08-27 10:07:58,369 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.11ms. Allocated memory is still 323.0MB. Free memory is still 299.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 403.66ms. Allocated memory is still 323.0MB. Free memory was 297.7MB in the beginning and 273.7MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 32.07ms. Allocated memory is still 323.0MB. Free memory was 273.7MB in the beginning and 271.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 21.53ms. Allocated memory is still 323.0MB. Free memory was 271.0MB in the beginning and 268.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 529.02ms. Allocated memory is still 323.0MB. Free memory was 268.9MB in the beginning and 275.7MB in the end (delta: -6.8MB). Peak memory consumption was 23.2MB. Max. memory is 16.0GB. * TraceAbstraction took 41850.34ms. Allocated memory was 323.0MB in the beginning and 5.8GB in the end (delta: 5.4GB). Free memory was 275.7MB in the beginning and 3.0GB in the end (delta: -2.7GB). Peak memory consumption was 2.7GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 151 PlacesBefore, 51 PlacesAfterwards, 141 TransitionsBefore, 39 TransitionsAfterwards, 4666 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 17 ConcurrentYvCompositions, 2 ChoiceCompositions, 123 TotalNumberOfCompositions, 17674 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6452, independent: 6073, independent conditional: 0, independent unconditional: 6073, dependent: 379, dependent conditional: 0, dependent unconditional: 379, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2607, independent: 2532, independent conditional: 0, independent unconditional: 2532, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6452, independent: 3541, independent conditional: 0, independent unconditional: 3541, dependent: 304, dependent conditional: 0, dependent unconditional: 304, unknown: 2607, unknown conditional: 0, unknown unconditional: 2607] , Statistics on independence cache: Total cache size (in pairs): 261, Positive cache size: 234, Positive conditional cache size: 0, Positive unconditional cache size: 234, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, 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_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t969; [L872] FCALL, FORK 0 pthread_create(&t969, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t969, ((void *)0), P0, ((void *)0))=-3, t969={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t970; [L874] FCALL, FORK 0 pthread_create(&t970, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t970, ((void *)0), P1, ((void *)0))=-2, t969={5:0}, t970={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t971; [L876] FCALL, FORK 0 pthread_create(&t971, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t971, ((void *)0), P2, ((void *)0))=-1, t969={5:0}, t970={6:0}, t971={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t972; [L878] FCALL, FORK 0 pthread_create(&t972, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t972, ((void *)0), P3, ((void *)0))=0, t969={5:0}, t970={6:0}, t971={7:0}, t972={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L824] 4 z = 1 [L827] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L777] EXPR 1 __unbuffered_cnt + 1 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L797] EXPR 2 __unbuffered_cnt + 1 [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L817] EXPR 3 __unbuffered_cnt + 1 [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L856] EXPR 4 __unbuffered_cnt + 1 [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t969={5:0}, t970={6:0}, t971={7:0}, t972={3:0}, weak$$choice2=0, x=2, y=1, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t969={5:0}, t970={6:0}, t971={7:0}, t972={3:0}, weak$$choice2=0, x=2, y=1, z=1] [L891] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix037_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 777]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 777]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 797]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 797]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 817]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 817]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 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: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 190 locations, 23 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 41.7s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 35.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 883 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 883 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1953 IncrementalHoareTripleChecker+Invalid, 2063 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 35 mSDtfsCounter, 1953 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=933occurred in iteration=13, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 292 NumberOfCodeBlocks, 292 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 248 ConstructedInterpolants, 0 QuantifiedInterpolants, 2004 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-27 10:07:58,383 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...