/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/mix026_power.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 10:04:45,873 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 10:04:45,931 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-27 10:04:45,935 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 10:04:45,935 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 10:04:45,961 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 10:04:45,961 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 10:04:45,961 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 10:04:45,962 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 10:04:45,962 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 10:04:45,962 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 10:04:45,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 10:04:45,963 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 10:04:45,963 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 10:04:45,963 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 10:04:45,964 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 10:04:45,964 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 10:04:45,964 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 10:04:45,964 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 10:04:45,964 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 10:04:45,965 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 10:04:45,968 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 10:04:45,969 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 10:04:45,969 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 10:04:45,969 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 10:04:45,969 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 10:04:45,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 10:04:45,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:04:45,970 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 10:04:45,970 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 10:04:45,970 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 10:04:45,970 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 10:04:45,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 10:04:45,971 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 10:04:45,971 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 10:04:45,971 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 10:04:46,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 10:04:46,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 10:04:46,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 10:04:46,234 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 10:04:46,236 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 10:04:46,236 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix026_power.opt_tso.opt.i [2023-08-27 10:04:47,188 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 10:04:47,355 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 10:04:47,355 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026_power.opt_tso.opt.i [2023-08-27 10:04:47,364 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b5c63527/8d244897076b44d79735619a4ba7e505/FLAG8fb4b6e46 [2023-08-27 10:04:47,374 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b5c63527/8d244897076b44d79735619a4ba7e505 [2023-08-27 10:04:47,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 10:04:47,377 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 10:04:47,377 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 10:04:47,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 10:04:47,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 10:04:47,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:04:47" (1/1) ... [2023-08-27 10:04:47,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48155e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:04:47, skipping insertion in model container [2023-08-27 10:04:47,380 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:04:47" (1/1) ... [2023-08-27 10:04:47,408 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 10:04:47,693 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:04:47,703 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 10:04:47,725 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 10:04:47,726 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 10:04:47,746 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:04:47,776 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:04:47,777 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:04:47,781 INFO L206 MainTranslator]: Completed translation [2023-08-27 10:04:47,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:04:47 WrapperNode [2023-08-27 10:04:47,782 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 10:04:47,782 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 10:04:47,783 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 10:04:47,783 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 10:04:47,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:04:47" (1/1) ... [2023-08-27 10:04:47,802 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:04:47" (1/1) ... [2023-08-27 10:04:47,825 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 153 [2023-08-27 10:04:47,825 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 10:04:47,826 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 10:04:47,826 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 10:04:47,826 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 10:04:47,831 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:04:47" (1/1) ... [2023-08-27 10:04:47,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:04:47" (1/1) ... [2023-08-27 10:04:47,833 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:04:47" (1/1) ... [2023-08-27 10:04:47,834 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:04:47" (1/1) ... [2023-08-27 10:04:47,839 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:04:47" (1/1) ... [2023-08-27 10:04:47,840 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:04:47" (1/1) ... [2023-08-27 10:04:47,841 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:04:47" (1/1) ... [2023-08-27 10:04:47,842 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:04:47" (1/1) ... [2023-08-27 10:04:47,852 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 10:04:47,853 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 10:04:47,853 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 10:04:47,853 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 10:04:47,853 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:04:47" (1/1) ... [2023-08-27 10:04:47,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:04:47,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 10:04:47,874 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-27 10:04:47,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-27 10:04:47,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 10:04:47,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 10:04:47,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 10:04:47,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 10:04:47,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 10:04:47,900 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 10:04:47,900 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 10:04:47,900 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 10:04:47,900 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 10:04:47,901 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 10:04:47,901 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 10:04:47,901 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-27 10:04:47,901 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-27 10:04:47,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 10:04:47,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 10:04:47,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 10:04:47,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 10:04:47,902 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 10:04:48,000 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 10:04:48,001 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 10:04:48,271 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 10:04:48,365 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 10:04:48,365 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 10:04:48,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:04:48 BoogieIcfgContainer [2023-08-27 10:04:48,367 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 10:04:48,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 10:04:48,369 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 10:04:48,371 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 10:04:48,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 10:04:47" (1/3) ... [2023-08-27 10:04:48,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@669c4553 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:04:48, skipping insertion in model container [2023-08-27 10:04:48,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:04:47" (2/3) ... [2023-08-27 10:04:48,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@669c4553 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:04:48, skipping insertion in model container [2023-08-27 10:04:48,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:04:48" (3/3) ... [2023-08-27 10:04:48,374 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026_power.opt_tso.opt.i [2023-08-27 10:04:48,385 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 10:04:48,385 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-27 10:04:48,385 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 10:04:48,434 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 10:04:48,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 142 transitions, 304 flow [2023-08-27 10:04:48,524 INFO L124 PetriNetUnfolderBase]: 3/138 cut-off events. [2023-08-27 10:04:48,524 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:04:48,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 3/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2023-08-27 10:04:48,528 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 142 transitions, 304 flow [2023-08-27 10:04:48,531 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 138 transitions, 288 flow [2023-08-27 10:04:48,533 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 10:04:48,538 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 138 transitions, 288 flow [2023-08-27 10:04:48,540 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 138 transitions, 288 flow [2023-08-27 10:04:48,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 138 transitions, 288 flow [2023-08-27 10:04:48,586 INFO L124 PetriNetUnfolderBase]: 3/138 cut-off events. [2023-08-27 10:04:48,586 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:04:48,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 3/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2023-08-27 10:04:48,589 INFO L119 LiptonReduction]: Number of co-enabled transitions 4356 [2023-08-27 10:04:52,204 INFO L134 LiptonReduction]: Checked pairs total: 16194 [2023-08-27 10:04:52,204 INFO L136 LiptonReduction]: Total number of compositions: 111 [2023-08-27 10:04:52,213 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 10:04:52,217 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;@6e39e305, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 10:04:52,217 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-27 10:04:52,219 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 10:04:52,219 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-27 10:04:52,219 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:04:52,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:04:52,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 10:04:52,220 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:04:52,223 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:04:52,223 INFO L85 PathProgramCache]: Analyzing trace with hash 586257556, now seen corresponding path program 1 times [2023-08-27 10:04:52,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:04:52,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332002198] [2023-08-27 10:04:52,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:04:52,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:04:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:04:52,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:04:52,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:04:52,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332002198] [2023-08-27 10:04:52,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332002198] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:04:52,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:04:52,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:04:52,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621371002] [2023-08-27 10:04:52,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:04:52,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:04:52,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:04:52,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:04:52,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:04:52,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 253 [2023-08-27 10:04:52,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:04:52,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:04:52,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 253 [2023-08-27 10:04:52,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:04:53,926 INFO L124 PetriNetUnfolderBase]: 14843/20483 cut-off events. [2023-08-27 10:04:53,926 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2023-08-27 10:04:53,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41219 conditions, 20483 events. 14843/20483 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 893. Compared 118238 event pairs, 4163 based on Foata normal form. 0/13765 useless extension candidates. Maximal degree in co-relation 41207. Up to 17783 conditions per place. [2023-08-27 10:04:54,035 INFO L140 encePairwiseOnDemand]: 239/253 looper letters, 53 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2023-08-27 10:04:54,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 62 transitions, 261 flow [2023-08-27 10:04:54,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:04:54,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:04:54,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2023-08-27 10:04:54,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5362318840579711 [2023-08-27 10:04:54,048 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 407 transitions. [2023-08-27 10:04:54,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 407 transitions. [2023-08-27 10:04:54,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:04:54,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 407 transitions. [2023-08-27 10:04:54,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:04:54,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:04:54,121 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:04:54,122 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 3 states and 407 transitions. [2023-08-27 10:04:54,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 62 transitions, 261 flow [2023-08-27 10:04:54,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 62 transitions, 254 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 10:04:54,129 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 131 flow [2023-08-27 10:04:54,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=131, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-08-27 10:04:54,132 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2023-08-27 10:04:54,132 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 131 flow [2023-08-27 10:04:54,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:04:54,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:04:54,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 10:04:54,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 10:04:54,133 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:04:54,139 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:04:54,140 INFO L85 PathProgramCache]: Analyzing trace with hash 586321374, now seen corresponding path program 1 times [2023-08-27 10:04:54,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:04:54,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200581266] [2023-08-27 10:04:54,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:04:54,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:04:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:04:54,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:04:54,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:04:54,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200581266] [2023-08-27 10:04:54,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200581266] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:04:54,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:04:54,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:04:54,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821059513] [2023-08-27 10:04:54,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:04:54,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:04:54,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:04:54,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:04:54,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:04:54,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 253 [2023-08-27 10:04:54,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 131 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:04:54,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:04:54,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 253 [2023-08-27 10:04:54,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:04:55,440 INFO L124 PetriNetUnfolderBase]: 10024/15048 cut-off events. [2023-08-27 10:04:55,440 INFO L125 PetriNetUnfolderBase]: For 1392/1702 co-relation queries the response was YES. [2023-08-27 10:04:55,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35779 conditions, 15048 events. 10024/15048 cut-off events. For 1392/1702 co-relation queries the response was YES. Maximal size of possible extension queue 759. Compared 101686 event pairs, 2440 based on Foata normal form. 0/11805 useless extension candidates. Maximal degree in co-relation 35768. Up to 10887 conditions per place. [2023-08-27 10:04:55,503 INFO L140 encePairwiseOnDemand]: 250/253 looper letters, 55 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-08-27 10:04:55,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 65 transitions, 316 flow [2023-08-27 10:04:55,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:04:55,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:04:55,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions. [2023-08-27 10:04:55,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5335968379446641 [2023-08-27 10:04:55,504 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 405 transitions. [2023-08-27 10:04:55,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 405 transitions. [2023-08-27 10:04:55,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:04:55,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 405 transitions. [2023-08-27 10:04:55,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:04:55,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:04:55,507 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:04:55,507 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 131 flow. Second operand 3 states and 405 transitions. [2023-08-27 10:04:55,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 65 transitions, 316 flow [2023-08-27 10:04:55,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 308 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:04:55,509 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 128 flow [2023-08-27 10:04:55,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2023-08-27 10:04:55,510 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2023-08-27 10:04:55,510 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 128 flow [2023-08-27 10:04:55,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:04:55,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:04:55,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:04:55,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 10:04:55,511 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:04:55,511 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:04:55,511 INFO L85 PathProgramCache]: Analyzing trace with hash -474674059, now seen corresponding path program 1 times [2023-08-27 10:04:55,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:04:55,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832670774] [2023-08-27 10:04:55,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:04:55,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:04:55,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:04:55,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:04:55,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:04:55,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832670774] [2023-08-27 10:04:55,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832670774] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:04:55,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:04:55,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:04:55,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781831441] [2023-08-27 10:04:55,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:04:55,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:04:55,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:04:55,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:04:55,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:04:55,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 253 [2023-08-27 10:04:55,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:04:55,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:04:55,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 253 [2023-08-27 10:04:55,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:04:56,235 INFO L124 PetriNetUnfolderBase]: 7787/10777 cut-off events. [2023-08-27 10:04:56,235 INFO L125 PetriNetUnfolderBase]: For 1241/1241 co-relation queries the response was YES. [2023-08-27 10:04:56,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26045 conditions, 10777 events. 7787/10777 cut-off events. For 1241/1241 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 58225 event pairs, 2050 based on Foata normal form. 0/8677 useless extension candidates. Maximal degree in co-relation 26033. Up to 8791 conditions per place. [2023-08-27 10:04:56,281 INFO L140 encePairwiseOnDemand]: 244/253 looper letters, 47 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2023-08-27 10:04:56,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 56 transitions, 262 flow [2023-08-27 10:04:56,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:04:56,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:04:56,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 508 transitions. [2023-08-27 10:04:56,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5019762845849802 [2023-08-27 10:04:56,283 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 508 transitions. [2023-08-27 10:04:56,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 508 transitions. [2023-08-27 10:04:56,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:04:56,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 508 transitions. [2023-08-27 10:04:56,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:04:56,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:04:56,287 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:04:56,287 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 128 flow. Second operand 4 states and 508 transitions. [2023-08-27 10:04:56,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 56 transitions, 262 flow [2023-08-27 10:04:56,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 56 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:04:56,290 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 118 flow [2023-08-27 10:04:56,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2023-08-27 10:04:56,291 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -4 predicate places. [2023-08-27 10:04:56,291 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 118 flow [2023-08-27 10:04:56,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:04:56,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:04:56,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:04:56,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 10:04:56,294 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:04:56,295 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:04:56,295 INFO L85 PathProgramCache]: Analyzing trace with hash -530468478, now seen corresponding path program 1 times [2023-08-27 10:04:56,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:04:56,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697508674] [2023-08-27 10:04:56,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:04:56,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:04:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:04:56,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:04:56,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:04:56,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697508674] [2023-08-27 10:04:56,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697508674] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:04:56,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:04:56,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:04:56,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465831373] [2023-08-27 10:04:56,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:04:56,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:04:56,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:04:56,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:04:56,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:04:56,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 253 [2023-08-27 10:04:56,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:04:56,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:04:56,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 253 [2023-08-27 10:04:56,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:04:56,853 INFO L124 PetriNetUnfolderBase]: 5183/7236 cut-off events. [2023-08-27 10:04:56,853 INFO L125 PetriNetUnfolderBase]: For 2064/2064 co-relation queries the response was YES. [2023-08-27 10:04:56,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17344 conditions, 7236 events. 5183/7236 cut-off events. For 2064/2064 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 37808 event pairs, 1418 based on Foata normal form. 0/6512 useless extension candidates. Maximal degree in co-relation 17332. Up to 2700 conditions per place. [2023-08-27 10:04:56,879 INFO L140 encePairwiseOnDemand]: 244/253 looper letters, 64 selfloop transitions, 9 changer transitions 0/77 dead transitions. [2023-08-27 10:04:56,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 77 transitions, 362 flow [2023-08-27 10:04:56,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:04:56,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:04:56,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 529 transitions. [2023-08-27 10:04:56,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2023-08-27 10:04:56,880 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 529 transitions. [2023-08-27 10:04:56,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 529 transitions. [2023-08-27 10:04:56,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:04:56,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 529 transitions. [2023-08-27 10:04:56,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:04:56,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:04:56,883 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:04:56,883 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 118 flow. Second operand 4 states and 529 transitions. [2023-08-27 10:04:56,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 77 transitions, 362 flow [2023-08-27 10:04:56,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 77 transitions, 356 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:04:56,886 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 170 flow [2023-08-27 10:04:56,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2023-08-27 10:04:56,887 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2023-08-27 10:04:56,887 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 170 flow [2023-08-27 10:04:56,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:04:56,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:04:56,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:04:56,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 10:04:56,887 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:04:56,887 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:04:56,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1716255226, now seen corresponding path program 1 times [2023-08-27 10:04:56,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:04:56,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514524791] [2023-08-27 10:04:56,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:04:56,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:04:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:04:57,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:04:57,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:04:57,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514524791] [2023-08-27 10:04:57,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514524791] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:04:57,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:04:57,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:04:57,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147353129] [2023-08-27 10:04:57,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:04:57,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:04:57,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:04:57,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:04:57,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:04:57,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 253 [2023-08-27 10:04:57,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:04:57,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:04:57,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 253 [2023-08-27 10:04:57,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:04:59,049 INFO L124 PetriNetUnfolderBase]: 23837/32598 cut-off events. [2023-08-27 10:04:59,050 INFO L125 PetriNetUnfolderBase]: For 23869/23869 co-relation queries the response was YES. [2023-08-27 10:04:59,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87669 conditions, 32598 events. 23837/32598 cut-off events. For 23869/23869 co-relation queries the response was YES. Maximal size of possible extension queue 1016. Compared 181001 event pairs, 6549 based on Foata normal form. 0/30572 useless extension candidates. Maximal degree in co-relation 87656. Up to 16933 conditions per place. [2023-08-27 10:04:59,192 INFO L140 encePairwiseOnDemand]: 244/253 looper letters, 124 selfloop transitions, 14 changer transitions 0/138 dead transitions. [2023-08-27 10:04:59,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 138 transitions, 874 flow [2023-08-27 10:04:59,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:04:59,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:04:59,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 638 transitions. [2023-08-27 10:04:59,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5043478260869565 [2023-08-27 10:04:59,198 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 638 transitions. [2023-08-27 10:04:59,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 638 transitions. [2023-08-27 10:04:59,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:04:59,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 638 transitions. [2023-08-27 10:04:59,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:04:59,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:04:59,204 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:04:59,204 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 170 flow. Second operand 5 states and 638 transitions. [2023-08-27 10:04:59,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 138 transitions, 874 flow [2023-08-27 10:04:59,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 138 transitions, 808 flow, removed 16 selfloop flow, removed 2 redundant places. [2023-08-27 10:04:59,225 INFO L231 Difference]: Finished difference. Result has 55 places, 54 transitions, 264 flow [2023-08-27 10:04:59,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=264, PETRI_PLACES=55, PETRI_TRANSITIONS=54} [2023-08-27 10:04:59,226 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2023-08-27 10:04:59,227 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 54 transitions, 264 flow [2023-08-27 10:04:59,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:04:59,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:04:59,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:04:59,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 10:04:59,228 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:04:59,228 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:04:59,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1664293365, now seen corresponding path program 1 times [2023-08-27 10:04:59,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:04:59,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398010128] [2023-08-27 10:04:59,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:04:59,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:04:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:04:59,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:04:59,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:04:59,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398010128] [2023-08-27 10:04:59,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398010128] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:04:59,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:04:59,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:04:59,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419664449] [2023-08-27 10:04:59,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:04:59,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:04:59,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:04:59,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:04:59,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:04:59,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 253 [2023-08-27 10:04:59,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 54 transitions, 264 flow. Second operand has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:04:59,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:04:59,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 253 [2023-08-27 10:04:59,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:05:01,686 INFO L124 PetriNetUnfolderBase]: 26419/36356 cut-off events. [2023-08-27 10:05:01,686 INFO L125 PetriNetUnfolderBase]: For 34150/34150 co-relation queries the response was YES. [2023-08-27 10:05:01,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113219 conditions, 36356 events. 26419/36356 cut-off events. For 34150/34150 co-relation queries the response was YES. Maximal size of possible extension queue 1146. Compared 206103 event pairs, 3855 based on Foata normal form. 1038/36198 useless extension candidates. Maximal degree in co-relation 113202. Up to 11363 conditions per place. [2023-08-27 10:05:01,845 INFO L140 encePairwiseOnDemand]: 245/253 looper letters, 167 selfloop transitions, 21 changer transitions 0/188 dead transitions. [2023-08-27 10:05:01,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 188 transitions, 1288 flow [2023-08-27 10:05:01,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:05:01,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:05:01,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 869 transitions. [2023-08-27 10:05:01,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4906832298136646 [2023-08-27 10:05:01,847 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 869 transitions. [2023-08-27 10:05:01,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 869 transitions. [2023-08-27 10:05:01,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:05:01,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 869 transitions. [2023-08-27 10:05:01,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.14285714285714) internal successors, (869), 7 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:01,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 253.0) internal successors, (2024), 8 states have internal predecessors, (2024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:01,851 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 253.0) internal successors, (2024), 8 states have internal predecessors, (2024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:01,851 INFO L175 Difference]: Start difference. First operand has 55 places, 54 transitions, 264 flow. Second operand 7 states and 869 transitions. [2023-08-27 10:05:01,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 188 transitions, 1288 flow [2023-08-27 10:05:01,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 188 transitions, 1288 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 10:05:01,864 INFO L231 Difference]: Finished difference. Result has 67 places, 68 transitions, 456 flow [2023-08-27 10:05:01,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=456, PETRI_PLACES=67, PETRI_TRANSITIONS=68} [2023-08-27 10:05:01,865 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places. [2023-08-27 10:05:01,865 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 456 flow [2023-08-27 10:05:01,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:01,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:05:01,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:05:01,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 10:05:01,865 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:05:01,866 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:05:01,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1755461715, now seen corresponding path program 1 times [2023-08-27 10:05:01,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:05:01,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504396704] [2023-08-27 10:05:01,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:05:01,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:05:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:05:02,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:05:02,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:05:02,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504396704] [2023-08-27 10:05:02,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504396704] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:05:02,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:05:02,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:05:02,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361411219] [2023-08-27 10:05:02,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:05:02,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:05:02,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:05:02,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:05:02,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:05:02,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 253 [2023-08-27 10:05:02,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 68 transitions, 456 flow. Second operand has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:02,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:05:02,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 253 [2023-08-27 10:05:02,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:05:02,848 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([464] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd4~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_105 256) 0)) .cse2)) (.cse4 (and .cse3 .cse5))) (and (= v_~x~0_54 (ite .cse0 v_~x$w_buff0~0_39 (ite .cse1 v_~x$w_buff1~0_38 v_~x~0_55))) (= v_~x$r_buff1_thd4~0_21 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_104 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_25 256) 0)))) 0 v_~x$r_buff1_thd4~0_22)) (= (ite .cse0 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115) (= v_~x$r_buff0_thd4~0_25 (ite .cse4 0 v_~x$r_buff0_thd4~0_26)) (= v_~x$w_buff1_used~0_104 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_105))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_26, ~x~0=v_~x~0_55, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_22, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_25, ~x~0=v_~x~0_54, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_21, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][73], [8#L770true, Black: 189#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 172#(<= ~__unbuffered_cnt~0 1), 83#L845true, Black: 194#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 190#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 192#(and (<= ~__unbuffered_p3_EAX~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 188#(<= ~__unbuffered_p3_EAX~0 0), 186#true, 167#(<= 1 ~__unbuffered_cnt~0), P3Thread1of1ForFork2InUse, 74#P2EXITtrue, P1Thread1of1ForFork3InUse, Black: 177#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork0InUse, 175#true, P0Thread1of1ForFork1InUse, Black: 178#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 103#L795true, 46#L873true, 202#true, Black: 157#(= ~__unbuffered_cnt~0 0)]) [2023-08-27 10:05:02,848 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-27 10:05:02,848 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:05:02,848 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:05:02,848 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:05:03,027 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([464] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd4~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_105 256) 0)) .cse2)) (.cse4 (and .cse3 .cse5))) (and (= v_~x~0_54 (ite .cse0 v_~x$w_buff0~0_39 (ite .cse1 v_~x$w_buff1~0_38 v_~x~0_55))) (= v_~x$r_buff1_thd4~0_21 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_104 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_25 256) 0)))) 0 v_~x$r_buff1_thd4~0_22)) (= (ite .cse0 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115) (= v_~x$r_buff0_thd4~0_25 (ite .cse4 0 v_~x$r_buff0_thd4~0_26)) (= v_~x$w_buff1_used~0_104 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_105))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_26, ~x~0=v_~x~0_55, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_22, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_25, ~x~0=v_~x~0_54, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_21, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][73], [111#P0EXITtrue, Black: 189#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 83#L845true, Black: 194#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 190#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 192#(and (<= ~__unbuffered_p3_EAX~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 188#(<= ~__unbuffered_p3_EAX~0 0), 186#true, 167#(<= 1 ~__unbuffered_cnt~0), Black: 172#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork2InUse, 74#P2EXITtrue, P1Thread1of1ForFork3InUse, Black: 177#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork0InUse, 175#true, P0Thread1of1ForFork1InUse, Black: 178#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 103#L795true, 46#L873true, 202#true, Black: 157#(= ~__unbuffered_cnt~0 0)]) [2023-08-27 10:05:03,028 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-27 10:05:03,028 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:05:03,028 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:05:03,028 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:05:03,029 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([464] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd4~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_105 256) 0)) .cse2)) (.cse4 (and .cse3 .cse5))) (and (= v_~x~0_54 (ite .cse0 v_~x$w_buff0~0_39 (ite .cse1 v_~x$w_buff1~0_38 v_~x~0_55))) (= v_~x$r_buff1_thd4~0_21 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_104 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_25 256) 0)))) 0 v_~x$r_buff1_thd4~0_22)) (= (ite .cse0 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115) (= v_~x$r_buff0_thd4~0_25 (ite .cse4 0 v_~x$r_buff0_thd4~0_26)) (= v_~x$w_buff1_used~0_104 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_105))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_26, ~x~0=v_~x~0_55, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_22, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_25, ~x~0=v_~x~0_54, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_21, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][73], [8#L770true, Black: 189#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 172#(<= ~__unbuffered_cnt~0 1), 37#L880true, 83#L845true, Black: 194#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 190#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 192#(and (<= ~__unbuffered_p3_EAX~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 188#(<= ~__unbuffered_p3_EAX~0 0), 186#true, 167#(<= 1 ~__unbuffered_cnt~0), P3Thread1of1ForFork2InUse, 74#P2EXITtrue, P1Thread1of1ForFork3InUse, Black: 177#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork0InUse, 175#true, P0Thread1of1ForFork1InUse, Black: 178#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 103#L795true, 202#true, Black: 157#(= ~__unbuffered_cnt~0 0)]) [2023-08-27 10:05:03,029 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-27 10:05:03,029 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:05:03,029 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:05:03,029 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:05:03,029 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([501] L880-->L884: Formula: (and (= (mod v_~main$tmp_guard1~0_4 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|) (= v_~main$tmp_guard1~0_4 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_6 0) (= v_~__unbuffered_p0_EAX~0_12 0) (= v_~__unbuffered_p3_EBX~0_4 0) (= 2 v_~__unbuffered_p3_EAX~0_6) (= v_~z~0_10 2))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_6, ~z~0=v_~z~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_6, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_4, ~z~0=v_~z~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][80], [8#L770true, Black: 189#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 172#(<= ~__unbuffered_cnt~0 1), Black: 194#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 190#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 192#(and (<= ~__unbuffered_p3_EAX~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 188#(<= ~__unbuffered_p3_EAX~0 0), 86#L838true, 186#true, 167#(<= 1 ~__unbuffered_cnt~0), P3Thread1of1ForFork2InUse, 74#P2EXITtrue, P1Thread1of1ForFork3InUse, Black: 177#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork0InUse, 28#L884true, 175#true, P0Thread1of1ForFork1InUse, Black: 178#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 103#L795true, 202#true, Black: 157#(= ~__unbuffered_cnt~0 0)]) [2023-08-27 10:05:03,029 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-27 10:05:03,030 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:05:03,030 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:05:03,030 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:05:03,207 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([464] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd4~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_105 256) 0)) .cse2)) (.cse4 (and .cse3 .cse5))) (and (= v_~x~0_54 (ite .cse0 v_~x$w_buff0~0_39 (ite .cse1 v_~x$w_buff1~0_38 v_~x~0_55))) (= v_~x$r_buff1_thd4~0_21 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_104 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_25 256) 0)))) 0 v_~x$r_buff1_thd4~0_22)) (= (ite .cse0 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115) (= v_~x$r_buff0_thd4~0_25 (ite .cse4 0 v_~x$r_buff0_thd4~0_26)) (= v_~x$w_buff1_used~0_104 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_105))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_26, ~x~0=v_~x~0_55, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_22, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_25, ~x~0=v_~x~0_54, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_21, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][73], [111#P0EXITtrue, Black: 189#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 37#L880true, 83#L845true, Black: 194#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 190#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 192#(and (<= ~__unbuffered_p3_EAX~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 188#(<= ~__unbuffered_p3_EAX~0 0), 186#true, 167#(<= 1 ~__unbuffered_cnt~0), Black: 172#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork2InUse, 74#P2EXITtrue, P1Thread1of1ForFork3InUse, Black: 177#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork0InUse, 175#true, P0Thread1of1ForFork1InUse, Black: 178#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 103#L795true, 202#true, Black: 157#(= ~__unbuffered_cnt~0 0)]) [2023-08-27 10:05:03,207 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-27 10:05:03,207 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-27 10:05:03,207 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-27 10:05:03,207 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-27 10:05:03,207 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([501] L880-->L884: Formula: (and (= (mod v_~main$tmp_guard1~0_4 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|) (= v_~main$tmp_guard1~0_4 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_6 0) (= v_~__unbuffered_p0_EAX~0_12 0) (= v_~__unbuffered_p3_EBX~0_4 0) (= 2 v_~__unbuffered_p3_EAX~0_6) (= v_~z~0_10 2))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_6, ~z~0=v_~z~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_6, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_4, ~z~0=v_~z~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][80], [111#P0EXITtrue, Black: 189#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 194#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 190#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 192#(and (<= ~__unbuffered_p3_EAX~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 188#(<= ~__unbuffered_p3_EAX~0 0), 86#L838true, 186#true, 167#(<= 1 ~__unbuffered_cnt~0), Black: 172#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork2InUse, 74#P2EXITtrue, P1Thread1of1ForFork3InUse, Black: 177#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork0InUse, 28#L884true, 175#true, P0Thread1of1ForFork1InUse, Black: 178#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 103#L795true, 202#true, Black: 157#(= ~__unbuffered_cnt~0 0)]) [2023-08-27 10:05:03,208 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-27 10:05:03,208 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-27 10:05:03,208 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-27 10:05:03,208 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-27 10:05:03,668 INFO L124 PetriNetUnfolderBase]: 12829/19416 cut-off events. [2023-08-27 10:05:03,668 INFO L125 PetriNetUnfolderBase]: For 25660/26449 co-relation queries the response was YES. [2023-08-27 10:05:03,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60963 conditions, 19416 events. 12829/19416 cut-off events. For 25660/26449 co-relation queries the response was YES. Maximal size of possible extension queue 901. Compared 129938 event pairs, 3135 based on Foata normal form. 1009/18579 useless extension candidates. Maximal degree in co-relation 60938. Up to 15059 conditions per place. [2023-08-27 10:05:03,796 INFO L140 encePairwiseOnDemand]: 246/253 looper letters, 93 selfloop transitions, 10 changer transitions 0/122 dead transitions. [2023-08-27 10:05:03,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 122 transitions, 906 flow [2023-08-27 10:05:03,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:05:03,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:05:03,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 633 transitions. [2023-08-27 10:05:03,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.500395256916996 [2023-08-27 10:05:03,798 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 633 transitions. [2023-08-27 10:05:03,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 633 transitions. [2023-08-27 10:05:03,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:05:03,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 633 transitions. [2023-08-27 10:05:03,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:03,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:03,801 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:03,801 INFO L175 Difference]: Start difference. First operand has 67 places, 68 transitions, 456 flow. Second operand 5 states and 633 transitions. [2023-08-27 10:05:03,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 122 transitions, 906 flow [2023-08-27 10:05:03,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 122 transitions, 906 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 10:05:03,936 INFO L231 Difference]: Finished difference. Result has 74 places, 71 transitions, 509 flow [2023-08-27 10:05:03,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=509, PETRI_PLACES=74, PETRI_TRANSITIONS=71} [2023-08-27 10:05:03,937 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 23 predicate places. [2023-08-27 10:05:03,937 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 71 transitions, 509 flow [2023-08-27 10:05:03,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:03,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:05:03,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:05:03,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 10:05:03,937 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:05:03,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:05:03,938 INFO L85 PathProgramCache]: Analyzing trace with hash -60631978, now seen corresponding path program 1 times [2023-08-27 10:05:03,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:05:03,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928860319] [2023-08-27 10:05:03,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:05:03,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:05:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:05:03,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:05:03,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:05:03,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928860319] [2023-08-27 10:05:03,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928860319] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:05:03,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:05:03,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:05:03,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931130484] [2023-08-27 10:05:03,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:05:03,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:05:03,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:05:03,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:05:03,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:05:03,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 253 [2023-08-27 10:05:03,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 71 transitions, 509 flow. Second operand has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:03,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:05:03,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 253 [2023-08-27 10:05:03,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:05:04,765 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([464] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd4~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_105 256) 0)) .cse2)) (.cse4 (and .cse3 .cse5))) (and (= v_~x~0_54 (ite .cse0 v_~x$w_buff0~0_39 (ite .cse1 v_~x$w_buff1~0_38 v_~x~0_55))) (= v_~x$r_buff1_thd4~0_21 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_104 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_25 256) 0)))) 0 v_~x$r_buff1_thd4~0_22)) (= (ite .cse0 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115) (= v_~x$r_buff0_thd4~0_25 (ite .cse4 0 v_~x$r_buff0_thd4~0_26)) (= v_~x$w_buff1_used~0_104 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_105))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_26, ~x~0=v_~x~0_55, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_22, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_25, ~x~0=v_~x~0_54, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_21, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][61], [Black: 189#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 194#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 190#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 192#(and (<= ~__unbuffered_p3_EAX~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 188#(<= ~__unbuffered_p3_EAX~0 0), 186#true, 167#(<= 1 ~__unbuffered_cnt~0), Black: 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 207#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 46#L873true, 103#L795true, 202#true, Black: 157#(= ~__unbuffered_cnt~0 0), 8#L770true, 172#(<= ~__unbuffered_cnt~0 1), 83#L845true, 215#(<= ~__unbuffered_cnt~0 1), 74#P2EXITtrue, Black: 177#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 175#true, Black: 178#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))]) [2023-08-27 10:05:04,765 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-27 10:05:04,765 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:05:04,766 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:05:04,766 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:05:04,905 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([464] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd4~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_105 256) 0)) .cse2)) (.cse4 (and .cse3 .cse5))) (and (= v_~x~0_54 (ite .cse0 v_~x$w_buff0~0_39 (ite .cse1 v_~x$w_buff1~0_38 v_~x~0_55))) (= v_~x$r_buff1_thd4~0_21 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_104 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_25 256) 0)))) 0 v_~x$r_buff1_thd4~0_22)) (= (ite .cse0 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115) (= v_~x$r_buff0_thd4~0_25 (ite .cse4 0 v_~x$r_buff0_thd4~0_26)) (= v_~x$w_buff1_used~0_104 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_105))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_26, ~x~0=v_~x~0_55, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_22, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_25, ~x~0=v_~x~0_54, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_21, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][84], [111#P0EXITtrue, Black: 189#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 194#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 190#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 192#(and (<= ~__unbuffered_p3_EAX~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 188#(<= ~__unbuffered_p3_EAX~0 0), 186#true, 167#(<= 1 ~__unbuffered_cnt~0), Black: 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 207#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 46#L873true, 103#L795true, 202#true, Black: 157#(= ~__unbuffered_cnt~0 0), 83#L845true, Black: 172#(<= ~__unbuffered_cnt~0 1), 74#P2EXITtrue, Black: 177#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 175#true, Black: 178#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 216#(<= ~__unbuffered_cnt~0 2)]) [2023-08-27 10:05:04,906 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-27 10:05:04,906 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:05:04,906 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:05:04,906 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:05:04,907 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([464] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd4~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_105 256) 0)) .cse2)) (.cse4 (and .cse3 .cse5))) (and (= v_~x~0_54 (ite .cse0 v_~x$w_buff0~0_39 (ite .cse1 v_~x$w_buff1~0_38 v_~x~0_55))) (= v_~x$r_buff1_thd4~0_21 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_104 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_25 256) 0)))) 0 v_~x$r_buff1_thd4~0_22)) (= (ite .cse0 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115) (= v_~x$r_buff0_thd4~0_25 (ite .cse4 0 v_~x$r_buff0_thd4~0_26)) (= v_~x$w_buff1_used~0_104 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_105))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_26, ~x~0=v_~x~0_55, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_22, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_25, ~x~0=v_~x~0_54, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_21, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][61], [Black: 189#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 194#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 190#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 192#(and (<= ~__unbuffered_p3_EAX~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 188#(<= ~__unbuffered_p3_EAX~0 0), 186#true, 167#(<= 1 ~__unbuffered_cnt~0), Black: 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 207#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 103#L795true, 202#true, Black: 157#(= ~__unbuffered_cnt~0 0), 8#L770true, 83#L845true, 172#(<= ~__unbuffered_cnt~0 1), 37#L880true, 215#(<= ~__unbuffered_cnt~0 1), 74#P2EXITtrue, Black: 177#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 175#true, Black: 178#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))]) [2023-08-27 10:05:04,907 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-27 10:05:04,907 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:05:04,907 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:05:04,907 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:05:04,907 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([501] L880-->L884: Formula: (and (= (mod v_~main$tmp_guard1~0_4 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|) (= v_~main$tmp_guard1~0_4 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_6 0) (= v_~__unbuffered_p0_EAX~0_12 0) (= v_~__unbuffered_p3_EBX~0_4 0) (= 2 v_~__unbuffered_p3_EAX~0_6) (= v_~z~0_10 2))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_6, ~z~0=v_~z~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_6, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_4, ~z~0=v_~z~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][69], [Black: 189#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 194#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 190#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 192#(and (<= ~__unbuffered_p3_EAX~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 188#(<= ~__unbuffered_p3_EAX~0 0), 86#L838true, 186#true, 167#(<= 1 ~__unbuffered_cnt~0), Black: 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 207#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 103#L795true, 202#true, Black: 157#(= ~__unbuffered_cnt~0 0), 8#L770true, 172#(<= ~__unbuffered_cnt~0 1), 215#(<= ~__unbuffered_cnt~0 1), 74#P2EXITtrue, Black: 177#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 28#L884true, 175#true, Black: 178#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))]) [2023-08-27 10:05:04,907 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-27 10:05:04,907 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:05:04,907 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:05:04,907 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:05:05,044 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([464] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd4~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_105 256) 0)) .cse2)) (.cse4 (and .cse3 .cse5))) (and (= v_~x~0_54 (ite .cse0 v_~x$w_buff0~0_39 (ite .cse1 v_~x$w_buff1~0_38 v_~x~0_55))) (= v_~x$r_buff1_thd4~0_21 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_104 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_25 256) 0)))) 0 v_~x$r_buff1_thd4~0_22)) (= (ite .cse0 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115) (= v_~x$r_buff0_thd4~0_25 (ite .cse4 0 v_~x$r_buff0_thd4~0_26)) (= v_~x$w_buff1_used~0_104 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_105))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_26, ~x~0=v_~x~0_55, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_22, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_25, ~x~0=v_~x~0_54, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_21, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][84], [111#P0EXITtrue, Black: 189#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 194#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 190#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 192#(and (<= ~__unbuffered_p3_EAX~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 188#(<= ~__unbuffered_p3_EAX~0 0), 186#true, 167#(<= 1 ~__unbuffered_cnt~0), Black: 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 207#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 103#L795true, 202#true, Black: 157#(= ~__unbuffered_cnt~0 0), 37#L880true, 83#L845true, Black: 172#(<= ~__unbuffered_cnt~0 1), 74#P2EXITtrue, Black: 177#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 175#true, Black: 178#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 216#(<= ~__unbuffered_cnt~0 2)]) [2023-08-27 10:05:05,044 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-27 10:05:05,044 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-27 10:05:05,044 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-27 10:05:05,044 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-27 10:05:05,084 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([501] L880-->L884: Formula: (and (= (mod v_~main$tmp_guard1~0_4 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|) (= v_~main$tmp_guard1~0_4 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_6 0) (= v_~__unbuffered_p0_EAX~0_12 0) (= v_~__unbuffered_p3_EBX~0_4 0) (= 2 v_~__unbuffered_p3_EAX~0_6) (= v_~z~0_10 2))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_6, ~z~0=v_~z~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_6, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_4, ~z~0=v_~z~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][98], [111#P0EXITtrue, Black: 189#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 194#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 190#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 192#(and (<= ~__unbuffered_p3_EAX~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 188#(<= ~__unbuffered_p3_EAX~0 0), 86#L838true, 186#true, 167#(<= 1 ~__unbuffered_cnt~0), Black: 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 207#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 103#L795true, 202#true, Black: 157#(= ~__unbuffered_cnt~0 0), Black: 172#(<= ~__unbuffered_cnt~0 1), 74#P2EXITtrue, Black: 177#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 28#L884true, 175#true, Black: 178#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 216#(<= ~__unbuffered_cnt~0 2)]) [2023-08-27 10:05:05,084 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is not cut-off event [2023-08-27 10:05:05,084 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-08-27 10:05:05,084 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-08-27 10:05:05,084 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-08-27 10:05:05,326 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([464] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd4~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_105 256) 0)) .cse2)) (.cse4 (and .cse3 .cse5))) (and (= v_~x~0_54 (ite .cse0 v_~x$w_buff0~0_39 (ite .cse1 v_~x$w_buff1~0_38 v_~x~0_55))) (= v_~x$r_buff1_thd4~0_21 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_104 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_25 256) 0)))) 0 v_~x$r_buff1_thd4~0_22)) (= (ite .cse0 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115) (= v_~x$r_buff0_thd4~0_25 (ite .cse4 0 v_~x$r_buff0_thd4~0_26)) (= v_~x$w_buff1_used~0_104 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_105))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_26, ~x~0=v_~x~0_55, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_22, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_25, ~x~0=v_~x~0_54, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_21, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][112], [111#P0EXITtrue, Black: 189#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 194#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 192#(and (<= ~__unbuffered_p3_EAX~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 186#true, 190#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 188#(<= ~__unbuffered_p3_EAX~0 0), 118#P1EXITtrue, 167#(<= 1 ~__unbuffered_cnt~0), Black: 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 207#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P3Thread1of1ForFork2InUse, Black: 204#(= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 202#true, Black: 157#(= ~__unbuffered_cnt~0 0), 83#L845true, Black: 172#(<= ~__unbuffered_cnt~0 1), 4#ULTIMATE.startEXITtrue, 74#P2EXITtrue, Black: 177#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 175#true, 212#true, 178#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))]) [2023-08-27 10:05:05,326 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-27 10:05:05,326 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-27 10:05:05,326 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-27 10:05:05,326 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-27 10:05:05,337 INFO L124 PetriNetUnfolderBase]: 11215/16810 cut-off events. [2023-08-27 10:05:05,338 INFO L125 PetriNetUnfolderBase]: For 26926/27656 co-relation queries the response was YES. [2023-08-27 10:05:05,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55098 conditions, 16810 events. 11215/16810 cut-off events. For 26926/27656 co-relation queries the response was YES. Maximal size of possible extension queue 857. Compared 110905 event pairs, 1273 based on Foata normal form. 149/16309 useless extension candidates. Maximal degree in co-relation 55068. Up to 7271 conditions per place. [2023-08-27 10:05:05,445 INFO L140 encePairwiseOnDemand]: 244/253 looper letters, 106 selfloop transitions, 17 changer transitions 0/142 dead transitions. [2023-08-27 10:05:05,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 142 transitions, 1131 flow [2023-08-27 10:05:05,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:05:05,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:05:05,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 657 transitions. [2023-08-27 10:05:05,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5193675889328063 [2023-08-27 10:05:05,447 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 657 transitions. [2023-08-27 10:05:05,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 657 transitions. [2023-08-27 10:05:05,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:05:05,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 657 transitions. [2023-08-27 10:05:05,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:05,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:05,451 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:05,451 INFO L175 Difference]: Start difference. First operand has 74 places, 71 transitions, 509 flow. Second operand 5 states and 657 transitions. [2023-08-27 10:05:05,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 142 transitions, 1131 flow [2023-08-27 10:05:05,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 142 transitions, 1117 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:05:05,577 INFO L231 Difference]: Finished difference. Result has 77 places, 75 transitions, 577 flow [2023-08-27 10:05:05,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=577, PETRI_PLACES=77, PETRI_TRANSITIONS=75} [2023-08-27 10:05:05,578 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 26 predicate places. [2023-08-27 10:05:05,578 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 75 transitions, 577 flow [2023-08-27 10:05:05,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:05,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:05:05,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:05:05,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 10:05:05,578 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:05:05,579 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:05:05,579 INFO L85 PathProgramCache]: Analyzing trace with hash 295709952, now seen corresponding path program 1 times [2023-08-27 10:05:05,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:05:05,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819375006] [2023-08-27 10:05:05,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:05:05,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:05:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:05:05,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:05:05,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:05:05,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819375006] [2023-08-27 10:05:05,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819375006] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:05:05,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:05:05,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:05:05,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898264117] [2023-08-27 10:05:05,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:05:05,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:05:05,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:05:05,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:05:05,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:05:05,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 253 [2023-08-27 10:05:05,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 75 transitions, 577 flow. Second operand has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:05,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:05:05,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 253 [2023-08-27 10:05:05,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:05:06,423 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([464] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd4~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_105 256) 0)) .cse2)) (.cse4 (and .cse3 .cse5))) (and (= v_~x~0_54 (ite .cse0 v_~x$w_buff0~0_39 (ite .cse1 v_~x$w_buff1~0_38 v_~x~0_55))) (= v_~x$r_buff1_thd4~0_21 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_104 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_25 256) 0)))) 0 v_~x$r_buff1_thd4~0_22)) (= (ite .cse0 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115) (= v_~x$r_buff0_thd4~0_25 (ite .cse4 0 v_~x$r_buff0_thd4~0_26)) (= v_~x$w_buff1_used~0_104 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_105))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_26, ~x~0=v_~x~0_55, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_22, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_25, ~x~0=v_~x~0_54, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_21, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][75], [Black: 189#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 194#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 190#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 192#(and (<= ~__unbuffered_p3_EAX~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 188#(<= ~__unbuffered_p3_EAX~0 0), 186#true, 167#(<= 1 ~__unbuffered_cnt~0), Black: 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 207#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P3Thread1of1ForFork2InUse, Black: 204#(= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, Black: 216#(<= ~__unbuffered_cnt~0 2), 46#L873true, 103#L795true, Black: 157#(= ~__unbuffered_cnt~0 0), 8#L770true, 83#L845true, 172#(<= ~__unbuffered_cnt~0 1), 215#(<= ~__unbuffered_cnt~0 1), 227#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 74#P2EXITtrue, Black: 177#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 175#true, Black: 178#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))]) [2023-08-27 10:05:06,423 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-27 10:05:06,423 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:05:06,423 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:05:06,423 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:05:06,482 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([464] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd4~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_105 256) 0)) .cse2)) (.cse4 (and .cse3 .cse5))) (and (= v_~x~0_54 (ite .cse0 v_~x$w_buff0~0_39 (ite .cse1 v_~x$w_buff1~0_38 v_~x~0_55))) (= v_~x$r_buff1_thd4~0_21 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_104 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_25 256) 0)))) 0 v_~x$r_buff1_thd4~0_22)) (= (ite .cse0 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115) (= v_~x$r_buff0_thd4~0_25 (ite .cse4 0 v_~x$r_buff0_thd4~0_26)) (= v_~x$w_buff1_used~0_104 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_105))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_26, ~x~0=v_~x~0_55, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_22, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_25, ~x~0=v_~x~0_54, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_21, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][110], [111#P0EXITtrue, Black: 189#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 194#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 190#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 192#(and (<= ~__unbuffered_p3_EAX~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 188#(<= ~__unbuffered_p3_EAX~0 0), 186#true, 167#(<= 1 ~__unbuffered_cnt~0), Black: 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 207#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P3Thread1of1ForFork2InUse, Black: 204#(= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 46#L873true, 103#L795true, 223#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 157#(= ~__unbuffered_cnt~0 0), 83#L845true, Black: 172#(<= ~__unbuffered_cnt~0 1), 74#P2EXITtrue, Black: 177#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 175#true, Black: 178#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 216#(<= ~__unbuffered_cnt~0 2)]) [2023-08-27 10:05:06,482 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-27 10:05:06,482 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:05:06,482 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:05:06,482 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-27 10:05:06,676 INFO L124 PetriNetUnfolderBase]: 6269/9784 cut-off events. [2023-08-27 10:05:06,676 INFO L125 PetriNetUnfolderBase]: For 20583/20865 co-relation queries the response was YES. [2023-08-27 10:05:06,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36135 conditions, 9784 events. 6269/9784 cut-off events. For 20583/20865 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 62441 event pairs, 824 based on Foata normal form. 534/9923 useless extension candidates. Maximal degree in co-relation 36104. Up to 3530 conditions per place. [2023-08-27 10:05:06,733 INFO L140 encePairwiseOnDemand]: 246/253 looper letters, 114 selfloop transitions, 19 changer transitions 4/155 dead transitions. [2023-08-27 10:05:06,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 155 transitions, 1243 flow [2023-08-27 10:05:06,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:05:06,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:05:06,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 884 transitions. [2023-08-27 10:05:06,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4991530208921513 [2023-08-27 10:05:06,736 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 884 transitions. [2023-08-27 10:05:06,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 884 transitions. [2023-08-27 10:05:06,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:05:06,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 884 transitions. [2023-08-27 10:05:06,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.28571428571429) internal successors, (884), 7 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:06,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 253.0) internal successors, (2024), 8 states have internal predecessors, (2024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:06,739 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 253.0) internal successors, (2024), 8 states have internal predecessors, (2024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:06,739 INFO L175 Difference]: Start difference. First operand has 77 places, 75 transitions, 577 flow. Second operand 7 states and 884 transitions. [2023-08-27 10:05:06,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 155 transitions, 1243 flow [2023-08-27 10:05:06,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 155 transitions, 1177 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-08-27 10:05:06,970 INFO L231 Difference]: Finished difference. Result has 83 places, 78 transitions, 609 flow [2023-08-27 10:05:06,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=609, PETRI_PLACES=83, PETRI_TRANSITIONS=78} [2023-08-27 10:05:06,970 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 32 predicate places. [2023-08-27 10:05:06,971 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 78 transitions, 609 flow [2023-08-27 10:05:06,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:06,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:05:06,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:05:06,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 10:05:06,971 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:05:06,971 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:05:06,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1499724960, now seen corresponding path program 1 times [2023-08-27 10:05:06,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:05:06,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200464162] [2023-08-27 10:05:06,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:05:06,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:05:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:05:07,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:05:07,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:05:07,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200464162] [2023-08-27 10:05:07,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200464162] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:05:07,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:05:07,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:05:07,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926452430] [2023-08-27 10:05:07,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:05:07,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:05:07,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:05:07,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:05:07,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:05:07,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 253 [2023-08-27 10:05:07,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 78 transitions, 609 flow. Second operand has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:07,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:05:07,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 253 [2023-08-27 10:05:07,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:05:08,442 INFO L124 PetriNetUnfolderBase]: 10689/16101 cut-off events. [2023-08-27 10:05:08,442 INFO L125 PetriNetUnfolderBase]: For 51249/51249 co-relation queries the response was YES. [2023-08-27 10:05:08,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64504 conditions, 16101 events. 10689/16101 cut-off events. For 51249/51249 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 98811 event pairs, 1181 based on Foata normal form. 141/16080 useless extension candidates. Maximal degree in co-relation 64470. Up to 6849 conditions per place. [2023-08-27 10:05:08,532 INFO L140 encePairwiseOnDemand]: 243/253 looper letters, 222 selfloop transitions, 46 changer transitions 8/276 dead transitions. [2023-08-27 10:05:08,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 276 transitions, 2457 flow [2023-08-27 10:05:08,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 10:05:08,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 10:05:08,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1109 transitions. [2023-08-27 10:05:08,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.487044356609574 [2023-08-27 10:05:08,534 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1109 transitions. [2023-08-27 10:05:08,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1109 transitions. [2023-08-27 10:05:08,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:05:08,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1109 transitions. [2023-08-27 10:05:08,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 123.22222222222223) internal successors, (1109), 9 states have internal predecessors, (1109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:08,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 253.0) internal successors, (2530), 10 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:08,539 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 253.0) internal successors, (2530), 10 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:08,539 INFO L175 Difference]: Start difference. First operand has 83 places, 78 transitions, 609 flow. Second operand 9 states and 1109 transitions. [2023-08-27 10:05:08,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 276 transitions, 2457 flow [2023-08-27 10:05:08,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 276 transitions, 2341 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-27 10:05:08,959 INFO L231 Difference]: Finished difference. Result has 93 places, 107 transitions, 1003 flow [2023-08-27 10:05:08,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1003, PETRI_PLACES=93, PETRI_TRANSITIONS=107} [2023-08-27 10:05:08,959 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 42 predicate places. [2023-08-27 10:05:08,959 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 107 transitions, 1003 flow [2023-08-27 10:05:08,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:08,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:05:08,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:05:08,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 10:05:08,960 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:05:08,960 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:05:08,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1015882320, now seen corresponding path program 2 times [2023-08-27 10:05:08,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:05:08,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462780715] [2023-08-27 10:05:08,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:05:08,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:05:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:05:09,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:05:09,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:05:09,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462780715] [2023-08-27 10:05:09,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462780715] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:05:09,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:05:09,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:05:09,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634502857] [2023-08-27 10:05:09,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:05:09,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:05:09,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:05:09,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:05:09,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:05:09,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 253 [2023-08-27 10:05:09,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 107 transitions, 1003 flow. Second operand has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:09,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:05:09,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 253 [2023-08-27 10:05:09,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:05:10,642 INFO L124 PetriNetUnfolderBase]: 11107/17646 cut-off events. [2023-08-27 10:05:10,642 INFO L125 PetriNetUnfolderBase]: For 58728/59365 co-relation queries the response was YES. [2023-08-27 10:05:10,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72326 conditions, 17646 events. 11107/17646 cut-off events. For 58728/59365 co-relation queries the response was YES. Maximal size of possible extension queue 730. Compared 123876 event pairs, 2011 based on Foata normal form. 173/17199 useless extension candidates. Maximal degree in co-relation 72286. Up to 7973 conditions per place. [2023-08-27 10:05:10,748 INFO L140 encePairwiseOnDemand]: 249/253 looper letters, 163 selfloop transitions, 12 changer transitions 4/207 dead transitions. [2023-08-27 10:05:10,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 207 transitions, 2043 flow [2023-08-27 10:05:10,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:05:10,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:05:10,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 646 transitions. [2023-08-27 10:05:10,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106719367588933 [2023-08-27 10:05:10,749 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 646 transitions. [2023-08-27 10:05:10,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 646 transitions. [2023-08-27 10:05:10,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:05:10,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 646 transitions. [2023-08-27 10:05:10,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:10,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:10,752 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:10,752 INFO L175 Difference]: Start difference. First operand has 93 places, 107 transitions, 1003 flow. Second operand 5 states and 646 transitions. [2023-08-27 10:05:10,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 207 transitions, 2043 flow [2023-08-27 10:05:11,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 207 transitions, 2043 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 10:05:11,345 INFO L231 Difference]: Finished difference. Result has 99 places, 109 transitions, 1066 flow [2023-08-27 10:05:11,345 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=1003, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1066, PETRI_PLACES=99, PETRI_TRANSITIONS=109} [2023-08-27 10:05:11,345 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 48 predicate places. [2023-08-27 10:05:11,346 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 109 transitions, 1066 flow [2023-08-27 10:05:11,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:11,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:05:11,346 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:05:11,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 10:05:11,346 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:05:11,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:05:11,346 INFO L85 PathProgramCache]: Analyzing trace with hash 537404184, now seen corresponding path program 3 times [2023-08-27 10:05:11,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:05:11,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495902901] [2023-08-27 10:05:11,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:05:11,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:05:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:05:11,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:05:11,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:05:11,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495902901] [2023-08-27 10:05:11,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495902901] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:05:11,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:05:11,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:05:11,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922042075] [2023-08-27 10:05:11,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:05:11,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:05:11,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:05:11,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:05:11,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:05:11,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 253 [2023-08-27 10:05:11,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 109 transitions, 1066 flow. Second operand has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:11,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:05:11,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 253 [2023-08-27 10:05:11,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:05:12,803 INFO L124 PetriNetUnfolderBase]: 8064/12607 cut-off events. [2023-08-27 10:05:12,804 INFO L125 PetriNetUnfolderBase]: For 43308/43750 co-relation queries the response was YES. [2023-08-27 10:05:12,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51879 conditions, 12607 events. 8064/12607 cut-off events. For 43308/43750 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 84798 event pairs, 704 based on Foata normal form. 443/12578 useless extension candidates. Maximal degree in co-relation 51836. Up to 2866 conditions per place. [2023-08-27 10:05:12,874 INFO L140 encePairwiseOnDemand]: 246/253 looper letters, 155 selfloop transitions, 28 changer transitions 4/213 dead transitions. [2023-08-27 10:05:12,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 213 transitions, 2014 flow [2023-08-27 10:05:12,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 10:05:12,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 10:05:12,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1133 transitions. [2023-08-27 10:05:12,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4975845410628019 [2023-08-27 10:05:12,877 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1133 transitions. [2023-08-27 10:05:12,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1133 transitions. [2023-08-27 10:05:12,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:05:12,877 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1133 transitions. [2023-08-27 10:05:12,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 125.88888888888889) internal successors, (1133), 9 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:12,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 253.0) internal successors, (2530), 10 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:12,881 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 253.0) internal successors, (2530), 10 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:12,881 INFO L175 Difference]: Start difference. First operand has 99 places, 109 transitions, 1066 flow. Second operand 9 states and 1133 transitions. [2023-08-27 10:05:12,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 213 transitions, 2014 flow [2023-08-27 10:05:13,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 213 transitions, 1920 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-27 10:05:13,585 INFO L231 Difference]: Finished difference. Result has 105 places, 99 transitions, 940 flow [2023-08-27 10:05:13,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=940, PETRI_PLACES=105, PETRI_TRANSITIONS=99} [2023-08-27 10:05:13,586 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 54 predicate places. [2023-08-27 10:05:13,586 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 99 transitions, 940 flow [2023-08-27 10:05:13,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:13,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:05:13,586 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:05:13,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 10:05:13,587 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:05:13,587 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:05:13,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1098108968, now seen corresponding path program 1 times [2023-08-27 10:05:13,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:05:13,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345661058] [2023-08-27 10:05:13,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:05:13,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:05:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:05:13,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:05:13,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:05:13,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345661058] [2023-08-27 10:05:13,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345661058] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:05:13,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:05:13,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:05:13,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643300410] [2023-08-27 10:05:13,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:05:13,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:05:13,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:05:13,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:05:13,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:05:13,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 253 [2023-08-27 10:05:13,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 99 transitions, 940 flow. Second operand has 6 states, 6 states have (on average 116.33333333333333) internal successors, (698), 6 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:13,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:05:13,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 253 [2023-08-27 10:05:13,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:05:14,990 INFO L124 PetriNetUnfolderBase]: 7930/12352 cut-off events. [2023-08-27 10:05:14,990 INFO L125 PetriNetUnfolderBase]: For 49086/49494 co-relation queries the response was YES. [2023-08-27 10:05:15,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55661 conditions, 12352 events. 7930/12352 cut-off events. For 49086/49494 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 82925 event pairs, 1248 based on Foata normal form. 82/12075 useless extension candidates. Maximal degree in co-relation 55617. Up to 4611 conditions per place. [2023-08-27 10:05:15,058 INFO L140 encePairwiseOnDemand]: 244/253 looper letters, 84 selfloop transitions, 29 changer transitions 24/156 dead transitions. [2023-08-27 10:05:15,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 156 transitions, 1562 flow [2023-08-27 10:05:15,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:05:15,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:05:15,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 763 transitions. [2023-08-27 10:05:15,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502635046113307 [2023-08-27 10:05:15,060 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 763 transitions. [2023-08-27 10:05:15,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 763 transitions. [2023-08-27 10:05:15,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:05:15,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 763 transitions. [2023-08-27 10:05:15,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:15,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 253.0) internal successors, (1771), 7 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:15,063 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 253.0) internal successors, (1771), 7 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:15,063 INFO L175 Difference]: Start difference. First operand has 105 places, 99 transitions, 940 flow. Second operand 6 states and 763 transitions. [2023-08-27 10:05:15,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 156 transitions, 1562 flow [2023-08-27 10:05:16,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 156 transitions, 1508 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-08-27 10:05:16,323 INFO L231 Difference]: Finished difference. Result has 100 places, 77 transitions, 697 flow [2023-08-27 10:05:16,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=697, PETRI_PLACES=100, PETRI_TRANSITIONS=77} [2023-08-27 10:05:16,324 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 49 predicate places. [2023-08-27 10:05:16,324 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 77 transitions, 697 flow [2023-08-27 10:05:16,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.33333333333333) internal successors, (698), 6 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:16,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:05:16,324 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:05:16,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 10:05:16,325 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:05:16,325 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:05:16,325 INFO L85 PathProgramCache]: Analyzing trace with hash 171034206, now seen corresponding path program 1 times [2023-08-27 10:05:16,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:05:16,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665723117] [2023-08-27 10:05:16,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:05:16,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:05:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:05:16,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:05:16,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:05:16,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665723117] [2023-08-27 10:05:16,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665723117] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:05:16,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:05:16,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:05:16,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418594117] [2023-08-27 10:05:16,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:05:16,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:05:16,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:05:16,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:05:16,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:05:16,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 253 [2023-08-27 10:05:16,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 77 transitions, 697 flow. Second operand has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:16,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:05:16,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 253 [2023-08-27 10:05:16,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:05:18,060 INFO L124 PetriNetUnfolderBase]: 12160/18594 cut-off events. [2023-08-27 10:05:18,060 INFO L125 PetriNetUnfolderBase]: For 86017/86501 co-relation queries the response was YES. [2023-08-27 10:05:18,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86307 conditions, 18594 events. 12160/18594 cut-off events. For 86017/86501 co-relation queries the response was YES. Maximal size of possible extension queue 956. Compared 125702 event pairs, 4000 based on Foata normal form. 52/18382 useless extension candidates. Maximal degree in co-relation 86263. Up to 9987 conditions per place. [2023-08-27 10:05:18,144 INFO L140 encePairwiseOnDemand]: 249/253 looper letters, 79 selfloop transitions, 7 changer transitions 47/139 dead transitions. [2023-08-27 10:05:18,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 139 transitions, 1470 flow [2023-08-27 10:05:18,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:05:18,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:05:18,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 506 transitions. [2023-08-27 10:05:18,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-27 10:05:18,146 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 506 transitions. [2023-08-27 10:05:18,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 506 transitions. [2023-08-27 10:05:18,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:05:18,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 506 transitions. [2023-08-27 10:05:18,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:18,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:18,148 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:18,148 INFO L175 Difference]: Start difference. First operand has 100 places, 77 transitions, 697 flow. Second operand 4 states and 506 transitions. [2023-08-27 10:05:18,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 139 transitions, 1470 flow [2023-08-27 10:05:20,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 139 transitions, 1159 flow, removed 55 selfloop flow, removed 13 redundant places. [2023-08-27 10:05:20,241 INFO L231 Difference]: Finished difference. Result has 83 places, 65 transitions, 448 flow [2023-08-27 10:05:20,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=448, PETRI_PLACES=83, PETRI_TRANSITIONS=65} [2023-08-27 10:05:20,242 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 32 predicate places. [2023-08-27 10:05:20,242 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 65 transitions, 448 flow [2023-08-27 10:05:20,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:20,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:05:20,242 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:05:20,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 10:05:20,242 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:05:20,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:05:20,242 INFO L85 PathProgramCache]: Analyzing trace with hash -930624137, now seen corresponding path program 1 times [2023-08-27 10:05:20,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:05:20,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872880219] [2023-08-27 10:05:20,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:05:20,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:05:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:05:20,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:05:20,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:05:20,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872880219] [2023-08-27 10:05:20,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872880219] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:05:20,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:05:20,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:05:20,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815505182] [2023-08-27 10:05:20,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:05:20,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 10:05:20,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:05:20,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 10:05:20,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-27 10:05:20,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 253 [2023-08-27 10:05:20,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 65 transitions, 448 flow. Second operand has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:20,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:05:20,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 253 [2023-08-27 10:05:20,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:05:22,309 INFO L124 PetriNetUnfolderBase]: 11104/18969 cut-off events. [2023-08-27 10:05:22,309 INFO L125 PetriNetUnfolderBase]: For 42647/43426 co-relation queries the response was YES. [2023-08-27 10:05:22,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72015 conditions, 18969 events. 11104/18969 cut-off events. For 42647/43426 co-relation queries the response was YES. Maximal size of possible extension queue 1265. Compared 157531 event pairs, 1933 based on Foata normal form. 190/18762 useless extension candidates. Maximal degree in co-relation 71979. Up to 9522 conditions per place. [2023-08-27 10:05:22,375 INFO L140 encePairwiseOnDemand]: 244/253 looper letters, 114 selfloop transitions, 9 changer transitions 102/236 dead transitions. [2023-08-27 10:05:22,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 236 transitions, 1934 flow [2023-08-27 10:05:22,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 10:05:22,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 10:05:22,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 971 transitions. [2023-08-27 10:05:22,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4797430830039526 [2023-08-27 10:05:22,377 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 971 transitions. [2023-08-27 10:05:22,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 971 transitions. [2023-08-27 10:05:22,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:05:22,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 971 transitions. [2023-08-27 10:05:22,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 121.375) internal successors, (971), 8 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:22,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 253.0) internal successors, (2277), 9 states have internal predecessors, (2277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:22,381 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 253.0) internal successors, (2277), 9 states have internal predecessors, (2277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:22,381 INFO L175 Difference]: Start difference. First operand has 83 places, 65 transitions, 448 flow. Second operand 8 states and 971 transitions. [2023-08-27 10:05:22,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 236 transitions, 1934 flow [2023-08-27 10:05:23,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 236 transitions, 1895 flow, removed 11 selfloop flow, removed 5 redundant places. [2023-08-27 10:05:23,142 INFO L231 Difference]: Finished difference. Result has 88 places, 72 transitions, 510 flow [2023-08-27 10:05:23,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=77, 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=8, PETRI_FLOW=510, PETRI_PLACES=88, PETRI_TRANSITIONS=72} [2023-08-27 10:05:23,143 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 37 predicate places. [2023-08-27 10:05:23,143 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 72 transitions, 510 flow [2023-08-27 10:05:23,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:23,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:05:23,143 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:05:23,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 10:05:23,143 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:05:23,143 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:05:23,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1698207251, now seen corresponding path program 2 times [2023-08-27 10:05:23,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:05:23,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592387537] [2023-08-27 10:05:23,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:05:23,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:05:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:05:23,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:05:23,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:05:23,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592387537] [2023-08-27 10:05:23,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592387537] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:05:23,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:05:23,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 10:05:23,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812557091] [2023-08-27 10:05:23,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:05:23,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 10:05:23,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:05:23,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 10:05:23,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-27 10:05:23,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 253 [2023-08-27 10:05:23,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 72 transitions, 510 flow. Second operand has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:23,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:05:23,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 253 [2023-08-27 10:05:23,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:05:24,595 INFO L124 PetriNetUnfolderBase]: 8906/14557 cut-off events. [2023-08-27 10:05:24,596 INFO L125 PetriNetUnfolderBase]: For 39974/41099 co-relation queries the response was YES. [2023-08-27 10:05:24,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60457 conditions, 14557 events. 8906/14557 cut-off events. For 39974/41099 co-relation queries the response was YES. Maximal size of possible extension queue 1011. Compared 111396 event pairs, 484 based on Foata normal form. 335/14563 useless extension candidates. Maximal degree in co-relation 60427. Up to 2710 conditions per place. [2023-08-27 10:05:24,657 INFO L140 encePairwiseOnDemand]: 246/253 looper letters, 92 selfloop transitions, 28 changer transitions 84/210 dead transitions. [2023-08-27 10:05:24,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 210 transitions, 1742 flow [2023-08-27 10:05:24,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 10:05:24,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 10:05:24,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1343 transitions. [2023-08-27 10:05:24,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4825727632051743 [2023-08-27 10:05:24,659 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1343 transitions. [2023-08-27 10:05:24,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1343 transitions. [2023-08-27 10:05:24,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:05:24,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1343 transitions. [2023-08-27 10:05:24,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 122.0909090909091) internal successors, (1343), 11 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:24,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 253.0) internal successors, (3036), 12 states have internal predecessors, (3036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:24,664 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 253.0) internal successors, (3036), 12 states have internal predecessors, (3036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:24,664 INFO L175 Difference]: Start difference. First operand has 88 places, 72 transitions, 510 flow. Second operand 11 states and 1343 transitions. [2023-08-27 10:05:24,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 210 transitions, 1742 flow [2023-08-27 10:05:25,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 210 transitions, 1713 flow, removed 13 selfloop flow, removed 4 redundant places. [2023-08-27 10:05:25,554 INFO L231 Difference]: Finished difference. Result has 94 places, 60 transitions, 452 flow [2023-08-27 10:05:25,554 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=452, PETRI_PLACES=94, PETRI_TRANSITIONS=60} [2023-08-27 10:05:25,554 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 43 predicate places. [2023-08-27 10:05:25,555 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 60 transitions, 452 flow [2023-08-27 10:05:25,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:25,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:05:25,555 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:05:25,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 10:05:25,555 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:05:25,555 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:05:25,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1086019951, now seen corresponding path program 1 times [2023-08-27 10:05:25,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:05:25,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947223085] [2023-08-27 10:05:25,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:05:25,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:05:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:05:25,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:05:25,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:05:25,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947223085] [2023-08-27 10:05:25,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947223085] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:05:25,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:05:25,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:05:25,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822919636] [2023-08-27 10:05:25,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:05:25,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:05:25,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:05:25,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:05:25,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:05:25,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 253 [2023-08-27 10:05:25,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 60 transitions, 452 flow. Second operand has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:25,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:05:25,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 253 [2023-08-27 10:05:25,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:05:26,281 INFO L124 PetriNetUnfolderBase]: 3919/6256 cut-off events. [2023-08-27 10:05:26,281 INFO L125 PetriNetUnfolderBase]: For 21332/21332 co-relation queries the response was YES. [2023-08-27 10:05:26,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29298 conditions, 6256 events. 3919/6256 cut-off events. For 21332/21332 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 37066 event pairs, 1182 based on Foata normal form. 1/6257 useless extension candidates. Maximal degree in co-relation 29272. Up to 3441 conditions per place. [2023-08-27 10:05:26,306 INFO L140 encePairwiseOnDemand]: 246/253 looper letters, 58 selfloop transitions, 5 changer transitions 81/144 dead transitions. [2023-08-27 10:05:26,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 144 transitions, 1348 flow [2023-08-27 10:05:26,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:05:26,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:05:26,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 801 transitions. [2023-08-27 10:05:26,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4522868435911914 [2023-08-27 10:05:26,308 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 801 transitions. [2023-08-27 10:05:26,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 801 transitions. [2023-08-27 10:05:26,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:05:26,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 801 transitions. [2023-08-27 10:05:26,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.42857142857143) internal successors, (801), 7 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:26,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 253.0) internal successors, (2024), 8 states have internal predecessors, (2024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:26,311 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 253.0) internal successors, (2024), 8 states have internal predecessors, (2024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:26,311 INFO L175 Difference]: Start difference. First operand has 94 places, 60 transitions, 452 flow. Second operand 7 states and 801 transitions. [2023-08-27 10:05:26,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 144 transitions, 1348 flow [2023-08-27 10:05:26,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 144 transitions, 1111 flow, removed 35 selfloop flow, removed 17 redundant places. [2023-08-27 10:05:26,415 INFO L231 Difference]: Finished difference. Result has 80 places, 45 transitions, 250 flow [2023-08-27 10:05:26,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=250, PETRI_PLACES=80, PETRI_TRANSITIONS=45} [2023-08-27 10:05:26,415 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 29 predicate places. [2023-08-27 10:05:26,416 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 45 transitions, 250 flow [2023-08-27 10:05:26,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:26,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:05:26,416 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:05:26,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-27 10:05:26,416 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:05:26,416 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:05:26,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1466968591, now seen corresponding path program 2 times [2023-08-27 10:05:26,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:05:26,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259240868] [2023-08-27 10:05:26,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:05:26,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:05:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:05:26,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:05:26,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:05:26,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259240868] [2023-08-27 10:05:26,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259240868] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:05:26,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:05:26,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 10:05:26,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330649725] [2023-08-27 10:05:26,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:05:26,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 10:05:26,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:05:26,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 10:05:26,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-27 10:05:26,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 253 [2023-08-27 10:05:26,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 45 transitions, 250 flow. Second operand has 8 states, 8 states have (on average 112.0) internal successors, (896), 8 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:26,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:05:26,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 253 [2023-08-27 10:05:26,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:05:27,202 INFO L124 PetriNetUnfolderBase]: 482/831 cut-off events. [2023-08-27 10:05:27,202 INFO L125 PetriNetUnfolderBase]: For 1238/1256 co-relation queries the response was YES. [2023-08-27 10:05:27,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3217 conditions, 831 events. 482/831 cut-off events. For 1238/1256 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3403 event pairs, 65 based on Foata normal form. 11/832 useless extension candidates. Maximal degree in co-relation 3196. Up to 408 conditions per place. [2023-08-27 10:05:27,204 INFO L140 encePairwiseOnDemand]: 246/253 looper letters, 46 selfloop transitions, 5 changer transitions 49/104 dead transitions. [2023-08-27 10:05:27,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 104 transitions, 762 flow [2023-08-27 10:05:27,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:05:27,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:05:27,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 825 transitions. [2023-08-27 10:05:27,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4658385093167702 [2023-08-27 10:05:27,209 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 825 transitions. [2023-08-27 10:05:27,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 825 transitions. [2023-08-27 10:05:27,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:05:27,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 825 transitions. [2023-08-27 10:05:27,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.85714285714286) internal successors, (825), 7 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:27,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 253.0) internal successors, (2024), 8 states have internal predecessors, (2024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:27,212 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 253.0) internal successors, (2024), 8 states have internal predecessors, (2024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:27,212 INFO L175 Difference]: Start difference. First operand has 80 places, 45 transitions, 250 flow. Second operand 7 states and 825 transitions. [2023-08-27 10:05:27,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 104 transitions, 762 flow [2023-08-27 10:05:27,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 104 transitions, 712 flow, removed 17 selfloop flow, removed 12 redundant places. [2023-08-27 10:05:27,216 INFO L231 Difference]: Finished difference. Result has 69 places, 48 transitions, 266 flow [2023-08-27 10:05:27,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=266, PETRI_PLACES=69, PETRI_TRANSITIONS=48} [2023-08-27 10:05:27,217 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2023-08-27 10:05:27,217 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 48 transitions, 266 flow [2023-08-27 10:05:27,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 112.0) internal successors, (896), 8 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:05:27,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:05:27,217 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:05:27,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-27 10:05:27,217 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:05:27,217 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:05:27,217 INFO L85 PathProgramCache]: Analyzing trace with hash -448180965, now seen corresponding path program 3 times [2023-08-27 10:05:27,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:05:27,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539953074] [2023-08-27 10:05:27,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:05:27,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:05:27,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:05:27,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 10:05:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:05:27,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 10:05:27,320 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 10:05:27,320 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (22 of 23 remaining) [2023-08-27 10:05:27,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 23 remaining) [2023-08-27 10:05:27,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2023-08-27 10:05:27,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (19 of 23 remaining) [2023-08-27 10:05:27,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2023-08-27 10:05:27,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2023-08-27 10:05:27,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2023-08-27 10:05:27,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 23 remaining) [2023-08-27 10:05:27,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2023-08-27 10:05:27,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2023-08-27 10:05:27,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2023-08-27 10:05:27,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2023-08-27 10:05:27,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2023-08-27 10:05:27,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2023-08-27 10:05:27,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 23 remaining) [2023-08-27 10:05:27,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2023-08-27 10:05:27,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (6 of 23 remaining) [2023-08-27 10:05:27,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2023-08-27 10:05:27,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2023-08-27 10:05:27,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2023-08-27 10:05:27,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 23 remaining) [2023-08-27 10:05:27,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2023-08-27 10:05:27,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2023-08-27 10:05:27,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-27 10:05:27,326 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:05:27,329 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 10:05:27,329 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 10:05:27,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 10:05:27 BasicIcfg [2023-08-27 10:05:27,399 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 10:05:27,399 INFO L158 Benchmark]: Toolchain (without parser) took 40022.48ms. Allocated memory was 392.2MB in the beginning and 4.7GB in the end (delta: 4.3GB). Free memory was 365.6MB in the beginning and 4.2GB in the end (delta: -3.8GB). Peak memory consumption was 470.9MB. Max. memory is 16.0GB. [2023-08-27 10:05:27,399 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 392.2MB. Free memory is still 369.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 10:05:27,399 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.41ms. Allocated memory is still 392.2MB. Free memory was 365.6MB in the beginning and 342.3MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 10:05:27,400 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.84ms. Allocated memory is still 392.2MB. Free memory was 341.4MB in the beginning and 339.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:05:27,400 INFO L158 Benchmark]: Boogie Preprocessor took 26.66ms. Allocated memory is still 392.2MB. Free memory was 339.3MB in the beginning and 337.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:05:27,400 INFO L158 Benchmark]: RCFGBuilder took 514.58ms. Allocated memory is still 392.2MB. Free memory was 337.2MB in the beginning and 297.4MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. [2023-08-27 10:05:27,400 INFO L158 Benchmark]: TraceAbstraction took 39029.77ms. Allocated memory was 392.2MB in the beginning and 4.7GB in the end (delta: 4.3GB). Free memory was 296.5MB in the beginning and 4.2GB in the end (delta: -3.9GB). Peak memory consumption was 401.7MB. Max. memory is 16.0GB. [2023-08-27 10:05:27,405 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 392.2MB. Free memory is still 369.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 404.41ms. Allocated memory is still 392.2MB. Free memory was 365.6MB in the beginning and 342.3MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 42.84ms. Allocated memory is still 392.2MB. Free memory was 341.4MB in the beginning and 339.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 26.66ms. Allocated memory is still 392.2MB. Free memory was 339.3MB in the beginning and 337.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 514.58ms. Allocated memory is still 392.2MB. Free memory was 337.2MB in the beginning and 297.4MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. * TraceAbstraction took 39029.77ms. Allocated memory was 392.2MB in the beginning and 4.7GB in the end (delta: 4.3GB). Free memory was 296.5MB in the beginning and 4.2GB in the end (delta: -3.9GB). Peak memory consumption was 401.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 148 PlacesBefore, 51 PlacesAfterwards, 138 TransitionsBefore, 39 TransitionsAfterwards, 4356 CoEnabledTransitionPairs, 8 FixpointIterations, 43 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 111 TotalNumberOfCompositions, 16194 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5940, independent: 5547, independent conditional: 0, independent unconditional: 5547, dependent: 393, dependent conditional: 0, dependent unconditional: 393, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2200, independent: 2133, independent conditional: 0, independent unconditional: 2133, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5940, independent: 3414, independent conditional: 0, independent unconditional: 3414, dependent: 326, dependent conditional: 0, dependent unconditional: 326, unknown: 2200, unknown conditional: 0, unknown unconditional: 2200] , Statistics on independence cache: Total cache size (in pairs): 245, Positive cache size: 219, Positive conditional cache size: 0, Positive unconditional cache size: 219, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p3_EAX = 0; [L719] 0 int __unbuffered_p3_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L726] 0 _Bool x$flush_delayed; [L727] 0 int x$mem_tmp; [L728] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$r_buff0_thd1; [L730] 0 _Bool x$r_buff0_thd2; [L731] 0 _Bool x$r_buff0_thd3; [L732] 0 _Bool x$r_buff0_thd4; [L733] 0 _Bool x$r_buff1_thd0; [L734] 0 _Bool x$r_buff1_thd1; [L735] 0 _Bool x$r_buff1_thd2; [L736] 0 _Bool x$r_buff1_thd3; [L737] 0 _Bool x$r_buff1_thd4; [L738] 0 _Bool x$read_delayed; [L739] 0 int *x$read_delayed_var; [L740] 0 int x$w_buff0; [L741] 0 _Bool x$w_buff0_used; [L742] 0 int x$w_buff1; [L743] 0 _Bool x$w_buff1_used; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L862] 0 pthread_t t685; [L863] FCALL, FORK 0 pthread_create(&t685, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t685, ((void *)0), P0, ((void *)0))=-3, t685={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L864] 0 pthread_t t686; [L865] FCALL, FORK 0 pthread_create(&t686, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t686, ((void *)0), P1, ((void *)0))=-2, t685={5:0}, t686={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L866] 0 pthread_t t687; [L867] FCALL, FORK 0 pthread_create(&t687, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t687, ((void *)0), P2, ((void *)0))=-1, t685={5:0}, t686={6:0}, t687={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L868] 0 pthread_t t688; [L869] FCALL, FORK 0 pthread_create(&t688, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t688, ((void *)0), P3, ((void *)0))=0, t685={5:0}, t686={6:0}, t687={7:0}, t688={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L781] 2 x$w_buff1 = x$w_buff0 [L782] 2 x$w_buff0 = 1 [L783] 2 x$w_buff1_used = x$w_buff0_used [L784] 2 x$w_buff0_used = (_Bool)1 [L785] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L785] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L786] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L787] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L788] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L789] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L790] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L791] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L794] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L811] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L814] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L831] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L834] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L837] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L753] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 x$flush_delayed = weak$$choice2 [L759] 1 x$mem_tmp = x [L760] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L761] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L762] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L763] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L764] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L766] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p0_EAX = x [L768] 1 x = x$flush_delayed ? x$mem_tmp : x [L769] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L797] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L774] EXPR 1 __unbuffered_cnt + 1 [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 1 return 0; [L804] EXPR 2 __unbuffered_cnt + 1 [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L817] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L818] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L819] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L820] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L821] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L840] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L841] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L842] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L843] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L844] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L824] EXPR 3 __unbuffered_cnt + 1 [L824] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L826] 3 return 0; [L847] EXPR 4 __unbuffered_cnt + 1 [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L849] 4 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L876] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L877] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L878] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L879] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t685={5:0}, t686={6:0}, t687={7:0}, t688={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L882] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "mix026_power.opt_tso.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] - UnprovableResult [Line: 774]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 774]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 804]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 804]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 869]: 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: 865]: 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: 867]: 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: 863]: 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, 185 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: 38.9s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 32.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 981 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 981 mSDsluCounter, 81 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2809 IncrementalHoareTripleChecker+Invalid, 2898 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 44 mSDtfsCounter, 2809 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1066occurred in iteration=11, InterpolantAutomatonStates: 109, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 1809 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-27 10:05:27,424 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...